jleony/nanoreth
1
0
Fork 0
mirror of https://github.com/hl-archive-node/nanoreth.git synced 2025-12-06 10:59:55 +00:00
Code Issues Packages Projects Releases Wiki Activity

chore(clippy): make clippy happy (#2475)

Browse Source
This commit is contained in:
Matthias Seitz
2023-04-30 11:40:43 +02:00
committed by GitHub
parent a3e627e801
commit d146bb86f6
6 changed files with 10 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
crates/blockchain-tree/src/blockchain_tree.rs
View File

@ -888,7 +888,7 @@ mod tests {
let externals = setup_externals(vec![exec2.clone(), exec1.clone(), exec2, exec1]);
// last finalized block would be number 9.
setup_genesis(externals.db.clone(), genesis.clone());
setup_genesis(externals.db.clone(), genesis);
// make tree
let config = BlockchainTreeConfig::new(1, 2, 3, 2);

1
crates/net/downloaders/src/bodies/task.rs
View File

@ -186,6 +186,7 @@ mod tests {
}
#[tokio::test(flavor = "multi_thread")]
#[allow(clippy::reversed_empty_ranges)]
async fn set_download_range_error_returned() {
reth_tracing::init_test_tracing();

4
crates/net/network/src/peers/manager.rs
View File

@ -369,7 +369,7 @@ impl PeersManager {
/// Gracefully disconnected a pending session
pub(crate) fn on_pending_session_gracefully_closed(&mut self, peer_id: &PeerId) {
if let Some(mut peer) = self.peers.get_mut(peer_id) {
if let Some(peer) = self.peers.get_mut(peer_id) {
peer.state = PeerConnectionState::Idle;
} else {
return
@ -466,7 +466,7 @@ impl PeersManager {
} else {
let mut backoff_until = None;
if let Some(mut peer) = self.peers.get_mut(peer_id) {
if let Some(peer) = self.peers.get_mut(peer_id) {
if let Some(kind) = err.should_backoff() {
// Increment peer.backoff_counter
if kind.is_severe() {

2
crates/rpc/rpc/src/eth/filter.rs
View File

@ -77,7 +77,7 @@ where
let (start_block, kind) = {
let mut filters = self.inner.active_filters.inner.lock().await;
let mut filter = filters.get_mut(&id).ok_or(FilterError::FilterNotFound(id))?;
let filter = filters.get_mut(&id).ok_or(FilterError::FilterNotFound(id))?;
// update filter
// we fetch all changes from [filter.block..best_block], so we advance the filter's

4
crates/stages/src/pipeline/set.rs
View File

@ -163,7 +163,7 @@ where
///
/// Panics if the stage is not in this set.
pub fn enable(mut self, stage_id: StageId) -> Self {
let mut entry =
let entry =
self.stages.get_mut(&stage_id).expect("Cannot enable a stage that is not in the set.");
entry.enabled = true;
self
@ -180,7 +180,7 @@ where
///
/// Panics if the stage is not in this set.
pub fn disable(mut self, stage_id: StageId) -> Self {
let mut entry =
let entry =
self.stages.get_mut(&stage_id).expect("Cannot disable a stage that is not in the set.");
entry.enabled = false;
self

6
crates/trie/benches/prefix_set.rs
View File

@ -101,7 +101,7 @@ fn generate_test_data(size: usize) -> (Vec<Nibbles>, Vec<Nibbles>, Vec<bool>) {
let expected = input
.iter()
.map(|prefix| preload.iter().any(|key| key.has_prefix(&prefix)))
.map(|prefix| preload.iter().any(|key| key.has_prefix(prefix)))
.collect::<Vec<_>>();
(preload, input, expected)
}
@ -204,7 +204,7 @@ mod implementations {
self.sorted = true;
}
let prefix = prefix.into();
let prefix = prefix;
while self.index > 0 && self.keys[self.index] > prefix {
self.index -= 1;
@ -227,7 +227,7 @@ mod implementations {
fn insert(&mut self, nibbles: Nibbles) {
self.sorted = false;
self.keys.push(nibbles.into());
self.keys.push(nibbles);
}
}