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

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::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 (Bincode)
#[unsafe(no_mangle)]
pub extern "C" fn rssn_bincode_factor_gf(poly_buf: BincodeBuffer) -> BincodeBuffer {
    let poly: Option<FiniteFieldPolynomial> = from_bincode_buffer(&poly_buf);

    if let Some(p) = poly {
        match factor_gf(&p) {
            | Ok(factors) => to_bincode_buffer(&factors),
            | Err(_) => BincodeBuffer::empty(),
        }
    } else {
        BincodeBuffer::empty()
    }
}

/// Computes square-free factorization (Bincode)
#[unsafe(no_mangle)]
pub extern "C" fn rssn_bincode_square_free_factorization_gf(
    poly_buf: BincodeBuffer
) -> BincodeBuffer {
    let poly: Option<FiniteFieldPolynomial> = from_bincode_buffer(&poly_buf);

    if let Some(p) = poly {
        match square_free_factorization_gf(p) {
            | Ok(factors) => to_bincode_buffer(&factors),
            | Err(_) => BincodeBuffer::empty(),
        }
    } else {
        BincodeBuffer::empty()
    }
}

/// Computes polynomial GCD over finite field (Bincode)
#[unsafe(no_mangle)]
pub extern "C" fn rssn_bincode_poly_gcd_gf(
    a_buf: BincodeBuffer,
    b_buf: BincodeBuffer,
) -> BincodeBuffer {
    let a: Option<FiniteFieldPolynomial> = from_bincode_buffer(&a_buf);

    let b: Option<FiniteFieldPolynomial> = from_bincode_buffer(&b_buf);

    if let (Some(poly_a), Some(poly_b)) = (a, b) {
        match poly_gcd_gf(poly_a, poly_b) {
            | Ok(gcd) => to_bincode_buffer(&gcd),
            | Err(_) => BincodeBuffer::empty(),
        }
    } else {
        BincodeBuffer::empty()
    }
}

/// Computes polynomial derivative over finite field (Bincode)
#[unsafe(no_mangle)]
pub extern "C" fn rssn_bincode_poly_derivative_gf(poly_buf: BincodeBuffer) -> BincodeBuffer {
    let poly: Option<FiniteFieldPolynomial> = from_bincode_buffer(&poly_buf);

    if let Some(p) = poly {
        let derivative = poly_derivative_gf(&p);

        to_bincode_buffer(&derivative)
    } else {
        BincodeBuffer::empty()
    }
}