returns true on success

Create a bucketing structure. n : the number of identifiers d : map from identifier -> bucket order : the order to iterate over the buckets total_buck

Temporary special constructor to create a sequence from an array.

pack deletions in array removes edges from tables to delete empty tables, call updateDegreesDeleteFromTable() after minor rebalancing not packing tabl

must be called before cleanUpEdgeTablesDeletion because markEdgeArrayInsertion starts from D[u]

cleanUp the wedges, let c1 = c1+c2+c3-c4-c5 called before tables are cleaned up if del_flag is true, we delete 0 counts wedges, use edgesD if del_flag

updates and deletes at the same time

updates and deletes at the same time

cleanup or delete (u,v) from T swap u,v if needed

cleanup or delete (u,v) from T swap u,v if needed

updates and deletes at the same time if (u,v) is not a delete edge, do not need to check for deleting wedge only deleting edges might cause wedge coun

updates and deletes at the same time if (u,v) is not a delete edge, do not need to check for deleting wedge only deleting edges might cause wedge coun

assumes no push or pop in progress

Unlikely to be necessary since neighbors are likely flat * allocated in a shared array */

Unlikely to be necessary since neighbors are likely flat * allocated in a shared array */

TODO: used?

TODO: used?