mirror of
https://github.com/hl-archive-node/nanoreth.git
synced 2025-12-06 10:59:55 +00:00
chore(github): use codespell to inspect and correct spelling issues (#7775)
Signed-off-by: jsvisa <delweng@gmail.com> Co-authored-by: Matthias Seitz <matthias.seitz@outlook.de>
This commit is contained in:
@ -136,7 +136,7 @@ where
|
||||
T::Key: std::hash::Hash + Arbitrary,
|
||||
T::Value: Arbitrary,
|
||||
{
|
||||
let strat = proptest::collection::vec(
|
||||
let strategy = proptest::collection::vec(
|
||||
any_with::<TableRow<T>>((
|
||||
<T::Key as Arbitrary>::Parameters::default(),
|
||||
<T::Value as Arbitrary>::Parameters::default(),
|
||||
@ -147,8 +147,8 @@ where
|
||||
.boxed();
|
||||
|
||||
let mut runner = TestRunner::new(ProptestConfig::default());
|
||||
let mut preload = strat.new_tree(&mut runner).unwrap().current();
|
||||
let mut input = strat.new_tree(&mut runner).unwrap().current();
|
||||
let mut preload = strategy.new_tree(&mut runner).unwrap().current();
|
||||
let mut input = strategy.new_tree(&mut runner).unwrap().current();
|
||||
|
||||
let mut unique_keys = HashSet::new();
|
||||
preload.retain(|(k, _)| unique_keys.insert(k.clone()));
|
||||
|
||||
@ -23,7 +23,7 @@ mod sealed {
|
||||
use crate::{database::Database, mock::DatabaseMock, DatabaseEnv};
|
||||
use std::sync::Arc;
|
||||
|
||||
/// Sealed trait to limit the implementors of the Database trait.
|
||||
/// Sealed trait to limit the implementers of the Database trait.
|
||||
pub trait Sealed: Sized {}
|
||||
|
||||
impl<DB: Database> Sealed for &DB {}
|
||||
|
||||
@ -501,7 +501,7 @@ impl<R> Default for Geometry<R> {
|
||||
///
|
||||
/// # Arguments
|
||||
///
|
||||
/// * `process_id` – A proceess id of the reader process.
|
||||
/// * `process_id` – A process id of the reader process.
|
||||
/// * `thread_id` – A thread id of the reader thread.
|
||||
/// * `read_txn_id` – An oldest read transaction number on which stalled.
|
||||
/// * `gap` – A lag from the last committed txn.
|
||||
|
||||
@ -1071,7 +1071,7 @@ mod tests {
|
||||
let num_rows = 2;
|
||||
|
||||
// (missing_offsets, expected number of rows)
|
||||
// If a row wasnt fully pruned, then it should clear it up as well
|
||||
// If a row wasn't fully pruned, then it should clear it up as well
|
||||
let missing_offsets_scenarios = [(1, 1), (2, 1), (3, 0)];
|
||||
|
||||
for (missing_offsets, expected_rows) in missing_offsets_scenarios {
|
||||
|
||||
@ -127,7 +127,7 @@ impl<'b, TX: DbTx> HistoricalStateProviderRef<'b, TX> {
|
||||
tracing::warn!(
|
||||
target: "provider::historical_sp",
|
||||
target = self.block_number,
|
||||
"Attempt to calculate state root for an old block might result in OOM, tread carefully"
|
||||
"Attempt to calculate state root for an old block might result in OOM, treat carefully"
|
||||
);
|
||||
}
|
||||
|
||||
|
||||
@ -15,7 +15,7 @@ pub trait TransactionsProvider: BlockNumReader + Send + Sync {
|
||||
/// Returns None if the transaction is not found.
|
||||
fn transaction_id(&self, tx_hash: TxHash) -> ProviderResult<Option<TxNumber>>;
|
||||
|
||||
/// Get transaction by id, computes hash everytime so more expensive.
|
||||
/// Get transaction by id, computes hash every time so more expensive.
|
||||
fn transaction_by_id(&self, id: TxNumber) -> ProviderResult<Option<TransactionSigned>>;
|
||||
|
||||
/// Get transaction by id without computing the hash.
|
||||
|
||||
Reference in New Issue
Block a user