joshlk·8 か月前·議論Asking a silly question… what piece of kernel code do you find the most awe-inspiring or impressive?
joshlk·8 か月前·議論The top claim is that it's "Incredibly Fast" but I can't find any performance benchmarks. Can anyone find a link?
joshlk·9 か月前·議論R-Trees are a good data structure to use in this case, enabling you to query a collection of intervals for overlap with another in O(log(n)) time.Wikipedia: https://en.wikipedia.org/wiki/R-tree