Get range to use with parallel algorithms

Return number of pushes minus number of pops. Note that the result can be negative if there are pops waiting for the corresponding pushes. T

Allocate space for n objects.

at() with range check

Free block of memory that starts on a cache line

front() and back()

The "what" should be fairly short, not more than about 128 characters. Because we control all the call sites to handle_perror, it is pointless t

Dynamic sized array (segments) @return segment index of given index in the array

Destroy value at location pointed to by p.

Allocate enough space to grow to size n without having to allocate more memory later. Like most of the methods provided for STL compatibility, this me

Free previously allocated block of memory.

Returns the result when it arrives. If timeout is not None and the result does not arrive within timeout seconds then Timeout

Returns the current number of elements contained in the queue Returned value may not reflect results of pending operations. This operation rea

Return estimate of number of bytes of memory that this program is currently using. Returns 0 if not implemented on platform. */

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

---------------------------------------------------*/

True if list if empty; false otherwise.