Sleator and Dietz total order

This class implements the total order algorithm of Deitz and Sleator.

compare O(1)

Given two nodes, return -1,0,1 depending on which order the nodes are in.

succinsert O(log n), but almost always O(1)

Given a node, insert a currently non-inserted node after it.

remove O(1)

Take a node out of the total order.

This code does not perform any memory allocation. You can therefore statically include nodes in your own data structures.

Designed with emacs