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
164
165
166
167
168
169
170
171
172
173

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

use crate::ffi_apis::common::from_json_string;
use crate::ffi_apis::common::to_json_string;
use crate::ffi_apis::symbolic_graph_operations_ffi::handle::convert_expr_graph_to_string_graph;
use crate::symbolic::graph::Graph;
use crate::symbolic::graph_operations::cartesian_product;
use crate::symbolic::graph_operations::complement;
use crate::symbolic::graph_operations::disjoint_union;
use crate::symbolic::graph_operations::induced_subgraph;
use crate::symbolic::graph_operations::intersection;
use crate::symbolic::graph_operations::join;
use crate::symbolic::graph_operations::tensor_product;
use crate::symbolic::graph_operations::union;

/// Creates an induced subgraph.
/// Input JSON:
/// ```json
/// {"graph": <graph>, "nodes": ["label1", "label2"]}
/// ```
#[unsafe(no_mangle)]
pub extern "C" fn rssn_json_graph_induced_subgraph(json: *const c_char) -> *mut c_char {
    #[derive(serde::Deserialize)]
    struct Input {
        graph: Graph<String>,
        nodes: Vec<String>,
    }

    let input: Input = match from_json_string(json) {
        | Some(i) => i,
        | None => return std::ptr::null_mut(),
    };

    let result = induced_subgraph(&input.graph, &input.nodes);

    to_json_string(&result)
}

/// Computes the union of two graphs.
/// Input JSON: {"g1": `<graph>`, "g2": `<graph>`}
#[unsafe(no_mangle)]
pub extern "C" fn rssn_json_graph_union(json: *const c_char) -> *mut c_char {
    #[derive(serde::Deserialize)]
    struct Input {
        g1: Graph<String>,
        g2: Graph<String>,
    }

    let input: Input = match from_json_string(json) {
        | Some(i) => i,
        | None => return std::ptr::null_mut(),
    };

    let result = union(&input.g1, &input.g2);

    to_json_string(&result)
}

/// Computes the intersection of two graphs.
#[unsafe(no_mangle)]
pub extern "C" fn rssn_json_graph_intersection(json: *const c_char) -> *mut c_char {
    #[derive(serde::Deserialize)]
    struct Input {
        g1: Graph<String>,
        g2: Graph<String>,
    }

    let input: Input = match from_json_string(json) {
        | Some(i) => i,
        | None => return std::ptr::null_mut(),
    };

    let result = intersection(&input.g1, &input.g2);

    to_json_string(&result)
}

/// Computes the Cartesian product of two graphs.
#[unsafe(no_mangle)]
pub extern "C" fn rssn_json_graph_cartesian_product(json: *const c_char) -> *mut c_char {
    #[derive(serde::Deserialize)]
    struct Input {
        g1: Graph<String>,
        g2: Graph<String>,
    }

    let input: Input = match from_json_string(json) {
        | Some(i) => i,
        | None => return std::ptr::null_mut(),
    };

    let result_expr = cartesian_product(&input.g1, &input.g2);

    let result = convert_expr_graph_to_string_graph(&result_expr);

    to_json_string(&result)
}

/// Computes the Tensor product of two graphs.
#[unsafe(no_mangle)]
pub extern "C" fn rssn_json_graph_tensor_product(json: *const c_char) -> *mut c_char {
    #[derive(serde::Deserialize)]
    struct Input {
        g1: Graph<String>,
        g2: Graph<String>,
    }

    let input: Input = match from_json_string(json) {
        | Some(i) => i,
        | None => return std::ptr::null_mut(),
    };

    let result_expr = tensor_product(&input.g1, &input.g2);

    let result = convert_expr_graph_to_string_graph(&result_expr);

    to_json_string(&result)
}

/// Computes the complement of a graph.
#[unsafe(no_mangle)]
pub extern "C" fn rssn_json_graph_complement(json: *const c_char) -> *mut c_char {
    let graph: Graph<String> = match from_json_string(json) {
        | Some(g) => g,
        | None => return std::ptr::null_mut(),
    };

    let result = complement(&graph);

    to_json_string(&result)
}

/// Computes the disjoint union of two graphs.
#[unsafe(no_mangle)]
pub extern "C" fn rssn_json_graph_disjoint_union(json: *const c_char) -> *mut c_char {
    #[derive(serde::Deserialize)]
    struct Input {
        g1: Graph<String>,
        g2: Graph<String>,
    }

    let input: Input = match from_json_string(json) {
        | Some(i) => i,
        | None => return std::ptr::null_mut(),
    };

    let result_expr = disjoint_union(&input.g1, &input.g2);

    let result = convert_expr_graph_to_string_graph(&result_expr);

    to_json_string(&result)
}

/// Computes the join of two graphs.
#[unsafe(no_mangle)]
pub extern "C" fn rssn_json_graph_join(json: *const c_char) -> *mut c_char {
    #[derive(serde::Deserialize)]
    struct Input {
        g1: Graph<String>,
        g2: Graph<String>,
    }

    let input: Input = match from_json_string(json) {
        | Some(i) => i,
        | None => return std::ptr::null_mut(),
    };

    let result_expr = join(&input.g1, &input.g2);

    let result = convert_expr_graph_to_string_graph(&result_expr);

    to_json_string(&result)
}