Suggest data structure suitable for key range lookup
|Added at||2017-01-02 10:01|
I am looking for data structure similar to SCG.Dictionary but having number ranges as keys.
Main operation where the most of performance is required would be lookup for keys overlapping with the specified range.
For example, assuming the following map
when [10, 30] is passed to search algorithm it must reply with the following entries:
Ideally search method should return IEnumerable rather than copying results into intermediate container. Similarly to SortedSet.GetViewBetween
Usage pattern would be something along the lines of
Are there any ready made solutions?