25// Inserts a node into the circular root ring. A nonnull parent is cleared without comparing priorities; otherwise the payload comparator updates the minimum root.
95// Merges roots of equal rank through 33 scratch buckets and rebuilds the circular root ring and minimum pointer. Input roots must form the temporary null-terminated backward chain expected by removal.
160// Cuts a nonroot node, updates its parent's rank and loss mark, and cascades cuts after repeated child loss. This routine performs no key comparison.
196// Removes and returns the minimum payload, consolidating the remaining roots. An empty map returns null, and the removed allocation remains owned by the caller.
214// Repairs parent and minimum ordering after a payload priority decreases, cutting the node when needed. A null payload returns minus one; other paths return zero.
243// Allocates a node-sized block and returns the payload after its hidden header. It neither initializes the header nor inserts the node, and allocation failure returns null.
255// Frees the allocation containing a payload's hidden header. A null payload is accepted, but a linked node must be removed separately before freeing.