mirror of
https://github.com/paradigmxyz/reth.git
synced 2026-01-28 00:28:20 -05:00
typo: fix typo in best tx pool doc (#9988)
This commit is contained in:
@@ -89,12 +89,12 @@ impl<T: TransactionOrdering> PendingPool<T> {
|
||||
|
||||
/// Returns an iterator over all transactions that are _currently_ ready.
|
||||
///
|
||||
/// 1. The iterator _always_ returns transaction in order: It never returns a transaction with
|
||||
/// 1. The iterator _always_ returns transactions in order: it never returns a transaction with
|
||||
/// an unsatisfied dependency and only returns them if dependency transaction were yielded
|
||||
/// previously. In other words: The nonces of transactions with the same sender will _always_
|
||||
/// previously. In other words: the nonces of transactions with the same sender will _always_
|
||||
/// increase by exactly 1.
|
||||
///
|
||||
/// The order of transactions which satisfy (1.) is determent by their computed priority: A
|
||||
/// The order of transactions which satisfy (1.) is determined by their computed priority: a
|
||||
/// transaction with a higher priority is returned before a transaction with a lower priority.
|
||||
///
|
||||
/// If two transactions have the same priority score, then the transactions which spent more
|
||||
|
||||
Reference in New Issue
Block a user