rssn 0.2.9

A comprehensive scientific computing library for Rust, aiming for feature parity with NumPy and SymPy.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114

//! Bincode-based FFI API for calculus of variations functions.

use std::os::raw::c_char;

use crate::ffi_apis::common::BincodeBuffer;
use crate::ffi_apis::common::from_bincode_buffer;
use crate::ffi_apis::common::to_bincode_buffer;
use crate::symbolic::calculus_of_variations;
use crate::symbolic::core::Expr;

/// Computes the Euler-Lagrange equation using Bincode.
#[unsafe(no_mangle)]
pub extern "C" fn rssn_bincode_euler_lagrange(
    lagrangian_buf: BincodeBuffer,
    func: *const c_char,
    var: *const c_char,
) -> BincodeBuffer {
    let lagrangian: Option<Expr> = from_bincode_buffer(&lagrangian_buf);

    let func_str = unsafe {
        if func.is_null() {
            None
        } else {
            std::ffi::CStr::from_ptr(func).to_str().ok()
        }
    };

    let var_str = unsafe {
        if var.is_null() {
            None
        } else {
            std::ffi::CStr::from_ptr(var).to_str().ok()
        }
    };

    match (lagrangian, func_str, var_str) {
        | (Some(l), Some(f), Some(v)) => {
            let result = calculus_of_variations::euler_lagrange(&l, f, v);

            to_bincode_buffer(&result)
        },
        | _ => BincodeBuffer::empty(),
    }
}

/// Generates and attempts to solve the Euler-Lagrange equation using Bincode.
#[unsafe(no_mangle)]
pub extern "C" fn rssn_bincode_solve_euler_lagrange(
    lagrangian_buf: BincodeBuffer,
    func: *const c_char,
    var: *const c_char,
) -> BincodeBuffer {
    let lagrangian: Option<Expr> = from_bincode_buffer(&lagrangian_buf);

    let func_str = unsafe {
        if func.is_null() {
            None
        } else {
            std::ffi::CStr::from_ptr(func).to_str().ok()
        }
    };

    let var_str = unsafe {
        if var.is_null() {
            None
        } else {
            std::ffi::CStr::from_ptr(var).to_str().ok()
        }
    };

    match (lagrangian, func_str, var_str) {
        | (Some(l), Some(f), Some(v)) => {
            let result = calculus_of_variations::solve_euler_lagrange(&l, f, v);

            to_bincode_buffer(&result)
        },
        | _ => BincodeBuffer::empty(),
    }
}

/// Applies Hamilton's Principle using Bincode.
#[unsafe(no_mangle)]
pub extern "C" fn rssn_bincode_hamiltons_principle(
    lagrangian_buf: BincodeBuffer,
    func: *const c_char,
    var: *const c_char,
) -> BincodeBuffer {
    let lagrangian: Option<Expr> = from_bincode_buffer(&lagrangian_buf);

    let func_str = unsafe {
        if func.is_null() {
            None
        } else {
            std::ffi::CStr::from_ptr(func).to_str().ok()
        }
    };

    let var_str = unsafe {
        if var.is_null() {
            None
        } else {
            std::ffi::CStr::from_ptr(var).to_str().ok()
        }
    };

    match (lagrangian, func_str, var_str) {
        | (Some(l), Some(f), Some(v)) => {
            let result = calculus_of_variations::hamiltons_principle(&l, f, v);

            to_bincode_buffer(&result)
        },
        | _ => BincodeBuffer::empty(),
    }
}