fn best_or_awaiting(&mut self, satisfied: usize, tx_ref: TransactionRef<Hash, Ex>) {
		if satisfied == tx_ref.transaction.requires.len() {
			// If we have satisfied all deps insert to best
			self.best.insert(tx_ref);

		} else {
			// otherwise we're still awaiting for some deps
			self.awaiting.insert(tx_ref.transaction.hash.clone(), (satisfied, tx_ref));
		}
	}
/// Depending on number of satisfied requirements insert given ref
/// either to awaiting set or to best set.
Depending on number of satisfied requirements insert given ref
either to awaiting set or to best set.
Depending on number of satisfied requirements insert given ref either to awaiting set or to best set .
fn best_or_awaiting(&mut self, satisfied: usize, tx_ref: TransactionRef<Hash, Ex>) {
		if satisfied == tx_ref.transaction.requires.len() {
			// If we have satisfied all deps insert to best
			self.best.insert(tx_ref);
		} else {
			// otherwise we're still awaiting for some deps
			self.awaiting.insert(tx_ref.transaction.hash.clone(), (satisfied, tx_ref));
		}
	}
fn best_or_awaiting ( & mut self , satisfied : usize , tx_ref : TransactionRef < Hash , Ex > ) { if satisfied == tx_ref . transaction . requires . len ( ) { // If we have satisfied all deps insert to best self . best . insert ( tx_ref ) ; } else { // otherwise we're still awaiting for some deps self . awaiting . insert ( tx_ref . transaction . hash . clone ( ) , ( satisfied , tx_ref ) ) ; } }
Depending on number of satisfied requirements insert given ref
either to awaiting set or to best set.
Depending on number of satisfied requirements insert given ref either to awaiting set or to best set .
&mut self
satisfied
usize
tx_ref
TransactionRef<Hash, Ex>
&mut self
satisfied
usize
tx_ref
TransactionRef<Hash, Ex>