-
Notifications
You must be signed in to change notification settings - Fork 0
/
test_triangles.rs
66 lines (57 loc) · 1.54 KB
/
test_triangles.rs
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
#[macro_use]
extern crate lazy_static;
use rstest::rstest;
use thaler::{
small_fields::F251,
triangles::{TriangleGraph, TriangleMLE},
utils::convert_field,
mles::{
ValueBasedMultilinearExtension,
value_mle::{methods::DynamicEvaluationMethod}
},
};
use thaler::sumcheck::SumCheckPolynomial;
type TestField = F251;
fn convert_vec (m: &[i32]) -> Vec<Vec<TestField>> {
let len = (m.len() as f64).sqrt() as usize;
let mut matrix = Vec::new();
for (i, e) in m.iter().enumerate() {
if i % len == 0 {
let row = Vec::new();
matrix.push(row);
}
let v = TestField::from(*e);
let row = matrix.last_mut().unwrap();
row.push(v);
}
matrix
}
lazy_static! {
static ref M_1: Vec<Vec<TestField>> = convert_vec(&[
0, 1, 1, 0,
1, 0, 1, 1,
1, 1, 0, 1,
0, 1, 1, 0,
]);
}
#[rstest]
#[case(&M_1, TestField::from(2))]
fn naive_count_test(
#[case] m: &[Vec<TestField>],
#[case] expected: TestField,
) {
let matrix = TriangleGraph::new(m.to_vec());
assert_eq!(matrix.count(), expected);
}
#[rstest]
fn var_fixed_evaluate_test() {
let m = convert_vec(&[
0, 1,
1, 0,
]);
let matrix = TriangleGraph::new(m.to_vec());
let triangle: TriangleMLE<TestField, ValueBasedMultilinearExtension<TestField, DynamicEvaluationMethod>> = matrix.derive_mle();
let point = convert_field(&[/*x*/0,/*y*/0,/*z*/1]);
let p = triangle.var_fixed_evaluate(0, point);
println!("poly {:?}", p);
}