Namespace for concurrent container components.
Types
Name |
Description |
This class provides a thread‐safe bounded queue of values. |
|
This class implements the queue's node. |
|
This class implements a guard that invokes |
|
This class implements a proctor that invokes |
|
This class represents a simple in‐process key‐value store supporting a variety of eviction policies. |
|
Namespace for enumerating cache eviction policies. |
|
Proctor that restores a cache queue on destruction. |
|
Test utility that exposes the cache RW‐mutex lock methods. |
|
Thread‐safe, indexable, double‐ended queue of |
|
This class provides a thread‐aware, lock‐free, fixed‐size queue of values. |
|
Thread‐enabled index manager for a fixed‐size circular buffer. |
|
This class provides a destruction guard that pops an element from a |
|
This class provides a proctor that clears a |
|
This class implements a thread‐enabled multipriority queue of |
|
This class stores one item of |
|
Thread‐safe indexed catalog of |
|
Thread‐safe iterator over an |
|
Proctor that cleans up a managed |
|
Thread‐safe pool of reusable objects that implements |
|
Namespace for resetter functors and the default creator type for |
|
Converter that adapts creator types for |
|
Proxy for a creator that default‐constructs objects of |
|
This private class template provides a default constructor which simply invokes the default constructor of the parameterized |
|
For a |
|
This class provides a thread‐enabled, double‐ended queue of |
|
This class provides a thread‐safe pool of |
|
Shared pointer representation object used by |
|
This class provides a thread‐safe unbounded queue of values that assumes a single consumer thread. |
|
This class provides a thread‐safe unbounded queue of values that assumes a single consumer thread. |
|
This class implements a guard that automatically invokes |
|
This class implements a proctor that, unless its |
|
This class implements a guard that automatically invokes |
|
This class provides a thread‐safe unbounded queue of values that assumes a single producer thread. |
|
This class provides a thread‐safe unbounded queue of values that assumes a single producer thread. |
|
This class implements a guard automatically invokes |
|
This class implements a proctor that, unless its |
|
This class provides a thread‐safe bounded queue of values that supports a single producer and a single consumer. |
|
|
This class implements a guard that invokes |
Thread‐safe ordered associative skip list of key/data pairs. |
|
Type‐safe pointer to a key/data pair in a |
|
Managed handle to a key/data pair in a |
|
RAII guard that locks two mutexes in address order to avoid deadlock. |
|
This component‐private structure is a node in the SkipList. |
|
This component‐private structure is a scoped guard that initializes new nodes and releases them in case of exception. |
|
Component‐private manager for the lock‐free pool of skip‐list nodes. |
|
This component‐private utility handles the lock‐free pool of list nodes. |
|
This component‐private class handles randomizing the levelization of list nodes. |
|
This class implements the logic for a striped hash multimap with logic that supports a (unique) map as a special case. |
|
This struct is a constructor flag used to select the contructor that takes a |
|
This class holds locks on an array of locks, established in sequential order, and unlocks them upon destruction in the RAII pattern. |
|
This class represents a bucket of the hash map. This class template represents the head of in the singly‐linked list of |
|
This class defines constant values used to represent the state of a |
|
A mutex + support info; padded to cacheline size, one per stripe |
|
A guard pattern on StripedUnorderedContainerImpl_LockElement, to release on exception, for a lock element locked as read. |
|
A guard pattern on StripedUnorderedContainerImpl_LockElement, to release on exception, for a lock element locked as write. |
|
This class template represents a node in the singly‐linked list of |
|
This class defines a proctor type that attempts to set the rehash bit of a state object, and if successful, clears that bit upon destruction. |
|
A vector element needed for efficient sorting for the |
|
Test utility exposing stripe lock/unlock for the test driver. |
|
Fully thread‐safe hash map from |
|
Fully thread‐safe striped hash multimap from |
|
Priority queue of |
|
Container for a time, data, handle, and key associated with a queue item. |
Functions
Name |
Description |
Write the value of |
|
Equality operators |
|
Inequality operators |
|
Return |
Created with MrDocs