rippled/TreeNodeCache_8h_source.html

#ifndef XRPL_SHAMAP_TREENODECACHE_H_INCLUDED

#define XRPL_SHAMAP_TREENODECACHE_H_INCLUDED


#include <xrpl/basics/IntrusivePointer.h>

#include <xrpl/basics/TaggedCache.h>

#include <xrpl/shamap/SHAMapTreeNode.h>


namespace ripple {


using TreeNodeCache = TaggedCache<

    uint256,

    SHAMapTreeNode,

    /*IsKeyCache*/ false,

    intr_ptr::SharedWeakUnionPtr<SHAMapTreeNode>,

    intr_ptr::SharedPtr<SHAMapTreeNode>>;

}  // namespace ripple


#endif

ripple::SHAMapTreeNode
Definition SHAMapTreeNode.h:32

ripple::SharedIntrusive
A shared intrusive pointer class that supports weak pointers.
Definition IntrusivePointer.h:69

ripple::SharedWeakUnion
A combination of a strong and a weak intrusive pointer stored in the space of a single pointer.
Definition IntrusivePointer.h:303

ripple::TaggedCache
Map/cache combination.
Definition TaggedCache.h:43

ripple
Use hash_* containers for keys that do not need a cryptographically secure hashing algorithm.
Definition algorithm.h:6

ripple::uint256
base_uint< 256 > uint256
Definition base_uint.h:539