Checks if the number of elements (non-dummy) is 0

True if range is empty.

Place operation in mailbox, then either handle mailbox or wait for the operation to be completed by a different thread. */

Perform an atomic bitwise-AND on the operand, and return its previous value.

Call finish when done handling this operation The operation will be released to its originating thread, and possibly deleted. */

The "free" analogue to discard a previously allocated piece of memory.

Free a closure allocated by allocate_closure_v3

Deallocate task pool that was allocated by means of allocate_task_pool.

front() and back()

similarly to front(), returns depth of the first range in the pool

return allocator object

Pointer to the task group descriptor.

true if the current low_token is valid.

Modifiers

override*/

Adds to list of predecessors added by make_edge override*/

override*/

assign n items by copying t

override*/

removes from to list of predecessors (used by remove_edge) override*/

override*/

Erase an element from the list. This is not a concurrency safe function.

Find the element in the split-ordered list

Insert an element in the hash given its value

Register successor

Release read lock on the given mutex

Release writer lock on the given mutex

Remove successor

Try to acquire read lock on the given mutex