The goal is to store sorted unsigned integer intervals that can overlap only in the boundaries, e.g.,
|0–10|10–50|100–110|110–200|. This structure will be created by some insert operations (the order matters) in the start and than queried by a lot of queries. The query is specified by interval and the result is all intervals from structure that has at least a partial overlap.
There is no need to delete inserted data (delete operation), but the new inserted interval can overwrite the existing ones. Please consider the following example.
- insert: 40–70
- insert: 105–115
What structure do you recommend?