chore: format integration tests

compiler/integration-tests/circuits/recursion/src/main.nr

@@ -6,15 +6,9 @@ fn main(
     public_inputs : [Field; 1], 
     key_hash : Field, 
     input_aggregation_object : [Field; 16],
-) -> pub [Field;16]{
+) -> pub [Field; 16] {
     let vk : [Field] = verification_key;
     let p : [Field] = proof;
     let pi : [Field] = public_inputs;
-    std::verify_proof(
-        vk, 
-        p, 
-        pi, 
-        key_hash, 
-        input_aggregation_object
-    )
+    std::verify_proof(vk, p, pi, key_hash, input_aggregation_object)
 }

compiler/wasm/fixtures/simple/noir-script/src/main.nr

@@ -1,3 +1,3 @@
 fn main(x : u64, y : pub u64) {
-  assert(x < y);
+    assert(x < y);
 }

noir_stdlib/src/eddsa.nr

@@ -33,7 +33,6 @@ pub fn eddsa_poseidon_verify(
 ) -> bool {
     // Verifies by testing:
     // S * B8 = R8 + H(R8, A, m) * A8
-
     let bjj = baby_jubjub();
 
     let pub_key = TEPoint::new(pub_key_x, pub_key_y);
@@ -46,13 +45,7 @@ pub fn eddsa_poseidon_verify(
     assert(lt_bytes32(signature_s, bjj.suborder));
 
     // Calculate the h = H(R, A, msg)
-    let hash: Field = poseidon::bn254::hash_5([
-        signature_r8_x,
-        signature_r8_y,
-        pub_key_x,
-        pub_key_y,
-        message,
-    ]);
+    let hash: Field = poseidon::bn254::hash_5([signature_r8_x, signature_r8_y, pub_key_x, pub_key_y, message]);
 
     // Calculate second part of the right side:  right2 = h*8*A
 

tooling/nargo_cli/tests/compile_failure/brillig_assert_fail/src/main.nr

@@ -1,7 +1,7 @@
 // Tests a very simple program.
 // 
 // The features being tested is using assert on brillig
-fn main(x: Field)  {
+fn main(x: Field) {
     assert(1 == conditional(x as bool));
 }
 

tooling/nargo_cli/tests/compile_failure/div_by_zero_constants/src/main.nr

@@ -3,4 +3,4 @@ use dep::std;
 fn main() {
     let a: Field = 3 / 0;
     std::println(a);
-}
+}

tooling/nargo_cli/tests/compile_failure/div_by_zero_modulo/src/main.nr

@@ -1,7 +1,7 @@
 fn main() {
     let a: u32 = 6;
-	let b = 3;
-	let c = 0;
-	let res = (a*b) % c;
-	assert(res != 5);
-}
+    let b = 3;
+    let c = 0;
+    let res = (a * b) % c;
+    assert(res != 5);
+}

tooling/nargo_cli/tests/compile_failure/dup_trait_implementation_4/src/main.nr

@@ -2,5 +2,4 @@ mod module1;
 mod module2;
 mod module3;
 
-fn main() {
-}
+fn main() {}

tooling/nargo_cli/tests/compile_failure/dup_trait_implementation_5/src/main.nr

@@ -3,5 +3,4 @@ mod module2;
 mod module3;
 mod module4;
 
-fn main() {
-}
+fn main() {}

tooling/nargo_cli/tests/compile_failure/duplicate_declaration/src/main.nr

@@ -5,4 +5,4 @@ fn hello(x : Field) -> Field {
 
 fn hello(x : Field) -> Field {
     x
-}
+}

tooling/nargo_cli/tests/compile_failure/dyn_index_fail_nested_array/src/main.nr

@@ -5,4 +5,4 @@ struct Foo {
 
 fn main(mut x : [Foo; 3], y : pub Field) {
     assert(x[y + 2].a == 5);
-}
+}

tooling/nargo_cli/tests/compile_failure/dynamic_index_failure/src/main.nr

@@ -20,4 +20,4 @@ fn main(mut x: [u32; 5], z: Field) {
     //     }
     // }
     // assert(x[idx] != 0);
-}
+}

