rippled/TreeNodeCache_8h_source.html

#pragma once


#include <xrpl/basics/IntrusivePointer.h>

#include <xrpl/basics/TaggedCache.h>

#include <xrpl/shamap/SHAMapTreeNode.h>


namespace xrpl {


using TreeNodeCache = TaggedCache<

    uint256,

    SHAMapTreeNode,

    /*IsKeyCache*/ false,

    intr_ptr::SharedWeakUnionPtr<SHAMapTreeNode>,

    SHAMapTreeNodePtr>;

}  // namespace xrpl

xrpl::SHAMapTreeNode
Definition SHAMapTreeNode.h:38

xrpl::TaggedCache
Map/cache combination.
Definition TaggedCache.h:59

xrpl::intr_ptr::SharedWeakUnionPtr
SharedWeakUnion< T > SharedWeakUnionPtr
Definition IntrusivePointer.h:468

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

xrpl::SHAMapTreeNodePtr
intr_ptr::SharedPtr< SHAMapTreeNode > SHAMapTreeNodePtr
Definition SHAMapTreeNode.h:17

xrpl::TreeNodeCache
TaggedCache< uint256, SHAMapTreeNode, false, intr_ptr::SharedWeakUnionPtr< SHAMapTreeNode >, SHAMapTreeNodePtr > TreeNodeCache
Definition TreeNodeCache.h:9

xrpl::uint256
BaseUInt< 256 > uint256
Definition base_uint.h:562