This project is not actively maintained.
DataStructures
.NET standard library is awesome in general, but still, I think a few important pieces are missing.
IntervalsList
The problem statement is written in this SO question from 2013.
Looks trivially simple yet it’s surprisingly difficult to implement.
The higher-level collection classes (SortedList, SortedDictionary, SortedSet) ain’t good enough for that thing. None of them expose sufficient amount of implementation details to implement these intervals efficiently. For optimal performance, need to replace keys, and insert/erase ranges of nodes, none of these containers support these use cases.
For this reason, I’ve made a generic solution on top of sorted arrays.
Internally, the data structure is very similar to the SortedList from the standard library. I’ve copy-pasted a few lines of code from there, fortunately the MIT license allows that.
Known Issues
it’s impossible to trim the start of the collection by calling SetInterval with the EmptyValue value.
Ideally, this should result in moving the start of the collection forward.
In the current implementation, this results in the empty interval at the start, which is less than ideal.