ripple::SHAMap Member List

This is the complete list of members for ripple::SHAMap, including all inherited members.

addGiveItem(SHAMapNodeType type, boost::intrusive_ptr< SHAMapItem const > item)	ripple::SHAMap
addItem(SHAMapNodeType type, boost::intrusive_ptr< SHAMapItem const > item)	ripple::SHAMap
addKnownNode(SHAMapNodeID const &nodeID, Slice const &rawNode, SHAMapSyncFilter *filter)	ripple::SHAMap
addRootNode(SHAMapHash const &hash, Slice const &rootNode, SHAMapSyncFilter *filter)	ripple::SHAMap
backed_	ripple::SHAMap	private
begin() const	ripple::SHAMap
belowHelper(std::shared_ptr< SHAMapTreeNode > node, SharedPtrNodeStack &stack, int branch, std::tuple< int, std::function< bool(int)>, std::function< void(int &)>> const &loopParams) const	ripple::SHAMap	private
branchFactor	ripple::SHAMap	static
cacheLookup(SHAMapHash const &hash) const	ripple::SHAMap	private
canonicalize(SHAMapHash const &hash, std::shared_ptr< SHAMapTreeNode > &) const	ripple::SHAMap	private
checkFilter(SHAMapHash const &hash, SHAMapSyncFilter *filter) const	ripple::SHAMap	private
clearSynching()	ripple::SHAMap
compare(SHAMap const &otherMap, Delta &differences, int maxCount) const	ripple::SHAMap
cowid_	ripple::SHAMap	private
deepCompare(SHAMap &other) const	ripple::SHAMap
delItem(uint256 const &id)	ripple::SHAMap
Delta typedef	ripple::SHAMap
DeltaItem typedef	ripple::SHAMap
DeltaRef typedef	ripple::SHAMap	private
descend(SHAMapInnerNode *, int branch) const	ripple::SHAMap	private
descend(std::shared_ptr< SHAMapInnerNode > const &, int branch) const	ripple::SHAMap	private
descend(SHAMapInnerNode *parent, SHAMapNodeID const &parentID, int branch, SHAMapSyncFilter *filter) const	ripple::SHAMap	private
descendAsync(SHAMapInnerNode *parent, int branch, SHAMapSyncFilter *filter, bool &pending, descendCallback &&) const	ripple::SHAMap	private
descendCallback typedef	ripple::SHAMap	private
descendNoStore(std::shared_ptr< SHAMapInnerNode > const &, int branch) const	ripple::SHAMap	private
descendThrow(SHAMapInnerNode *, int branch) const	ripple::SHAMap	private
descendThrow(std::shared_ptr< SHAMapInnerNode > const &, int branch) const	ripple::SHAMap	private
dirtyUp(SharedPtrNodeStack &stack, uint256 const &target, std::shared_ptr< SHAMapTreeNode > terminal)	ripple::SHAMap	private
dump(bool withHashes=false) const	ripple::SHAMap
end() const	ripple::SHAMap
f_	ripple::SHAMap	private
family() const	ripple::SHAMap
family()	ripple::SHAMap
fetchNode(SHAMapHash const &hash) const	ripple::SHAMap	private
fetchNodeFromDB(SHAMapHash const &hash) const	ripple::SHAMap	private
fetchNodeNT(SHAMapHash const &hash) const	ripple::SHAMap	private
fetchNodeNT(SHAMapHash const &hash, SHAMapSyncFilter *filter) const	ripple::SHAMap	private
fetchRoot(SHAMapHash const &hash, SHAMapSyncFilter *filter)	ripple::SHAMap
findKey(uint256 const &id) const	ripple::SHAMap	private
finishFetch(SHAMapHash const &hash, std::shared_ptr< NodeObject > const &object) const	ripple::SHAMap	private
firstBelow(std::shared_ptr< SHAMapTreeNode >, SharedPtrNodeStack &stack, int branch=0) const	ripple::SHAMap	private
flushDirty(NodeObjectType t)	ripple::SHAMap
full_	ripple::SHAMap	mutableprivate
getHash() const	ripple::SHAMap
getMissingNodes(int maxNodes, SHAMapSyncFilter *filter)	ripple::SHAMap
getNodeFat(SHAMapNodeID const &wanted, std::vector< std::pair< SHAMapNodeID, Blob >> &data, bool fatLeaves, std::uint32_t depth) const	ripple::SHAMap
getProofPath(uint256 const &key) const	ripple::SHAMap
gmn_ProcessDeferredReads(MissingNodes &)	ripple::SHAMap	private
gmn_ProcessNodes(MissingNodes &, MissingNodes::StackEntry &node)	ripple::SHAMap	private
hasInnerNode(SHAMapNodeID const &nodeID, SHAMapHash const &hash) const	ripple::SHAMap	private
hasItem(uint256 const &id) const	ripple::SHAMap
hasLeafNode(uint256 const &tag, SHAMapHash const &hash) const	ripple::SHAMap	private
invariants() const	ripple::SHAMap
isSynching() const	ripple::SHAMap
isValid() const	ripple::SHAMap
journal_	ripple::SHAMap	private
lastBelow(std::shared_ptr< SHAMapTreeNode > node, SharedPtrNodeStack &stack, int branch=branchFactor) const	ripple::SHAMap	private
leafDepth	ripple::SHAMap	static
ledgerSeq_	ripple::SHAMap	private
lower_bound(uint256 const &id) const	ripple::SHAMap
onlyBelow(SHAMapTreeNode *) const	ripple::SHAMap	private
operator=(SHAMap const &)=delete	ripple::SHAMap
peekFirstItem(SharedPtrNodeStack &stack) const	ripple::SHAMap	private
peekItem(uint256 const &id) const	ripple::SHAMap
peekItem(uint256 const &id, SHAMapHash &hash) const	ripple::SHAMap
peekNextItem(uint256 const &id, SharedPtrNodeStack &stack) const	ripple::SHAMap	private
preFlushNode(std::shared_ptr< Node > node) const	ripple::SHAMap	private
root_	ripple::SHAMap	private
serializeRoot(Serializer &s) const	ripple::SHAMap
setFull()	ripple::SHAMap
setImmutable()	ripple::SHAMap
setLedgerSeq(std::uint32_t lseq)	ripple::SHAMap
setSynching()	ripple::SHAMap
setUnbacked()	ripple::SHAMap
SHAMap()=delete	ripple::SHAMap
SHAMap(SHAMap const &)=delete	ripple::SHAMap
SHAMap(SHAMap const &other, bool isMutable)	ripple::SHAMap
SHAMap(SHAMapType t, Family &f)	ripple::SHAMap
SHAMap(SHAMapType t, uint256 const &hash, Family &f)	ripple::SHAMap
SharedPtrNodeStack typedef	ripple::SHAMap	private
snapShot(bool isMutable) const	ripple::SHAMap
state_	ripple::SHAMap	mutableprivate
type_	ripple::SHAMap	private
unshare()	ripple::SHAMap
unshareNode(std::shared_ptr< Node >, SHAMapNodeID const &nodeID)	ripple::SHAMap	private
updateGiveItem(SHAMapNodeType type, boost::intrusive_ptr< SHAMapItem const > item)	ripple::SHAMap
upper_bound(uint256 const &id) const	ripple::SHAMap
verifyProofPath(uint256 const &rootHash, uint256 const &key, std::vector< Blob > const &path)	ripple::SHAMap	static
visitDifferences(SHAMap const *have, std::function< bool(SHAMapTreeNode const &)> const &) const	ripple::SHAMap
visitLeaves(std::function< void(boost::intrusive_ptr< SHAMapItem const > const &)> const &) const	ripple::SHAMap
visitNodes(std::function< bool(SHAMapTreeNode &)> const &function) const	ripple::SHAMap
walkBranch(SHAMapTreeNode *node, boost::intrusive_ptr< SHAMapItem const > const &otherMapItem, bool isFirstMap, Delta &differences, int &maxCount) const	ripple::SHAMap	private
walkMap(std::vector< SHAMapMissingNode > &missingNodes, int maxMissing) const	ripple::SHAMap
walkMapParallel(std::vector< SHAMapMissingNode > &missingNodes, int maxMissing) const	ripple::SHAMap
walkSubTree(bool doWrite, NodeObjectType t)	ripple::SHAMap	private
walkTowardsKey(uint256 const &id, SharedPtrNodeStack *stack=nullptr) const	ripple::SHAMap	private
writeNode(NodeObjectType t, std::shared_ptr< SHAMapTreeNode > node) const	ripple::SHAMap	private
~SHAMap()=default	ripple::SHAMap