Fast enumeration tree - represents an ordered sequence of elements with O(n) insert, remove, and position
Supports the following operations:
insert(id, pos)- insert element
remove(pos)- remove element at position
pos(id)- return the position of element
Currently have part of a proof-of-concept in node.js, the "real" implementation will be in C.
- Red-Black balancing
- Implement in blazing-fast C