diff --git a/logproof/src/linear_relation.rs b/logproof/src/linear_relation.rs index f5c5dc127..261f376d6 100644 --- a/logproof/src/linear_relation.rs +++ b/logproof/src/linear_relation.rs @@ -1356,8 +1356,7 @@ mod test { // bounds with different bound sums over each column works properly. We // use 16 to promote different b_1 values after taking the log of the // column bound sum. - let s_coeff = vec![ - (0..(k)) + let s_coeff = [(0..(k)) .map(|x| { [1i64, 2, 3, 4, 5, 6, 7, 8] .into_iter() @@ -1366,8 +1365,7 @@ mod test { }) .collect::>>(), vec![vec![-1, 0, 1, 0, -1, 0, -1]; k], - vec![vec![0, -1, 0, 1, -1, 0, 1]; k], - ]; + vec![vec![0, -1, 0, 1, -1, 0, 1]; k]]; let s_poly = s_coeff .iter() diff --git a/sunscreen_backend/src/transforms/insert_relinearizations.rs b/sunscreen_backend/src/transforms/insert_relinearizations.rs index 29fa1d143..6b8f8d206 100644 --- a/sunscreen_backend/src/transforms/insert_relinearizations.rs +++ b/sunscreen_backend/src/transforms/insert_relinearizations.rs @@ -63,10 +63,8 @@ pub fn apply_insert_relinearizations(ir: &mut FheProgram) { #[cfg(test)] mod tests { use super::*; - use petgraph::stable_graph::NodeIndex; - use sunscreen_compiler_common::GraphQuery; use sunscreen_fhe_program::{ - FheProgramTrait, Literal as FheProgramLiteral, Operation, SchemeType, + FheProgramTrait, Literal as FheProgramLiteral, SchemeType, }; fn create_test_dag() -> FheProgram {