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

use crate::symbolic::finite_field::FiniteFieldPolynomial;
use crate::symbolic::poly_factorization::factor_gf;
use crate::symbolic::poly_factorization::poly_derivative_gf;
use crate::symbolic::poly_factorization::poly_gcd_gf;
use crate::symbolic::poly_factorization::square_free_factorization_gf;

/// Factors a polynomial over a finite field (Handle)
#[unsafe(no_mangle)]
pub extern "C" fn rssn_factor_gf_handle(
    poly: *const FiniteFieldPolynomial
) -> *mut Vec<FiniteFieldPolynomial> {
    let poly_ref = unsafe {
        if poly.is_null() {
            return std::ptr::null_mut();
        }

        &*poly
    };

    match factor_gf(poly_ref) {
        | Ok(factors) => Box::into_raw(Box::new(factors)),
        | Err(_) => std::ptr::null_mut(),
    }
}

/// Computes square-free factorization (Handle)
#[unsafe(no_mangle)]
pub extern "C" fn rssn_square_free_factorization_gf_handle(
    poly: *const FiniteFieldPolynomial
) -> *mut Vec<(FiniteFieldPolynomial, usize)> {
    let poly_ref = unsafe {
        if poly.is_null() {
            return std::ptr::null_mut();
        }

        &*poly
    };

    match square_free_factorization_gf(poly_ref.clone()) {
        | Ok(factors) => Box::into_raw(Box::new(factors)),
        | Err(_) => std::ptr::null_mut(),
    }
}

/// Computes polynomial GCD over finite field (Handle)
#[unsafe(no_mangle)]
pub extern "C" fn rssn_poly_gcd_gf_handle(
    a: *const FiniteFieldPolynomial,
    b: *const FiniteFieldPolynomial,
) -> *mut FiniteFieldPolynomial {
    let a_ref = unsafe {
        if a.is_null() {
            return std::ptr::null_mut();
        }

        &*a
    };

    let b_ref = unsafe {
        if b.is_null() {
            return std::ptr::null_mut();
        }

        &*b
    };

    match poly_gcd_gf(a_ref.clone(), b_ref.clone()) {
        | Ok(gcd) => Box::into_raw(Box::new(gcd)),
        | Err(_) => std::ptr::null_mut(),
    }
}

/// Computes polynomial derivative over finite field (Handle)
#[unsafe(no_mangle)]
pub extern "C" fn rssn_poly_derivative_gf_handle(
    poly: *const FiniteFieldPolynomial
) -> *mut FiniteFieldPolynomial {
    let poly_ref = unsafe {
        if poly.is_null() {
            return std::ptr::null_mut();
        }

        &*poly
    };

    let derivative = poly_derivative_gf(poly_ref);

    Box::into_raw(Box::new(derivative))
}

/// Frees a vector of polynomials (Handle)
#[unsafe(no_mangle)]
pub extern "C" fn rssn_free_poly_vec_handle(ptr: *mut Vec<FiniteFieldPolynomial>) {
    if !ptr.is_null() {
        unsafe {
            let _ = Box::from_raw(ptr);
        }
    }
}

/// Frees a vector of polynomial-multiplicity pairs (Handle)
#[unsafe(no_mangle)]
pub extern "C" fn rssn_free_poly_mult_vec_handle(ptr: *mut Vec<(FiniteFieldPolynomial, usize)>) {
    if !ptr.is_null() {
        unsafe {
            let _ = Box::from_raw(ptr);
        }
    }
}