Merge pull request #26 from ProvableHQ/fmt/v1.0.0

[Format] Incorporate latest nightly changes.

Author: d0cd

.rustfmt.toml

@@ -13,4 +13,4 @@ imports_layout = "HorizontalVertical"
 imports_granularity = "Crate"
 overflow_delimited_expr = true
 reorder_impl_items = true
-version = "Two"
+style_edition = "2024"

algorithms/benches/crypto_hash/poseidon.rs

@@ -16,7 +16,7 @@
 #[macro_use]
 extern crate criterion;
 
-use snarkvm_algorithms::{crypto_hash::PoseidonSponge, AlgebraicSponge};
+use snarkvm_algorithms::{AlgebraicSponge, crypto_hash::PoseidonSponge};
 use snarkvm_curves::bls12_377::{Fq, FqParameters};
 use snarkvm_fields::Fp384;
 use snarkvm_utilities::{TestRng, Uniform};

algorithms/benches/fft/fft.rs

@@ -20,7 +20,7 @@ use snarkvm_curves::bls12_377::Fr as Bls12_377_Fr;
 use snarkvm_fields::PrimeField;
 use snarkvm_utilities::TestRng;
 
-use criterion::{criterion_group, criterion_main, Bencher, BenchmarkId, Criterion};
+use criterion::{Bencher, BenchmarkId, Criterion, criterion_group, criterion_main};
 use std::cmp::min;
 
 /// Degree bounds to benchmark on

algorithms/benches/snark/varuna.rs

@@ -17,10 +17,10 @@
 extern crate criterion;
 
 use snarkvm_algorithms::{
-    crypto_hash::PoseidonSponge,
-    snark::varuna::{ahp::AHPForR1CS, CircuitVerifyingKey, TestCircuit, VarunaHidingMode, VarunaSNARK},
     AlgebraicSponge,
     SNARK,
+    crypto_hash::PoseidonSponge,
+    snark::varuna::{CircuitVerifyingKey, TestCircuit, VarunaHidingMode, VarunaSNARK, ahp::AHPForR1CS},
 };
 use snarkvm_curves::bls12_377::{Bls12_377, Fq, Fr};
 use snarkvm_utilities::{CanonicalDeserialize, CanonicalSerialize, TestRng};

algorithms/src/crypto_hash/poseidon.rs

@@ -13,7 +13,7 @@
 // See the License for the specific language governing permissions and
 // limitations under the License.
 
-use crate::{nonnative_params::*, AlgebraicSponge, DuplexSpongeMode};
+use crate::{AlgebraicSponge, DuplexSpongeMode, nonnative_params::*};
 use snarkvm_fields::{FieldParameters, PoseidonParameters, PrimeField, ToConstraintField};
 use snarkvm_utilities::{BigInteger, FromBits, ToBits};
 

algorithms/src/crypto_hash/tests.rs

@@ -13,7 +13,7 @@
 // See the License for the specific language governing permissions and
 // limitations under the License.
 
-use crate::{crypto_hash::PoseidonSponge, AlgebraicSponge, DuplexSpongeMode};
+use crate::{AlgebraicSponge, DuplexSpongeMode, crypto_hash::PoseidonSponge};
 use snarkvm_curves::bls12_377::Fr;
 use snarkvm_fields::{PoseidonDefaultField, PoseidonGrainLFSR};
 

algorithms/src/fft/domain.rs

@@ -32,15 +32,15 @@ use crate::{
     cfg_iter_mut,
     fft::{DomainCoeff, SparsePolynomial},
 };
-use snarkvm_fields::{batch_inversion, FftField, FftParameters, Field};
+use snarkvm_fields::{FftField, FftParameters, Field, batch_inversion};
 #[cfg(not(feature = "serial"))]
 use snarkvm_utilities::max_available_threads;
 use snarkvm_utilities::{execute_with_max_available_threads, serialize::*};
 
 use rand::Rng;
 use std::{borrow::Cow, fmt};
 
-use anyhow::{ensure, Result};
+use anyhow::{Result, ensure};
 
 #[cfg(not(feature = "serial"))]
 use rayon::prelude::*;

algorithms/src/fft/polynomial/mod.rs

@@ -16,11 +16,11 @@
 //! Work with sparse and dense polynomials.
 
 use crate::fft::{EvaluationDomain, Evaluations};
-use snarkvm_fields::{Field, PrimeField};
-use snarkvm_utilities::{cfg_iter_mut, serialize::*, SerializationError};
 use Polynomial::*;
+use snarkvm_fields::{Field, PrimeField};
+use snarkvm_utilities::{SerializationError, cfg_iter_mut, serialize::*};
 
-use anyhow::{ensure, Result};
+use anyhow::{Result, ensure};
 use std::{borrow::Cow, convert::TryInto};
 
 #[cfg(not(feature = "serial"))]

algorithms/src/fft/polynomial/multiplier.rs

@@ -19,7 +19,7 @@ use crate::fft::domain::{FFTPrecomputation, IFFTPrecomputation};
 
 /// A struct that helps multiply a batch of polynomials
 use super::*;
-use snarkvm_utilities::{cfg_into_iter, cfg_iter, cfg_iter_mut, cfg_reduce_with, ExecutionPool};
+use snarkvm_utilities::{ExecutionPool, cfg_into_iter, cfg_iter, cfg_iter_mut, cfg_reduce_with};
 
 #[derive(Default)]
 pub struct PolyMultiplier<'a, F: PrimeField> {

algorithms/src/fft/tests.rs

@@ -13,7 +13,7 @@
 // See the License for the specific language governing permissions and
 // limitations under the License.
 
-use crate::fft::{domain::*, DensePolynomial};
+use crate::fft::{DensePolynomial, domain::*};
 use rand::Rng;
 use snarkvm_curves::bls12_377::{Fr, G1Projective};
 use snarkvm_fields::{FftField, Field, One, Zero};