yes, std clocks have ugly types

Destroy the object of type value_type pointed to by p

Call the destructor on all elements

distance from p to q squared

distance from p to q squared

The dense version. Checks backwards from every vertex v for all in edges (u,v). If u is in vertices and cond(v) is satisfied, fa(u,v) is applied, an

The sparse version. Checks all forward edges (u,v) from each vertex u in vertices. If cond(v) then fa(u,v) is applied and if it returns true v is in

Is empty?

Returns true if the stack is currently empty

Returns an iterator pointing to the end of the range

returns all the current entries compacted into a sequence

Driver

the sequence of values for the feature

filter points in the circumcicle of t1 and t2 which are in the circumcicle of t

Returns the value if an equal value is found in the table otherwise returns the "empty" element. due to prioritization, can quit early if v is greater