tooling/nargo_cli/tests/compile_failure/field_modulo/src/main.nr

@@ -1,4 +1,3 @@
-
 fn main(x: Field) -> pub Field {
     x % 2
 }

tooling/nargo_cli/tests/compile_failure/overflowing_assignment/src/main.nr

@@ -1,5 +1,5 @@
 fn main() {
     let x:u8 = -1;
     let y:u8 = 300;
-    assert(x!=y);
+    assert(x != y);
 }

tooling/nargo_cli/tests/compile_failure/slice_insert_failure/src/main.nr

@@ -8,4 +8,4 @@ fn main(x : Field, y : pub Field) {
     }
 
     slice = slice.insert(10, 100);
-}
+}

tooling/nargo_cli/tests/compile_failure/slice_remove_failure/src/main.nr

@@ -8,4 +8,4 @@ fn main(x : Field, y : pub Field) {
     }
 
     let (removed_slice, removed_elem) = slice.remove(10);
-}
+}

tooling/nargo_cli/tests/compile_success_contract/non_entry_point_method/src/main.nr

@@ -3,4 +3,4 @@ contract Foo {
 
     #[contract_library_method]
     fn has_mut(_context : &mut PlaceholderStruct) {}
-}
+}

tooling/nargo_cli/tests/compile_success_empty/attributes_multiple/src/main.nr

@@ -1,8 +1,7 @@
-
 fn main() {
     another_func()
 }
 
 #[aztec(private)]
 #[internal]
-fn another_func() {}
+fn another_func() {}

tooling/nargo_cli/tests/compile_success_empty/auto_deref/src/main.nr

@@ -1,4 +1,3 @@
-
 fn main() {
     let a = &mut &mut &mut [1, 2, 3];
     assert(a[0] == 1);

tooling/nargo_cli/tests/compile_success_empty/brillig_field_binary_operations/src/main.nr

@@ -1,5 +1,5 @@
 // Tests arithmetic operations on fields
-fn main()  {
+fn main() {
     let x = 4;
     let y = 2;
     assert((x + y) == add(x, y));
@@ -22,4 +22,4 @@ unconstrained fn mul(x : Field, y : Field) -> Field {
 
 unconstrained fn div(x : Field, y : Field) -> Field {
     x / y
-}
+}

tooling/nargo_cli/tests/compile_success_empty/brillig_to_bits/src/main.nr

@@ -20,5 +20,4 @@ unconstrained fn main() {
         let le_bit = le_bits_x[3-i];
         assert(be_bit == le_bit);
     }
-
 }

tooling/nargo_cli/tests/compile_success_empty/closure_explicit_types/src/main.nr

@@ -1,4 +1,3 @@
-
 fn ret_normal_lambda1() -> fn() -> Field {
     || 10
 }
@@ -70,10 +69,10 @@ fn main() {
     assert(accepts_closure3(|| y as u64 + z) == 70);
 
     let w = 50;
-    assert(add_results(|| 100, || x ) == 150);
-    assert(add_results(|| x + 100, || w + x ) == 250);
+    assert(add_results(|| 100, || x) == 150);
+    assert(add_results(|| x + 100, || w + x) == 250);
 
-    let arr = [1,2,3,4];
+    let arr = [1, 2, 3, 4];
 
     assert(map(arr, |n| n + 1) == [2, 3, 4, 5]);
     assert(map(arr, |n| n + x) == [51, 52, 53, 54]);

tooling/nargo_cli/tests/compile_success_empty/comptime_sort/src/main.nr

@@ -1,6 +1,5 @@
-
 fn main() {
-    let unsorted: [u8; 3] = [3,1,2];
+    let unsorted: [u8; 3] = [3, 1, 2];
     let sorted = unsorted.sort();
     assert(sorted[0] == 1);
     assert(sorted[1] == 2);

tooling/nargo_cli/tests/compile_success_empty/conditional_regression_547/src/main.nr

@@ -13,10 +13,5 @@ fn main(x: Field) -> pub Field {
 }
 
 fn safe_inverse(n: Field) -> Field {
-    if n == 0 {
-        0
-    }
-    else {
-        1 / n
-    }
+    if n == 0 { 0 } else { 1 / n }
 }