Concurrent B-skip-list container; declared here for friend declarations.
Declared in <folly/ConcurrentBSkipList.h>
template<
typename T,
typename PayloadType = void,
int B = 16,
KeyReadPolicy ReadPolicy = bskip_detail::kDefaultReadPolicy<T>,
LeafStoragePolicy StoragePolicy = LeafStoragePolicy::Separate,
typename Policy = ConcurrentBSkipDefaultPolicy<T>>
class ConcurrentBSkipList;
| Name | Description |
|---|---|
Skipper | A forward-only cursor over a ConcurrentBSkipList. |
| Name | Description |
|---|---|
FindResult | The result of a find: an optional key, or key/payload pair with payload. |
key_type | The key type stored in the container. |
leaf_node_type | The leaf node type holding the stored keys. |
payload_type | The mapped payload type, or void for a set. |
| Name | Description |
|---|---|
ConcurrentBSkipList [constructor] | Constructors |
~ConcurrentBSkipList [destructor] | Destroys the container and frees its nodes. |
operator= | Assignment operators |
add | add overloads |
addOrUpdate | Inserts a key or updates the payload of an existing live key. |
contains | contains overloads |
count | count overloads |
empty | Returns whether the container has no live entries. |
erase | Removes a key, matching the standard erase signature. |
find | find overloads |
forEachElement | Invokes a callable for each live element in the container. |
remove | Removes a key by tombstoning its live entry. |
removeAndGetPayload | Removes a key and returns its payload if it was live. |
size | Returns the number of live entries. |
updatePayload | Updates the payload of a live key in place. |
| Name | Description |
|---|---|
kHasPayload | Whether the container stores a payload alongside each key. |
kInlinePayloadStorage | Whether payloads are stored inline in the leaf nodes. |
kReadPolicy | The policy controlling how keys are read during scans. |
| Name | Description |
|---|---|
| T | The key type; its numeric_limits min/max are reserved sentinels. |
| PayloadType | The mapped payload type, or void for a set. |
| B | The per-node key capacity. |
| ReadPolicy | The policy controlling how keys are read during scans. |
| StoragePolicy | Whether leaf payloads are stored inline or separately. |
| Policy | Supplies Hash, Comp, NodeAlloc, and promotion parameters. |