chore: upgrade rust toolchain (#346)

actors/evm/src/evm_shared/v10/uints.rs

@@ -210,7 +210,7 @@ impl<'de> Deserialize<'de> for U256 {
         D: serde::Deserializer<'de>,
     {
         struct Visitor;
-        impl<'de> serde::de::Visitor<'de> for Visitor {
+        impl serde::de::Visitor<'_> for Visitor {
             type Value = U256;
 
             fn expecting(&self, formatter: &mut fmt::Formatter) -> fmt::Result {

actors/evm/src/evm_shared/v11/uints.rs

@@ -211,7 +211,7 @@ impl<'de> Deserialize<'de> for U256 {
         D: serde::Deserializer<'de>,
     {
         struct Visitor;
-        impl<'de> serde::de::Visitor<'de> for Visitor {
+        impl serde::de::Visitor<'_> for Visitor {
             type Value = U256;
 
             fn expecting(&self, formatter: &mut fmt::Formatter) -> fmt::Result {

actors/evm/src/evm_shared/v12/uints.rs

@@ -205,7 +205,7 @@ impl<'de> Deserialize<'de> for U256 {
         D: serde::Deserializer<'de>,
     {
         struct Visitor;
-        impl<'de> serde::de::Visitor<'de> for Visitor {
+        impl serde::de::Visitor<'_> for Visitor {
             type Value = U256;
 
             fn expecting(&self, formatter: &mut fmt::Formatter) -> fmt::Result {

actors/evm/src/evm_shared/v13/uints.rs

@@ -202,7 +202,7 @@ impl<'de> Deserialize<'de> for U256 {
         D: serde::Deserializer<'de>,
     {
         struct Visitor;
-        impl<'de> serde::de::Visitor<'de> for Visitor {
+        impl serde::de::Visitor<'_> for Visitor {
             type Value = U256;
 
             fn expecting(&self, formatter: &mut fmt::Formatter) -> fmt::Result {

actors/evm/src/evm_shared/v14/uints.rs

@@ -202,7 +202,7 @@ impl<'de> Deserialize<'de> for U256 {
         D: serde::Deserializer<'de>,
     {
         struct Visitor;
-        impl<'de> serde::de::Visitor<'de> for Visitor {
+        impl serde::de::Visitor<'_> for Visitor {
             type Value = U256;
 
             fn expecting(&self, formatter: &mut fmt::Formatter) -> fmt::Result {

actors/evm/src/evm_shared/v15/uints.rs

@@ -202,7 +202,7 @@ impl<'de> Deserialize<'de> for U256 {
         D: serde::Deserializer<'de>,
     {
         struct Visitor;
-        impl<'de> serde::de::Visitor<'de> for Visitor {
+        impl serde::de::Visitor<'_> for Visitor {
             type Value = U256;
 
             fn expecting(&self, formatter: &mut fmt::Formatter) -> fmt::Result {

actors/market/src/v10/state.rs

@@ -275,7 +275,10 @@ impl State {
         Ok(rval_deal_state)
     }
 
-    pub fn get_proposal_array<'a, BS>(&'a self, store: &'a BS) -> Result<DealArray<BS>, ActorError>
+    pub fn get_proposal_array<'a, BS>(
+        &'a self,
+        store: &'a BS,
+    ) -> Result<DealArray<'a, BS>, ActorError>
     where
         BS: Blockstore,
     {

actors/market/src/v11/state.rs

@@ -273,7 +273,10 @@ impl State {
         Ok(rval_deal_state)
     }
 
-    pub fn get_proposal_array<'a, BS>(&'a self, store: &'a BS) -> Result<DealArray<BS>, ActorError>
+    pub fn get_proposal_array<'a, BS>(
+        &'a self,
+        store: &'a BS,
+    ) -> Result<DealArray<'a, BS>, ActorError>
     where
         BS: Blockstore,
     {

actors/market/src/v12/state.rs

@@ -272,7 +272,10 @@ impl State {
         Ok(rval_deal_state)
     }
 
-    pub fn get_proposal_array<'a, BS>(&'a self, store: &'a BS) -> Result<DealArray<BS>, ActorError>
+    pub fn get_proposal_array<'a, BS>(
+        &'a self,
+        store: &'a BS,
+    ) -> Result<DealArray<'a, BS>, ActorError>
     where
         BS: Blockstore,
     {

fil_actors_shared/src/v10/runtime/policy.rs

@@ -82,7 +82,7 @@ pub struct Policy {
     pub pre_commit_challenge_delay: ChainEpoch,
 
     /// Look-back from the deadline's challenge window opening from which to sample chain randomness for the challenge seed.
-
+    ///
     /// This lookback exists so that deadline windows can be non-overlapping (which make the programming simpler)
     /// but without making the miner wait for chain stability before being able to start on PoSt computation.
     /// The challenge is available this many epochs before the window is actually open to receiving a PoSt.
@@ -314,7 +314,7 @@ pub mod policy_constants {
     pub const PRE_COMMIT_CHALLENGE_DELAY: ChainEpoch = 150;
 
     /// Lookback from the deadline's challenge window opening from which to sample chain randomness for the challenge seed.
-
+    ///
     /// This lookback exists so that deadline windows can be non-overlapping (which make the programming simpler)
     /// but without making the miner wait for chain stability before being able to start on PoSt computation.
     /// The challenge is available this many epochs before the window is actually open to receiving a PoSt.

fil_actors_shared/src/v10/util/set.rs

@@ -12,7 +12,7 @@ use crate::v10::{make_empty_map, make_map_with_root, BytesKey, Map};
 #[derive(Debug)]
 pub struct Set<'a, BS>(Map<'a, BS, ()>);
 
-impl<'a, BS: Blockstore> PartialEq for Set<'a, BS> {
+impl<BS: Blockstore> PartialEq for Set<'_, BS> {
     fn eq(&self, other: &Self) -> bool {
         self.0 == other.0
     }

fil_actors_shared/src/v11/runtime/policy.rs

@@ -82,7 +82,7 @@ pub struct Policy {
     pub pre_commit_challenge_delay: ChainEpoch,
 
     /// Lookback from the deadline's challenge window opening from which to sample chain randomness for the challenge seed.
-
+    ///
     /// This lookback exists so that deadline windows can be non-overlapping (which make the programming simpler)
     /// but without making the miner wait for chain stability before being able to start on PoSt computation.
     /// The challenge is available this many epochs before the window is actually open to receiving a PoSt.
@@ -308,7 +308,7 @@ pub mod policy_constants {
     pub const PRE_COMMIT_CHALLENGE_DELAY: ChainEpoch = 150;
 
     /// Lookback from the deadline's challenge window opening from which to sample chain randomness for the challenge seed.
-
+    ///
     /// This lookback exists so that deadline windows can be non-overlapping (which make the programming simpler)
     /// but without making the miner wait for chain stability before being able to start on PoSt computation.
     /// The challenge is available this many epochs before the window is actually open to receiving a PoSt.

fil_actors_shared/src/v11/util/set.rs

@@ -12,7 +12,7 @@ use crate::v11::{make_empty_map, make_map_with_root, BytesKey, Map};
 #[derive(Debug)]
 pub struct Set<'a, BS>(Map<'a, BS, ()>);
 
-impl<'a, BS: Blockstore> PartialEq for Set<'a, BS> {
+impl<BS: Blockstore> PartialEq for Set<'_, BS> {
     fn eq(&self, other: &Self) -> bool {
         self.0 == other.0
     }

fil_actors_shared/src/v12/util/set.rs

@@ -12,7 +12,7 @@ use crate::v12::{make_empty_map, make_map_with_root, BytesKey, Map};
 #[derive(Debug)]
 pub struct Set<'a, BS>(Map<'a, BS, ()>);
 
-impl<'a, BS: Blockstore> PartialEq for Set<'a, BS> {
+impl<BS: Blockstore> PartialEq for Set<'_, BS> {
     fn eq(&self, other: &Self) -> bool {
         self.0 == other.0
     }

fil_actors_shared/src/v13/util/set.rs

@@ -12,7 +12,7 @@ use crate::v13::{make_empty_map, make_map_with_root, BytesKey, Map};
 #[derive(Debug)]
 pub struct Set<'a, BS>(Map<'a, BS, ()>);
 
-impl<'a, BS: Blockstore> PartialEq for Set<'a, BS> {
+impl<BS: Blockstore> PartialEq for Set<'_, BS> {
     fn eq(&self, other: &Self) -> bool {
         self.0 == other.0
     }

fil_actors_shared/src/v8/util/set.rs

@@ -12,7 +12,7 @@ use crate::v8::{make_empty_map, make_map_with_root, BytesKey, Map};
 #[derive(Debug)]
 pub struct Set<'a, BS>(Map<'a, BS, ()>);
 
-impl<'a, BS: Blockstore> PartialEq for Set<'a, BS> {
+impl<BS: Blockstore> PartialEq for Set<'_, BS> {
     fn eq(&self, other: &Self) -> bool {
         self.0 == other.0
     }

fil_actors_shared/src/v9/runtime/policy.rs

@@ -82,7 +82,7 @@ pub struct Policy {
     pub pre_commit_challenge_delay: ChainEpoch,
 
     /// Look-back from the deadline's challenge window opening from which to sample chain randomness for the challenge seed.
-
+    ///
     /// This lookback exists so that deadline windows can be non-overlapping (which make the programming simpler)
     /// but without making the miner wait for chain stability before being able to start on PoSt computation.
     /// The challenge is available this many epochs before the window is actually open to receiving a PoSt.
@@ -314,7 +314,7 @@ pub mod policy_constants {
     pub const PRE_COMMIT_CHALLENGE_DELAY: ChainEpoch = 150;
 
     /// Lookback from the deadline's challenge window opening from which to sample chain randomness for the challenge seed.
-
+    ///
     /// This lookback exists so that deadline windows can be non-overlapping (which make the programming simpler)
     /// but without making the miner wait for chain stability before being able to start on PoSt computation.
     /// The challenge is available this many epochs before the window is actually open to receiving a PoSt.

fil_actors_shared/src/v9/util/set.rs

@@ -12,7 +12,7 @@ use crate::v9::{make_empty_map, make_map_with_root, BytesKey, Map};
 #[derive(Debug)]
 pub struct Set<'a, BS>(Map<'a, BS, ()>);
 
-impl<'a, BS: Blockstore> PartialEq for Set<'a, BS> {
+impl<BS: Blockstore> PartialEq for Set<'_, BS> {
     fn eq(&self, other: &Self) -> bool {
         self.0 == other.0
     }

rust-toolchain.toml

@@ -1,4 +1,4 @@
 [toolchain]
-channel = "1.82.0"
+channel = "1.83.0"
 components = ["clippy", "llvm-tools-preview", "rustfmt"]
 targets = []