Benchmark the subscript operator. We expect a difference in performance with sequence and short_sequence since short_sequence should have to perform a

Recursively build the decision tree. A is a sequence of features, each with a sequence of values for each point. A[0] is the target feature and the

Construct a capacitated buffer with the capacity to hold the given number of objects of type value_type, using the given allocator

checks at completion : o flow constraints (excess = flow-in - flow-out) o capacity constraints (no edge has more flow than capacity) o label constrain

Clears all memory ever allocated by this allocator. All allocated blocks must be returned before calling this function. This operation is not safe to

Destroy all elements, free the buffer (if any) and set the sequence to the empty sequence

Empties the stack Can be safely invoked concurrently with other operations, though it is possible that this operation can be stalled indefinitely if

Used by ThreadSpecific which stores a chunked sequence of items that is at least as large as the number of active threads. Given a thread ID, items a