Progress: Lock-Free

Warning: unlike std::atomic<T>::cas() the param 'expected' will not be updated Progress: Wait-free (population oblivious)

Loads the current value of the counter. If the current value is zero, it is guaranteed to remain zero until the counter is reset

One of the invariants of OrcGC is that an object whose orc is not yet incremented, to adjust for the fact that it has one extra connection to it, must

This is currently not being used by any data structure, but we implemented it anyways Progress: Wait-free (population oblivious)

Inserts key if it is not in the list.

* Progress condition: wait-free bounded (by the number of threads) */

Protect an existing pointer. Only called when the ptr comes from an already published pointer in a lower index. Notice that the store here is done wit

Returns the next available he index for this thread, and updates maxHEs if needed TODO: consider optimizing by looking up if the ptr already exists an

Removes key if it is in the list.

Warning: unlike std::atomic<T>::cas() the param 'expected' will not be updated Progress: Wait-free (population oblivious)