mirror of
https://github.com/arnaucube/poulpy.git
synced 2026-02-10 13:16:44 +01:00
Fixed packing & added test for full & sparse packing
This commit is contained in:
@@ -1,5 +1,6 @@
|
||||
use itertools::izip;
|
||||
use math::poly::Poly;
|
||||
use math::ring::impl_u64::ring;
|
||||
use math::ring::Ring;
|
||||
|
||||
#[test]
|
||||
@@ -51,3 +52,86 @@ fn test_automorphism_u64<const NTT: bool>(ring: &Ring<u64>, nth_root: usize) {
|
||||
|
||||
izip!(p0.0, p1.0).for_each(|(a, b)| assert_eq!(a, b));
|
||||
}
|
||||
|
||||
#[test]
|
||||
fn packing_u64() {
|
||||
let n: usize = 1 << 5;
|
||||
let q_base: u64 = 65537u64;
|
||||
let q_power: usize = 1usize;
|
||||
let ring: Ring<u64> = Ring::new(n, q_base, q_power);
|
||||
|
||||
sub_test("test_packing_u64::<NTT:false>", || {
|
||||
test_packing_full_u64::<false>(&ring)
|
||||
});
|
||||
sub_test("test_packing_u64::<NTT:true>", || {
|
||||
test_packing_full_u64::<true>(&ring)
|
||||
});
|
||||
sub_test("test_packing_sparse_u64::<NTT:false>", || {
|
||||
test_packing_sparse_u64::<false>(&ring)
|
||||
});
|
||||
sub_test("test_packing_sparse_u64::<NTT:true>", || {
|
||||
test_packing_sparse_u64::<true>(&ring)
|
||||
});
|
||||
}
|
||||
|
||||
fn test_packing_full_u64<const NTT: bool>(ring: &Ring<u64>) {
|
||||
let n: usize = ring.n();
|
||||
|
||||
let mut result: Vec<Option<Poly<u64>>> = vec![None; n];
|
||||
|
||||
for i in 0..n {
|
||||
let mut poly: Poly<u64> = ring.new_poly();
|
||||
poly.fill(&(1 + i as u64));
|
||||
if NTT {
|
||||
ring.ntt_inplace::<false>(&mut poly);
|
||||
}
|
||||
|
||||
result[i] = Some(poly);
|
||||
}
|
||||
|
||||
ring.pack::<true, NTT>(&mut result, ring.log_n());
|
||||
|
||||
if let Some(poly) = result[0].as_mut() {
|
||||
if NTT {
|
||||
ring.intt_inplace::<false>(poly);
|
||||
}
|
||||
|
||||
poly.0
|
||||
.iter()
|
||||
.enumerate()
|
||||
.for_each(|(i, x)| assert_eq!(*x, 1 + i as u64));
|
||||
}
|
||||
}
|
||||
|
||||
fn test_packing_sparse_u64<const NTT: bool>(ring: &Ring<u64>) {
|
||||
let n: usize = ring.n();
|
||||
|
||||
let mut result: Vec<Option<Poly<u64>>> = vec![None; n];
|
||||
|
||||
let gap: usize = 3;
|
||||
|
||||
for i in (0..n).step_by(gap) {
|
||||
let mut poly: Poly<u64> = ring.new_poly();
|
||||
poly.fill(&(1 + i as u64));
|
||||
if NTT {
|
||||
ring.ntt_inplace::<false>(&mut poly);
|
||||
}
|
||||
result[i] = Some(poly);
|
||||
}
|
||||
|
||||
ring.pack::<true, NTT>(&mut result, ring.log_n());
|
||||
|
||||
if let Some(poly) = result[0].as_mut() {
|
||||
if NTT {
|
||||
ring.intt_inplace::<false>(poly);
|
||||
}
|
||||
|
||||
poly.0.iter().enumerate().for_each(|(i, x)| {
|
||||
if i % gap == 0 {
|
||||
assert_eq!(*x, 1 + i as u64)
|
||||
} else {
|
||||
assert_eq!(*x, 0u64)
|
||||
}
|
||||
});
|
||||
}
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user