Implicit Interval Trees (for Java)
Geek Repo:Geek Repo
Github PK Tool:Github PK Tool
mlin opened this issue 2 years ago · comments
If we do linear scan for levels 0-2, then we only need maxEnds for levels 2 and above -- only every 4th value ((node+1) mod 4 == 0). An int[][] with index nodes on the major, and the sparse maxEnds on the minor.
int[][]