Struct prio_graph::GraphNode
source · pub struct GraphNode<Id: TransactionId> {
pub edges: HashSet<Id>,
pub chain_id: u64,
/* private fields */
}Expand description
A single node in a priority graph that is associated with a Transaction.
When a node reaches the main queue, the top-level prioritization function can use a reference
to this node to calculate a modified priority for the node, which is only used for
prioritization for the main queue.
Fields§
§edges: HashSet<Id>Unique edges from this node. The number of edges is the same as the number of forks.
chain_id: u64The distinct chain id of this node.
Auto Trait Implementations§
impl<Id> RefUnwindSafe for GraphNode<Id>where
Id: RefUnwindSafe,
impl<Id> Send for GraphNode<Id>where
Id: Send,
impl<Id> Sync for GraphNode<Id>where
Id: Sync,
impl<Id> Unpin for GraphNode<Id>where
Id: Unpin,
impl<Id> UnwindSafe for GraphNode<Id>where
Id: UnwindSafe,
Blanket Implementations§
source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more