Algorithms and data structures for ordering (linearizing) clusters of dependent transactions.
Types
Name |
Description |
Data structure that holds a transaction graph's preprocessed data (fee, size, ancestors, descendants). |
|
A default cost model for SFL for SetType=BitSet<64>, based on benchmarks. |
|
A set of transactions together with their aggregate feerate. |
|
Class to represent the internal state of the spanning‐forest linearization (SFL) algorithm. |
Type Aliases
Name |
Description |
Data type to represent transaction indices in DepGraphs and the clusters they represent. |
|
Simple default transaction ordering function for SpanningForestState::GetLinearization() and Linearize(), which just sorts by DepGraphIndex. |
Functions
Name |
Description |
Compute the feerates of the chunks of linearization. Identical to ChunkLinearizationInfo, but only returns the chunk feerates, not the corresponding transaction sets. |
|
Compute the chunks of linearization as SetInfos. |
|
Find or improve a linearization for a cluster. |
|
Improve a given linearization. |
|
Swap two SetInfo objects. |
|
Equality operators |
Concepts
Name |
Description |
Concept for function objects that return std::strong_ordering when invoked with two Args. |
Created with MrDocs