intervaltree
intervaltree copied to clipboard
ekg
a minimal C++ interval tree implementation
Hello! Thank you for this implementation - it is extremely useful! I'd like to propose a change that would allow custom structs to be used as keys to the tree...
No effective change, simply changing some of the type declarations to "auto" in the test file
The example in the [README][readme]: [readme]: https://github.com/ekg/intervaltree/blob/f0c4046514f41072be20da07b69d8a92220c9294/README.md ``` vector intervals; T a, b, c; intervals.push_back(Interval(2, 10, a)); intervals.push_back(Interval(3, 4, b)); intervals.push_back(Interval(20, 100, c)); IntervalTree tree; tree = IntervalTree(intervals); ``` doesn't...
the find* and visit* methods should return intervals "in-order" (i.e. left tree Intervals -> current vector Intervals -> right tree Intervals). This would guarantee the returned Intervals are sorted by...
What is the point of the minbucket and maxbucket constructor parameters? Seems like there could just be one parameter maxbucket and if the user wants to max out the depth...
Not sure if this example is 100% correct, but it's the best I could infer
This fixes a known gcc parser bug that croaks on `= 6.
