recursive routine almost direct transcription from paper but limited to 2d Delaunay instead of arbitrary convex hull

pushes active for next round onto local queue

Generate a random vector of pairs of 32-bit integers.

Generate a random sorted vector of length n consisting of random non-negative 32-bit integers.

looks for points within range for p in subtree rooted at T. Can return immediately if radius does not intersect the box.

assumes each edge is kept in just one direction, so copied into other

allocate, touch, and free to make sure space for small blocks is paged in

Allocate n elements across however many lists are needed (rounded up)

The main routine. does O(log_(1 + epsilon) max_size) rounds each calling manis on sets with size: ceil(pow(1 + epsilon, i+1)) > size >= ceil(pow(1 + e

The main search routine. T must be a leaf node.

The main search routine. T must be a leaf node.

Size

Returns the number of elements in the zipped range. This is the length of the shortest input range

Returns the number of elements in the flattened range

Returns the number of elements in the range

Returns the number of elements in the resulting range

Returns the number of elements in the range

Returns the number of elements in the filtered range

Return the current size of the stack

Empty constructor

generates a string of length n, spaces included

Swap this with another delayed sequence

Swap a sequence backend with another. Since small sequences must contain trivial types, a sequence can always be swapped by swapping raw bytes.