RetroSearch Browse

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from http://www.ncbi.nlm.nih.gov/IEB/ToolBox/CPP_DOC/doxyhtml/structCConcurrentMap_1_1SCallContext.html below:

NCBI C++ ToolKit: CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext Struct Reference

Search Toolkit Book for CConcurrentMap::SCallContext

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>
struct CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext

Definition at line 268 of file concurrent_map.hpp.

◆ SCallContext()

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 >::SCallContext::SCallContext ( const TKey & key ) inline

Definition at line 282 of file concurrent_map.hpp.

◆ cur_level

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 274 of file concurrent_map.hpp.

Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_AddRegularSplit(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_CheckRootSplit(), 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_DiveToLeafLevel(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_ExchangeNodeLocks(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_InitializeCallContext(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_LockCurNode(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_MoveOneLevelDown(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_MoveOneLevelUp().

◆ left_key

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 279 of file concurrent_map.hpp.

Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_AddNewRoot(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_AddRegularSplit(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_SplitNode().

◆ left_node

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>

SNode* CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::left_node

Definition at line 277 of file concurrent_map.hpp.

Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_AddNewRoot(), 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_SplitNode().

◆ locked_node

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>

SNode* CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::locked_node

Definition at line 271 of file concurrent_map.hpp.

Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_AddNodeKey(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_AddRegularSplit(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DeleteEmptyNodes(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_ExchangeNodeLocks(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_FinalizeCallContext(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_InsertLeafValue(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_LockCurNode(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_UnlockCurNode().

◆ locked_type

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 272 of file concurrent_map.hpp.

Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_ExchangeNodeLocks(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_LockCurNode(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_UnlockCurNode().

◆ lookup_key

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 270 of file concurrent_map.hpp.

Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_CreatePathToLeaf(), 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_DiveToNextLevel(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_InsertLeafValue(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_LockCurNode(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_SplitNode().

◆ right_key

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 280 of file concurrent_map.hpp.

Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_AddNewRoot(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_AddRegularSplit(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_SplitNode().

◆ right_node

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>

SNode* CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::SCallContext::right_node

Definition at line 278 of file concurrent_map.hpp.

Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_AddNewRoot(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_AddRegularSplit(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_SplitNode().

◆ split_level

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 275 of file concurrent_map.hpp.

Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_AddNewRoot(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_AddRegularSplit(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_InitializeCallContext(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_PropagateSplit(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_SplitNode().

◆ tree_height

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 273 of file concurrent_map.hpp.

Referenced by CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_AddNewRoot(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_CheckRootSplit(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_InitializeCallContext(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_MoveOneLevelUp(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_PropagateSplit().

◆ tree_path

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 276 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_AddNewRoot(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_CheckRootSplit(), 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_DiveAndCreateValue(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_DiveAndFindKey(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_EraseIf(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_ExchangeNodeLocks(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_InitializeCallContext(), 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(), CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_SetValueStatus(), and CConcurrentMap< Key, Value, Comparator, Allocator, CntChildsInNode, MaxTreeHeight, DeletionDelay, DelStoreCapacity >::x_SplitNode().

The documentation for this struct was generated from the following file:

src/app/netcache/concurrent_map.hpp

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