Number of objects to move between a per-thread list and a central list in one shot. We want this to be not too small so we can amortize the lock over

REQUIRES "k" is in range "[0,2^BITS-1]". REQUIRES "k" has been ensured before. Sets the value for KEY.

------------------------------------------------------------------------ These following lower-level operations are typically useful only to people im

* Convert string to int. * * @return The integer value corresponding to the string. **/

Returns the human interpretable facing of this org.

Returns the first prey (output) avatar, which should be random as the list is mixed whenever a new avatar is added

64-bit implementations of memory barrier can be simpler, because it "mfence" is guaranteed to exist.

can only be assigned once

The default "do_free" that uses the default callback.

Return the current value for KEY. Returns NULL if not yet set, or if k is out of range.

Returns the number of free objects in cache.

! Resize to n (preserve the absolute distance between begin and end, based around begin). */

To be called from iterator constructor only!