mlin / iitj

Implicit Interval Trees (for Java)

Geek Repo:Geek Repo

Github PK Tool:Github PK Tool

sparse maxEnds storage

mlin opened this issue · 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.