Ensure that the capacity is at least new_capacity. The actual capacity may be increased to a larger amount.

Return the last element

add contributions from the leaves

Returns an iterator pointing to the first element of the range

Should only be called during initialization. Same as ensure_capacity, except does not need to copy elements from the existing buffer.

Remove all elements of the subsequence beginning at the element pointed to by p, and return a new sequence consisting of those removed elements.

Return the first element

Returns the number of blocks in the zipped range

Version of union that is safe for parallelism when no cycles are created (e.g. only link from larger to smaller vertex). Does not use ranks.

projects inequality constraint b onto equality constraint a

twice the area in the triangle defined by three points negative if counter clockwise