A simple uncopyable object. Useful to test inplace sorting algorithms to ensure that no accidental copies are being made anywhere in the code.

A self-referential object that always holds a pointer to itself. This is useful to check that copy and move constructors are being called rather than

Check that filtered ranges are copyable and movable

A functional that takes a range r and returns its size as given by parlay::size(FORWARD(r))

Search the tree for the k-nearest neighbors of a point search(node, point, k) After construction the result is left in candidates.

a finite field modulo a prime The prime needs to fit in 32 bits so multiplication into 64 bits does not overflow.

Used to count the number of interactions. Just for performance statistics not needed for correctness.

A deterministic random bit generator satisfying uniform_random_bit_generator Can therefore be used as the engine for C++'s <random> number generators.

an event when entering a box (start) or exiting the box (end). Each event has the coordinate, the index of the box, and whether start or end The last

The closure object keeps a cache of the begin iterator to the range r. This is useful because some ranges might perform something like small-size opt

A type that is not trivially relocatable because it keeps a pointer to an object inside itself

Check that mapped ranges are copyable and movable

No annotation needed since this one should be detectable

A ThreadIdPool hands out and maintains available unique dense IDs for active threads. Each thread that requests an ID will get one in the range from [

A type that is trivially relocatable because it is trivially movable and trivially destructible

A simple type to help look for uninitialized memory bugs. UninitializedTracker is essentially an integer type, but also tracks whether it is currently

A pair that ignores its seconds element for comparisons Useful to test stable sorting algorithms.

Larger than block_allocators default size