From 28eca4bfdd5f536b22a6ca81d3b42cfa0285b242 Mon Sep 17 00:00:00 2001
From: wborgeaud <williamborgeaud@gmail.com>
Date: Thu, 30 Sep 2021 19:09:27 +0200
Subject: [PATCH] Clippy

---
 src/fri/proof.rs   | 4 ++--
 src/plonk/proof.rs | 6 +++---
 2 files changed, 5 insertions(+), 5 deletions(-)

diff --git a/src/fri/proof.rs b/src/fri/proof.rs
index 4d31c66e..44cef3dc 100644
--- a/src/fri/proof.rs
+++ b/src/fri/proof.rs
@@ -187,7 +187,7 @@ impl<F: RichField + Extendable<D>, const D: usize> FriProof<F, D> {
         };
 
         // Replace the query round proofs with the compressed versions.
-        for (i, (mut index, qrp)) in indices.iter().cloned().zip(&query_round_proofs).enumerate() {
+        for (i, mut index) in indices.iter().copied().enumerate() {
             let initial_proof = FriInitialTreeProof {
                 evals_proofs: (0..num_initial_trees)
                     .map(|j| {
@@ -285,7 +285,7 @@ impl<F: RichField + Extendable<D>, const D: usize> CompressedFriProof<F, D> {
             &initial_trees_indices,
             initial_trees_proofs
         )
-        .map(|(ls, is, ps)| decompress_merkle_proofs(&ls, is, &ps, height, cap_height))
+        .map(|(ls, is, ps)| decompress_merkle_proofs(ls, is, &ps, height, cap_height))
         .collect::<Vec<_>>();
         let steps_proofs = izip!(&steps_evals, &steps_indices, steps_proofs, heights)
             .map(|(ls, is, ps, h)| decompress_merkle_proofs(ls, is, &ps, h, cap_height))
diff --git a/src/plonk/proof.rs b/src/plonk/proof.rs
index ee38938b..c7d0b0ff 100644
--- a/src/plonk/proof.rs
+++ b/src/plonk/proof.rs
@@ -69,7 +69,7 @@ pub struct ProofWithPublicInputs<F: RichField + Extendable<D>, const D: usize> {
 
 impl<F: RichField + Extendable<D>, const D: usize> ProofWithPublicInputs<F, D> {
     pub fn compress(
-        mut self,
+        self,
         common_data: &CommonCircuitData<F, D>,
     ) -> anyhow::Result<CompressedProofWithPublicInputs<F, D>> {
         let indices = self.fri_query_indices(common_data)?;
@@ -134,7 +134,7 @@ pub struct CompressedProofWithPublicInputs<F: RichField + Extendable<D>, const D
 
 impl<F: RichField + Extendable<D>, const D: usize> CompressedProofWithPublicInputs<F, D> {
     pub fn decompress(
-        mut self,
+        self,
         common_data: &CommonCircuitData<F, D>,
     ) -> anyhow::Result<ProofWithPublicInputs<F, D>> {
         let indices = self.fri_query_indices(common_data)?;
@@ -271,7 +271,7 @@ mod tests {
 
         // Verify that `decompress ∘ compress = identity`.
         let compressed_proof = proof.clone().compress(&data.common)?;
-        let decompressed_compressed_proof = compressed_proof.clone().decompress(&data.common)?;
+        let decompressed_compressed_proof = compressed_proof.decompress(&data.common)?;
         assert_eq!(proof, decompressed_compressed_proof);
 
         verify(proof, &data.verifier_only, &data.common)