fix: update rust-toolchain

fix: all required clippy updates

Author: cryptonemo

fr32/src/padding.rs

@@ -539,7 +539,7 @@ fn clear_right_bits(byte: &mut u8, offset: usize) {
     *(byte) &= !((1 << offset) - 1)
 }
 
-/** Padding process.
+/* Padding process.
 
 Read a `source` of raw byte-aligned data, pad it in a bit stream and
 write a byte-aligned version of it in the `target`. The `target` needs

rust-toolchain

@@ -1 +1 @@
-1.81.0
+1.83.0

storage-proofs-core/benches/blake2s.rs

@@ -16,7 +16,7 @@ struct Blake2sExample<'a> {
     data: &'a [Option<bool>],
 }
 
-impl<'a> Circuit<Fr> for Blake2sExample<'a> {
+impl Circuit<Fr> for Blake2sExample<'_> {
     fn synthesize<CS: ConstraintSystem<Fr>>(self, cs: &mut CS) -> Result<(), SynthesisError> {
         let data: Vec<Boolean> = self
             .data

storage-proofs-core/benches/sha256.rs

@@ -16,7 +16,7 @@ struct Sha256Example<'a> {
     data: &'a [Option<bool>],
 }
 
-impl<'a> Circuit<Fr> for Sha256Example<'a> {
+impl Circuit<Fr> for Sha256Example<'_> {
     fn synthesize<CS: ConstraintSystem<Fr>>(self, cs: &mut CS) -> Result<(), SynthesisError> {
         let data: Vec<Boolean> = self
             .data

storage-proofs-core/benches/xor.rs

@@ -14,7 +14,7 @@ struct XorExample<'a> {
     data: &'a [Option<bool>],
 }
 
-impl<'a> Circuit<Fr> for XorExample<'a> {
+impl Circuit<Fr> for XorExample<'_> {
     fn synthesize<CS: ConstraintSystem<Fr>>(self, cs: &mut CS) -> Result<(), SynthesisError> {
         let key: Vec<Boolean> = self
             .key

storage-proofs-core/src/data.rs

@@ -21,7 +21,7 @@ enum RawData<'a> {
     Mmap(MmapMut),
 }
 
-impl<'a> Deref for RawData<'a> {
+impl Deref for RawData<'_> {
     type Target = [u8];
 
     fn deref(&self) -> &Self::Target {
@@ -32,7 +32,7 @@ impl<'a> Deref for RawData<'a> {
     }
 }
 
-impl<'a> DerefMut for RawData<'a> {
+impl DerefMut for RawData<'_> {
     fn deref_mut(&mut self) -> &mut Self::Target {
         match self {
             RawData::Slice(ref mut raw) => raw,
@@ -52,7 +52,7 @@ impl<'a> From<&'a mut [u8]> for Data<'a> {
     }
 }
 
-impl<'a> From<(MmapMut, PathBuf)> for Data<'a> {
+impl From<(MmapMut, PathBuf)> for Data<'_> {
     fn from(raw: (MmapMut, PathBuf)) -> Self {
         let len = raw.0.len();
         Data {
@@ -63,7 +63,7 @@ impl<'a> From<(MmapMut, PathBuf)> for Data<'a> {
     }
 }
 
-impl<'a> AsRef<[u8]> for Data<'a> {
+impl AsRef<[u8]> for Data<'_> {
     fn as_ref(&self) -> &[u8] {
         match self.raw {
             Some(ref raw) => raw,
@@ -72,7 +72,7 @@ impl<'a> AsRef<[u8]> for Data<'a> {
     }
 }
 
-impl<'a> AsMut<[u8]> for Data<'a> {
+impl AsMut<[u8]> for Data<'_> {
     fn as_mut(&mut self) -> &mut [u8] {
         match self.raw {
             Some(ref mut raw) => raw,

storage-proofs-porep/src/stacked/vanilla/params.rs

@@ -119,7 +119,7 @@ where
     }
 }
 
-impl<'a, Tree> From<&'a PublicParams<Tree>> for PublicParams<Tree>
+impl<Tree> From<&PublicParams<Tree>> for PublicParams<Tree>
 where
     Tree: MerkleTreeTrait,
 {

storage-proofs-porep/src/stacked/vanilla/proof_scheme.rs

@@ -13,8 +13,8 @@ use crate::stacked::vanilla::{
     proof::StackedDrg,
 };
 
-impl<'a, 'c, Tree: 'static + MerkleTreeTrait, G: 'static + Hasher> ProofScheme<'a>
-    for StackedDrg<'c, Tree, G>
+impl<Tree: 'static + MerkleTreeTrait, G: 'static + Hasher> ProofScheme<'_>
+    for StackedDrg<'_, Tree, G>
 {
     type PublicParams = PublicParams<Tree>;
     type SetupParams = SetupParams;

storage-proofs-porep/src/stacked/vanilla/utils.rs

@@ -15,7 +15,7 @@ pub struct UnsafeSlice<'a, T> {
     len: usize,
 }
 
-unsafe impl<'a, T> Sync for UnsafeSlice<'a, T> {}
+unsafe impl<T> Sync for UnsafeSlice<'_, T> {}
 
 impl<'a, T> UnsafeSlice<'a, T> {
     /// Takes mutable slice, to ensure that `UnsafeSlice` is the only user of this memory, until it gets dropped.

storage-proofs-update/src/compound.rs

@@ -31,7 +31,7 @@ where
     }
 }
 
-impl<'a, TreeR> CompoundProof<'a, EmptySectorUpdate<TreeR>, EmptySectorUpdateCircuit<TreeR>>
+impl<TreeR> CompoundProof<'_, EmptySectorUpdate<TreeR>, EmptySectorUpdateCircuit<TreeR>>
     for EmptySectorUpdateCompound<TreeR>
 where
     TreeR: 'static + MerkleTreeTrait<Hasher = TreeRHasher>,

storage-proofs-update/src/poseidon/compound.rs

@@ -36,7 +36,7 @@ where
     }
 }
 
-impl<'a, TreeR> CompoundProof<'a, EmptySectorUpdate<TreeR>, EmptySectorUpdateCircuit<TreeR>>
+impl<TreeR> CompoundProof<'_, EmptySectorUpdate<TreeR>, EmptySectorUpdateCircuit<TreeR>>
     for EmptySectorUpdateCompound<TreeR>
 where
     TreeR: 'static + MerkleTreeTrait<Hasher = TreeRHasher>,

storage-proofs-update/src/poseidon/vanilla.rs

@@ -97,7 +97,7 @@ where
     _tree_r: PhantomData<TreeR>,
 }
 
-impl<'a, TreeR> ProofScheme<'a> for EmptySectorUpdate<TreeR>
+impl<TreeR> ProofScheme<'_> for EmptySectorUpdate<TreeR>
 where
     TreeR: 'static + MerkleTreeTrait<Hasher = TreeRHasher>,
 {

storage-proofs-update/src/vanilla.rs

@@ -392,7 +392,7 @@ where
     _tree_r: PhantomData<TreeR>,
 }
 
-impl<'a, TreeR> ProofScheme<'a> for EmptySectorUpdate<TreeR>
+impl<TreeR> ProofScheme<'_> for EmptySectorUpdate<TreeR>
 where
     TreeR: 'static + MerkleTreeTrait<Hasher = TreeRHasher>,
 {