symmetrize and remove self edges from a graph

converts from sorted sequence into a "heap indexed" tree

converts from sorted sequence into a "heap indexed" tree

transpose a directed graph i.e. generate the backward edges for every forward edges

initialize n elements all as roots

prioritized linear probing a new key will bump an existing key up if it has a higher priority an equal key will replace an old key if replaceQ(new,old

if q is closer to p than candidates[0] then swap it in

used to check if already pushed onto active list

step vertex was last updated

Wait until notified to wake up

Wakes up at least one sleeping worker (more than one worker may be woken up depending on the implementation).

Wake up all sleeping workers

Does the box for T intersect an epsilon ball around p? Positive epsilon to test if strictly outside, and negative to test if strictly inside. Can ret

Does the box for T intersect an epsilon ball around p? Positive epsilon to test if strictly outside, and negative to test if strictly inside. Can ret

Start an individual worker task, stealing work if no local work is available. May go to sleep if no work is available for a long time, until woken up

Perform any remaining deferred destruction. Need to be very careful about additional objects being queued for deferred destruction by an object that w

Destructor

If uninitialized memory debugging is turned on, make sure that each object of type UninitializedTracker has been initialized since we are about to run