Search Toolkit Book for CConcurrentMap
#include "concurrent_map.hpp"
(Private to src/app/netcache.)
Definition at line 77 of file concurrent_map.hpp.
◆ TComparatortemplate<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 105 of file concurrent_map.hpp.
◆ TDeferredDeletertemplate<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
typedef CNCDeferredDeleter<SNode*, CFinalNodeDeleter, kDeletionDelay, kDelStoreCapacity> CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::TDeferredDeleter privateDefinition at line 287 of file concurrent_map.hpp.
◆ TKeytemplate<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 103 of file concurrent_map.hpp.
◆ TKeyAlloctemplate<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 106 of file concurrent_map.hpp.
◆ TLeafAlloctemplate<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 109 of file concurrent_map.hpp.
◆ TMaptemplate<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 114 of file concurrent_map.hpp.
◆ TNodeAlloctemplate<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 108 of file concurrent_map.hpp.
◆ TNodeIndextemplate<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 102 of file concurrent_map.hpp.
◆ TRefedKeyAlloctemplate<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 107 of file concurrent_map.hpp.
◆ TTreetemplate<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
typedef CConcurrentMap<TKey, TValue, TComparator, TKeyAlloc, kCntChildsInNode, kMaxTreeHeight, kDeletionDelay, kDelStoreCapacity> CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::TTreeDefinition at line 113 of file concurrent_map.hpp.
◆ TTreeHeighttemplate<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 101 of file concurrent_map.hpp.
◆ TValuetemplate<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 104 of file concurrent_map.hpp.
◆ anonymous enumtemplate<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Enumerator kCntChildsInNode kMaxTreeHeight kDeletionDelay kDelStoreCapacity kLeafTreeLevelDefinition at line 89 of file concurrent_map.hpp.
◆ EGetValueTypetemplate<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
◆ EValueStatustemplate<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Enumerator eValueDeleted eValuePassiveMust be 0.
eValueActiveDefinition at line 82 of file concurrent_map.hpp.
◆ CConcurrentMap() [1/2]template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
◆ ~CConcurrentMap()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 127 of file concurrent_map.hpp.
◆ CConcurrentMap() [2/2]template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::CConcurrentMap ( const CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity > & ) private ◆ ActivateKey()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 186 of file concurrent_map.hpp.
References CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::eValueActive, ncbi::grid::netcache::search::fields::key, and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_SetValueStatus().
◆ Clear()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
void CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::Clear ( void ) inlineCaller is responsible to not make this call concurrent with any other method call (the same as calling ctor and dtor).
Definition at line 218 of file concurrent_map.hpp.
References CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_Finalize(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_Initialize().
◆ Erase()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 156 of file concurrent_map.hpp.
References CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::eValueActive, ncbi::grid::netcache::search::fields::key, and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_EraseIf().
◆ EraseIfPassive()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 190 of file concurrent_map.hpp.
References CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::eValuePassive, ncbi::grid::netcache::search::fields::key, and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_EraseIf().
◆ Get()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 135 of file concurrent_map.hpp.
References eReadLock, ncbi::grid::netcache::search::fields::key, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::kLeafTreeLevel, result, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::tree_path, rapidjson::value, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DiveAndFindKey(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_FinalizeCallContext(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_InitializeCallContext(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_Value().
◆ GetCntLeafNodes()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Uint4 CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::GetCntLeafNodes ( void ) const inline ◆ GetCntNodes()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Uint4 CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::GetCntNodes ( void ) const inline ◆ GetCntValues()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Uint4 CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::GetCntValues ( void ) const inline ◆ GetTreeHeight()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
◆ HeartBeat()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
void CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::HeartBeat ( void ) inline ◆ operator=()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
CConcurrentMap& CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::operator= ( const CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity > & ) private ◆ PassivateKey()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 182 of file concurrent_map.hpp.
References CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::eValuePassive, ncbi::grid::netcache::search::fields::key, and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_SetValueStatus().
◆ Put()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 146 of file concurrent_map.hpp.
References ncbi::grid::netcache::search::fields::key, rapidjson::value, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DiveAndCreateValue(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_FinalizeCallContext(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_InitializeCallContext().
◆ PutOrGet()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
bool CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::PutOrGet ( const TKey & key, const TValue & value, EGetValueType get_type, TValue & ret_value ) inlineDefinition at line 160 of file concurrent_map.hpp.
References CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::eGetOnlyActive, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::eValueActive, ncbi::grid::netcache::search::fields::key, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::kLeafTreeLevel, result, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::status, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::tree_path, rapidjson::value, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DiveAndCreateValue(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_FinalizeCallContext(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_InitializeCallContext(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_Value().
◆ x_AddKeyRef()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 291 of file concurrent_map.hpp.
References CAtomicCounter::Add(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SRefedKey::ref_cnt.
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_AddNewRoot(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_AssignKeyRef(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_CreateNode(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DeleteEmptyNodes().
◆ x_AddNewRoot()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 961 of file concurrent_map.hpp.
References _ASSERT, abort(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNode::childs, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::cnt_filled, DIAG_COMPILE_INFO, CNcbiDiag::DiagTrouble(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::eValueActive, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::keys, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::kMaxTreeHeight, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::left_key, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::left_node, NULL, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::right_key, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::right_node, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::split_level, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::status, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::tree_height, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::tree_path, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_AddKeyRef(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_ChangeRoot(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_CreateNode().
◆ x_AddNodeKey()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
TNodeIndex CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_AddNodeKey ( SCallContext & call_ctx, SNode * node, SRefedKey * key_ref, SNode * value_node ) inlineprivateDefinition at line 842 of file concurrent_map.hpp.
References CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNode::childs, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::cnt_filled, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::eValueActive, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::eValueDeleted, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::kCntChildsInNode, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SRefedKey::key, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::keys, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::locked_node, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::status, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_AssignKeyRef(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_FindInsertSpace(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_FindKeyIndex(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_GetNextIndex(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_SplitNode().
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_AddRegularSplit(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_CreatePathToLeaf().
◆ x_AddRegularSplit()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 922 of file concurrent_map.hpp.
References _ASSERT, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNode::childs, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::cur_level, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::keys, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::left_key, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::left_node, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::locked_node, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::right_key, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::right_node, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::split_level, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_AddNodeKey(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_LockNodeAndWaitKey(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_UnlockCurNode().
◆ x_AssignKeyRef() [1/2]template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 307 of file concurrent_map.hpp.
References CAtomicCounter::Add(), ncbi::grid::netcache::search::fields::key, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SRefedKey::key, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::m_RefedKeyAlloc, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SRefedKey::ref_cnt, and CAtomicCounter::Set().
◆ x_AssignKeyRef() [2/2]template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 301 of file concurrent_map.hpp.
References CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_AddKeyRef(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DerefKey().
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_AddNodeKey(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_InsertLeafValue().
◆ x_CanShrinkTree()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
bool CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_CanShrinkTree ( void ) const inlineprivateDefinition at line 583 of file concurrent_map.hpp.
References CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::cnt_filled, CAtomicCounter::Get(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::m_CntRootRefs, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::m_RootNode, and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::m_TreeHeight.
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DeleteEmptyNodes(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_ShrinkTree().
◆ x_ChangeRoot()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 575 of file concurrent_map.hpp.
References _ASSERT, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::m_RootLock, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::m_RootNode, and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::m_TreeHeight.
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_AddNewRoot().
◆ x_CheckRootSplit()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 940 of file concurrent_map.hpp.
References _ASSERT, _VERIFY, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::cur_level, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::left_node, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::tree_height, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::tree_path, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_AddNewRoot(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DiveToNextLevel(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_GetRootAndHeight().
◆ x_CreateNode()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 453 of file concurrent_map.hpp.
References CAtomicCounter::Add(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::cnt_filled, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::eValueDeleted, i, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::kCntChildsInNode, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::keys, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::kLeafTreeLevel, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::m_CntLeafNodes, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::m_CntNodes, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::m_LeafAlloc, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::m_NodeAlloc, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::max_key, NULL, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::right_node, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::status, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::tree_level, and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_AddKeyRef().
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_AddNewRoot(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_CreatePathToLeaf(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_Initialize(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_SplitNode().
◆ x_CreatePathToLeaf()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 790 of file concurrent_map.hpp.
References CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNode::childs, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::cnt_filled, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::cur_level, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::eValueActive, eWriteLock, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::kCntChildsInNode, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::kLeafTreeLevel, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::lookup_key, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::max_key, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::status, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::tree_level, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::tree_path, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_AddNodeKey(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_CreateNode(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_ExchangeNodeLocks(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_FindContainingIndex(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_IsNodeToBeDeleted(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_LockCurNode(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_MoveOneLevelDown(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_MoveOneLevelUp(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_UnlockCurNode().
◆ x_DeleteEmptyNodes()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 984 of file concurrent_map.hpp.
References CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::cnt_filled, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::cur_level, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::eValueDeleted, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::kLeafTreeLevel, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::locked_node, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::max_key, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::status, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::tree_level, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::tree_path, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_AddKeyRef(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_CanShrinkTree(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DeleteNode(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DerefKey(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_IsNodeToBeDeleted(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_LockNodeAndWaitKey(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_ShrinkTree(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_UnlockCurNode().
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DeleteKey().
◆ x_DeleteKey()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Delete key from the tree.
No real deletion will be done unless the node becomes empty. Node is deleted then cleaning all its keys and values. Only value status is changed otherwise
Definition at line 723 of file concurrent_map.hpp.
References CAtomicCounter::Add(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::cnt_filled, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::eValueDeleted, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::kLeafTreeLevel, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::m_CntValues, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::status, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::tree_path, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DeleteEmptyNodes(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_IsNodeToBeDeleted().
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_EraseIf().
◆ x_DeleteNode()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
void CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DeleteNode ( SNode * node ) inlineprivateDefinition at line 474 of file concurrent_map.hpp.
References CAtomicCounter::Add(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::kLeafTreeLevel, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::m_CntLeafNodes, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::m_CntNodes, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::m_NodesDeleter, and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::tree_level.
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DeleteEmptyNodes(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_ShrinkTree().
◆ x_DerefKey()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 296 of file concurrent_map.hpp.
References CAtomicCounter::Add(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::m_RefedKeyAlloc, and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SRefedKey::ref_cnt.
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_AssignKeyRef(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DeleteEmptyNodes(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_FinalDeleteNode().
◆ x_DiveAndCreateValue()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
bool CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DiveAndCreateValue ( SCallContext & call_ctx, const TValue & value, TNodeIndex & key_index, TValue *& value_ptr ) inlineprivateDefinition at line 690 of file concurrent_map.hpp.
References eWriteLock, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::kLeafTreeLevel, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::lookup_key, result, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::tree_path, rapidjson::value, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_CreatePathToLeaf(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DiveToLeafLevel(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_FindKeyIndex(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_InsertLeafValue(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_IsKeyFound(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_LockLeafNode(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_PropagateSplit(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_Value().
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::Put(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::PutOrGet().
◆ x_DiveAndFindKey()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 674 of file concurrent_map.hpp.
References CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::kLeafTreeLevel, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::lookup_key, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::tree_path, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DiveToLeafLevel(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_FindKeyIndex(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_IsKeyFound(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_LockLeafNode().
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::Get(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_EraseIf(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_SetValueStatus().
◆ x_DiveToLeafLevel()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 732 of file concurrent_map.hpp.
References CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::cur_level, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::kLeafTreeLevel, and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DiveToNextLevel().
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DiveAndCreateValue(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DiveAndFindKey().
◆ x_DiveToNextLevel()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 740 of file concurrent_map.hpp.
References CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::cnt_filled, eReadLock, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::kCntChildsInNode, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::lookup_key, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_FindContainingIndex(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_IsNodeToBeDeleted(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_LockCurNode(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_MoveOneLevelDown(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_MoveOneLevelUp(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_UnlockCurNode().
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_CheckRootSplit(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DiveToLeafLevel().
◆ x_EraseIf()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 550 of file concurrent_map.hpp.
References eWriteLock, ncbi::grid::netcache::search::fields::key, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::kLeafTreeLevel, result, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::status, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::tree_path, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DeleteKey(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DiveAndFindKey(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_FinalizeCallContext(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_InitializeCallContext().
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::Erase(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::EraseIfPassive().
◆ x_ExchangeNodeLocks()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 641 of file concurrent_map.hpp.
References _ASSERT, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::cur_level, eWriteLock, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::locked_node, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::locked_type, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::node_lock, and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::tree_path.
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_CreatePathToLeaf(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_SplitNode().
◆ x_FinalDeleteNode()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
void CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_FinalDeleteNode ( SNode * node ) inlineprivateDefinition at line 481 of file concurrent_map.hpp.
References _ASSERT, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::cnt_filled, i, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::kCntChildsInNode, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::keys, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::kLeafTreeLevel, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::m_LeafAlloc, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::m_NodeAlloc, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::max_key, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::tree_level, and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DerefKey().
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::CFinalNodeDeleter::Delete(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_Finalize().
◆ x_Finalize()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
void CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_Finalize ( void ) inlineprivateDefinition at line 503 of file concurrent_map.hpp.
References _ASSERT, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNode::childs, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::cnt_filled, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::eValueDeleted, CAtomicCounter::Get(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::kCntChildsInNode, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::kLeafTreeLevel, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::kMaxTreeHeight, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::m_CntNodes, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::m_RootNode, NULL, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::status, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::tree_level, and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_FinalDeleteNode().
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::Clear().
◆ x_FinalizeCallContext()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
void CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_FinalizeCallContext ( SCallContext & call_ctx ) const inlineprivateDefinition at line 614 of file concurrent_map.hpp.
References CAtomicCounter::Add(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::locked_node, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::m_CntRootRefs, and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_UnlockCurNode().
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::Get(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::Put(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::PutOrGet(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_EraseIf(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_SetValueStatus().
◆ x_FindContainingIndex()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 386 of file concurrent_map.hpp.
References CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::eValueDeleted, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::kCntChildsInNode, ncbi::grid::netcache::search::fields::key, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::status, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_FindKeyIndex(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_GetNextIndex().
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_CreatePathToLeaf(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DiveToNextLevel().
◆ x_FindInsertSpace()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 443 of file concurrent_map.hpp.
References CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::eValueDeleted, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::kCntChildsInNode, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::status, and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_ScanForInsertSpace().
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_AddNodeKey(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_InsertLeafValue().
◆ x_FindKeyIndex() [1/2]template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 366 of file concurrent_map.hpp.
References _ASSERT, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::eValueDeleted, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::kCntChildsInNode, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SRefedKey::key, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::keys, NULL, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::status, and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_FindKeyIndex().
◆ x_FindKeyIndex() [2/2]template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 354 of file concurrent_map.hpp.
References CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::kCntChildsInNode, ncbi::grid::netcache::search::fields::key, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::keys, and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_IsKeyLess().
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_AddNodeKey(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DiveAndCreateValue(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DiveAndFindKey(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_FindContainingIndex(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_FindKeyIndex(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_InsertLeafValue(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_LockNodeAndWaitKey(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_ShrinkTree().
◆ x_GetNextIndex()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 378 of file concurrent_map.hpp.
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_AddNodeKey(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_FindContainingIndex().
◆ x_GetRootAndHeight()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 566 of file concurrent_map.hpp.
References CAtomicCounter::Add(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::m_CntRootRefs, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::m_RootLock, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::m_RootNode, and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::m_TreeHeight.
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_CheckRootSplit(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_InitializeCallContext().
◆ x_Initialize()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
void CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_Initialize ( void ) inlineprivateDefinition at line 493 of file concurrent_map.hpp.
References CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::kLeafTreeLevel, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::m_CntLeafNodes, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::m_CntNodes, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::m_CntRootRefs, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::m_CntValues, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::m_RootNode, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::m_TreeHeight, NULL, CAtomicCounter::Set(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_CreateNode().
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::CConcurrentMap(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::Clear().
◆ x_InitializeCallContext()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
void CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_InitializeCallContext ( SCallContext & call_ctx ) const inlineprivateDefinition at line 606 of file concurrent_map.hpp.
References CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::cur_level, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::split_level, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::tree_height, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::tree_path, and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_GetRootAndHeight().
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::Get(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::Put(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::PutOrGet(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_EraseIf(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_SetValueStatus().
◆ x_InsertLeafValue()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
TValue* CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_InsertLeafValue ( SCallContext & call_ctx, SNode * node, TNodeIndex key_index, const TValue & value ) inlineprivateDefinition at line 821 of file concurrent_map.hpp.
References CAtomicCounter::Add(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::cnt_filled, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::eValueActive, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::eValueDeleted, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::kCntChildsInNode, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::keys, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::locked_node, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::lookup_key, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::m_CntValues, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::status, rapidjson::value, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_AssignKeyRef(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_FindInsertSpace(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_FindKeyIndex(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_SplitNode(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_Value().
◆ x_IsKeyFound()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 348 of file concurrent_map.hpp.
References CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::eValueDeleted, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::kCntChildsInNode, ncbi::grid::netcache::search::fields::key, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::keys, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::status, and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_IsKeyLess().
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DiveAndCreateValue(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DiveAndFindKey().
◆ x_IsKeyLess() [1/4]template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 331 of file concurrent_map.hpp.
References CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SRefedKey::key, NULL, and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_IsKeyLess().
◆ x_IsKeyLess() [2/4]template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 319 of file concurrent_map.hpp.
References CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SRefedKey::key, NULL, and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_IsKeyLess().
◆ x_IsKeyLess() [3/4]template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 325 of file concurrent_map.hpp.
References CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SRefedKey::key, NULL, and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_IsKeyLess().
◆ x_IsKeyLess() [4/4]template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 315 of file concurrent_map.hpp.
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_FindKeyIndex(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_IsKeyFound(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_IsKeyLess(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_LockCurNode(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_SplitNode().
◆ x_IsNodeToBeDeleted()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
bool CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_IsNodeToBeDeleted ( SNode * node ) const inlineprivateDefinition at line 340 of file concurrent_map.hpp.
References CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::cnt_filled, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::max_key, and NULL.
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_CreatePathToLeaf(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DeleteEmptyNodes(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DeleteKey(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DiveToNextLevel(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_LockLeafNode().
◆ x_LockCurNode()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 621 of file concurrent_map.hpp.
References CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::cur_level, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::locked_node, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::locked_type, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::lookup_key, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::max_key, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::node_lock, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::right_node, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::tree_path, and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_IsKeyLess().
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_CreatePathToLeaf(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DiveToNextLevel(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_LockLeafNode(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_LockNodeAndWaitKey().
◆ x_LockLeafNode()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 780 of file concurrent_map.hpp.
References CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_IsNodeToBeDeleted(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_LockCurNode(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_MoveOneLevelUp(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_UnlockCurNode().
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DiveAndCreateValue(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DiveAndFindKey().
◆ x_LockNodeAndWaitKey()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 649 of file concurrent_map.hpp.
References CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNode::childs, eWriteLock, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::kCntChildsInNode, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::keys, NCBI_SCHED_YIELD, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_FindKeyIndex(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_LockCurNode(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_UnlockCurNode().
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_AddRegularSplit(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DeleteEmptyNodes().
◆ x_MoveOneLevelDown()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 774 of file concurrent_map.hpp.
References CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNode::childs, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::cur_level, and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::tree_path.
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_CreatePathToLeaf(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DiveToNextLevel().
◆ x_MoveOneLevelUp()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 760 of file concurrent_map.hpp.
References CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::cur_level, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::right_node, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::tree_height, and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::tree_path.
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_CreatePathToLeaf(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DiveToNextLevel(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_LockLeafNode().
◆ x_PropagateSplit()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 912 of file concurrent_map.hpp.
References CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::split_level, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::tree_height, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_AddRegularSplit(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_CheckRootSplit(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_UnlockCurNode().
◆ x_ScanForInsertSpace()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 393 of file concurrent_map.hpp.
References _ASSERT, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNode::childs, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::eValueDeleted, i, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::kCntChildsInNode, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::keys, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::kLeafTreeLevel, leaf(), memmove, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::status, and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::tree_level.
◆ x_SetValueStatus()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 539 of file concurrent_map.hpp.
References eWriteLock, ncbi::grid::netcache::search::fields::key, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::kLeafTreeLevel, result, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::status, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::tree_path, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DiveAndFindKey(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_FinalizeCallContext(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_InitializeCallContext().
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::ActivateKey(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::PassivateKey().
◆ x_ShrinkTree()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
void CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_ShrinkTree ( void ) inlineprivateDefinition at line 588 of file concurrent_map.hpp.
References _ASSERT, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNode::childs, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::cnt_filled, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::kCntChildsInNode, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::m_RootLock, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::m_RootNode, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::m_TreeHeight, NULL, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_CanShrinkTree(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DeleteNode(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_FindKeyIndex().
◆ x_SplitNode()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 867 of file concurrent_map.hpp.
References CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNode::childs, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::cnt_filled, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::eValueDeleted, i, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::kCntChildsInNode, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::keys, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::kLeafTreeLevel, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::left_key, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::left_node, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::lookup_key, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::max_key, NULL, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::right_key, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::right_node, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::right_node, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::split_level, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::status, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::tree_level, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::tree_path, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SLeafNode::values, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_CreateNode(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_ExchangeNodeLocks(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_IsKeyLess().
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_AddNodeKey(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_InsertLeafValue().
◆ x_UnlockCurNode()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 636 of file concurrent_map.hpp.
References CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::locked_node, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::locked_type, CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SNodeBase::node_lock, and NULL.
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_AddRegularSplit(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_CreatePathToLeaf(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DeleteEmptyNodes(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DiveToNextLevel(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_FinalizeCallContext(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_LockLeafNode(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_LockNodeAndWaitKey(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_PropagateSplit().
◆ x_Value()template<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 344 of file concurrent_map.hpp.
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::Get(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::PutOrGet(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DiveAndCreateValue(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_InsertLeafValue().
◆ CFinalNodeDeletertemplate<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 288 of file concurrent_map.hpp.
◆ m_CntLeafNodestemplate<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 1016 of file concurrent_map.hpp.
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::GetCntLeafNodes(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_CreateNode(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DeleteNode(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_Initialize().
◆ m_CntNodestemplate<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 1015 of file concurrent_map.hpp.
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::GetCntNodes(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_CreateNode(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DeleteNode(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_Finalize(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_Initialize().
◆ m_CntRootRefstemplate<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 1014 of file concurrent_map.hpp.
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_CanShrinkTree(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_FinalizeCallContext(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_GetRootAndHeight(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_Initialize().
◆ m_CntValuestemplate<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 1017 of file concurrent_map.hpp.
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::GetCntValues(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DeleteKey(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_Initialize(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_InsertLeafValue().
◆ m_Comparatortemplate<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
◆ m_LeafAlloctemplate<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 1021 of file concurrent_map.hpp.
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_CreateNode(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_FinalDeleteNode().
◆ m_NodeAlloctemplate<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 1020 of file concurrent_map.hpp.
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_CreateNode(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_FinalDeleteNode().
◆ m_NodesDeletertemplate<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 1013 of file concurrent_map.hpp.
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::HeartBeat(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DeleteNode().
◆ m_RefedKeyAlloctemplate<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 1022 of file concurrent_map.hpp.
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_AssignKeyRef(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DerefKey().
◆ m_RootLocktemplate<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
CSpinRWLock CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::m_RootLock mutableprivateDefinition at line 1011 of file concurrent_map.hpp.
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_ChangeRoot(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_GetRootAndHeight(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_ShrinkTree().
◆ m_RootNodetemplate<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 1012 of file concurrent_map.hpp.
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_CanShrinkTree(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_ChangeRoot(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_Finalize(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_GetRootAndHeight(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_Initialize(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_ShrinkTree().
◆ m_TreeHeighttemplate<class Key , class Value , class Comparator = less<Key>, class Allocator = SConstructAllocator<Key>, TPL_UINT1 CntChildsInNode = 8, TPL_UINT1 MaxTreeHeight = 16, TPL_UINT1 DeletionDelay = 3, TPL_UINT1 DelStoreCapacity = 20>
Definition at line 1018 of file concurrent_map.hpp.
Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::GetTreeHeight(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_CanShrinkTree(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_ChangeRoot(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_GetRootAndHeight(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_Initialize(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_ShrinkTree().
The documentation for this class was generated from the following file:
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4