datastructure representing an abstract index. this is a 'simple' solution to the order-maintenance problem that has insert in O(log N), delete in O(1) and compare in O(1). Note that the implementation is quite obfuscated due to concurrency.