This project is a Java implementation of two w-bit predecessor data structures from [Willard 1982]:
- x-fast trie: O(log w) predecessor/successor, O(w) insert/delete
- y-fast trie: O(log w) insert/delete/predecessor/successor
See this video lecture for more information.