Returns the root task of the graph

iterator support

Expected to be used in assertions only, thus no empty form is defined. **/

True if filter is thread-bound.

Set reference count

------------------------------------------------------------------------ Capacity --------------------------------------------------------------------

Sequentially consistent full memory fence.

Clear container while keeping memory allocated. To free up the memory, use in conjunction with method compact(). Not thread safe **/

Return count of items (0 or 1)

Thread-safe, but if somebody can remove the key while find() is in progress, then any returned value is not guaranteed to correspond to that key. This

pointer access */ @{ */

Checks if this element in the list is a dummy, order enforcing node. Dummy nodes are used by buckets in the hash table to quickly index into the right

task on whose behalf this task is working, or NULL if this is a root.

------------------------------------------------------------------------ Methods of affinity_partitioner_base_v3 -------------------------------------

Swaps 'this' list with the passed in one

Iterators

index access */ @{ */

A token is always valid unless: 1) Memory allocation failed during construction 2) It was moved via the move constructor (Note: assignment does a swap

enqueue left task if necessary. Returns the non-enqueued task if there is one.

The grain size for this range.

Pushes elem onto the queue, increasing capacity of queue if necessary This operation can be safely used concurrently with other push, try_pop or empla

receive an item, return a task *if possible override */

override*/

Spawns a task that applies the body override */