An in-memory indexed chain of blocks.
More...
#include <chain.h>
An in-memory indexed chain of blocks.
Definition at line 134 of file chain.h.
◆ Contains()
Efficiently check whether a block is present in this chain.
Definition at line 166 of file chain.h.
◆ FindEarliestAtLeast()
Find the earliest block with timestamp equal or greater than the given time and height equal or greater than the given height.
Definition at line 62 of file chain.cpp.
◆ FindFork()
Find the last common block between this chain and a block index entry.
Definition at line 49 of file chain.cpp.
◆ Genesis()
Returns the index entry for the genesis block of this chain, or nullptr if none.
Definition at line 143 of file chain.h.
◆ GetLocator()
◆ Height()
int CChain::Height |
( |
| ) |
const |
|
inline |
Return the maximal height in the chain.
Is equal to chain.Tip() ? chain.Tip()->nHeight : -1.
Definition at line 186 of file chain.h.
◆ Next()
Find the successor of a block in this chain, or nullptr if the given index is not found or is the tip.
Definition at line 174 of file chain.h.
◆ operator[]()
Returns the index entry at a particular height in this chain, or nullptr if no such height exists.
Definition at line 158 of file chain.h.
◆ SetTip()
Set/initialize a chain with a given tip.
Definition at line 8 of file chain.cpp.
◆ Tip()
Returns the index entry for the tip of this chain, or nullptr if none.
Definition at line 150 of file chain.h.
◆ vChain
The documentation for this class was generated from the following files: