An Eytzinger arranged binary tree for interval searches.
Currently the actual library is in the eztreelib folder.
- prefetch does not make it faster
- Seems like the worst case is better than other methods
- Baseline is about 3x slower though
- Overall ScaiList seems to be the best choice, always being faster than eztree. need to add more tests to scailist