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
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163

//! Bincode-based FFI for polynomial operations

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::core::Expr;
use crate::symbolic::polynomial::contains_var;
use crate::symbolic::polynomial::is_polynomial;
use crate::symbolic::polynomial::leading_coefficient;
use crate::symbolic::polynomial::polynomial_degree;
use crate::symbolic::polynomial::polynomial_long_division;
use crate::symbolic::polynomial::to_polynomial_coeffs_vec;

/// Checks if an expression is a polynomial in the given variable (bincode)
#[unsafe(no_mangle)]
pub extern "C" fn rssn_bincode_polynomial_is_polynomial(
    expr_buf: BincodeBuffer,
    var: *const c_char,
) -> bool {
    let expr: Option<Expr> = from_bincode_buffer(&expr_buf);

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

    match (expr, var_str) {
        | (Some(e), Some(v)) => is_polynomial(&e, v),
        | _ => false,
    }
}

/// Computes the degree of a polynomial (bincode)
#[unsafe(no_mangle)]
pub extern "C" fn rssn_bincode_polynomial_degree(
    expr_buf: BincodeBuffer,
    var: *const c_char,
) -> i64 {
    let expr: Option<Expr> = from_bincode_buffer(&expr_buf);

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

    match (expr, var_str) {
        | (Some(e), Some(v)) => polynomial_degree(&e, v),
        | _ => -1,
    }
}

/// Performs polynomial long division (bincode)
#[unsafe(no_mangle)]
pub extern "C" fn rssn_bincode_polynomial_long_division(
    dividend_buf: BincodeBuffer,
    divisor_buf: BincodeBuffer,
    var: *const c_char,
) -> BincodeBuffer {
    let dividend: Option<Expr> = from_bincode_buffer(&dividend_buf);

    let divisor: Option<Expr> = from_bincode_buffer(&divisor_buf);

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

    match (dividend, divisor, var_str) {
        | (Some(d), Some(div), Some(v)) => {
            let (quotient, remainder) = polynomial_long_division(&d, &div, v);

            let result = (quotient, remainder);

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

/// Finds the leading coefficient of a polynomial (bincode)
#[unsafe(no_mangle)]
pub extern "C" fn rssn_bincode_polynomial_leading_coefficient(
    expr_buf: BincodeBuffer,
    var: *const c_char,
) -> BincodeBuffer {
    let expr: Option<Expr> = from_bincode_buffer(&expr_buf);

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

    match (expr, var_str) {
        | (Some(e), Some(v)) => {
            let result = leading_coefficient(&e, v);

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

/// Converts polynomial to coefficient vector (bincode)
#[unsafe(no_mangle)]
pub extern "C" fn rssn_bincode_polynomial_to_coeffs_vec(
    expr_buf: BincodeBuffer,
    var: *const c_char,
) -> BincodeBuffer {
    let expr: Option<Expr> = from_bincode_buffer(&expr_buf);

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

    match (expr, var_str) {
        | (Some(e), Some(v)) => {
            let coeffs = to_polynomial_coeffs_vec(&e, v);

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

/// Checks if an expression contains a variable (bincode)
#[unsafe(no_mangle)]
pub extern "C" fn rssn_bincode_polynomial_contains_var(
    expr_buf: BincodeBuffer,
    var: *const c_char,
) -> bool {
    let expr: Option<Expr> = from_bincode_buffer(&expr_buf);

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

    match (expr, var_str) {
        | (Some(e), Some(v)) => contains_var(&e, v),
        | _ => false,
    }
}