Interval Tree implementation for C#
This is the data structure you need to store a lot of temporal data and retrieve it super fast by point in time or time range.
Interval Tree are data structure useful for fast retrieval of temporal data based on point in time or range in time.
This implementation is a translation I've made from this site:
from Java language.
As they guy from the original implementation say, I've publish this because I need it in one of my projects and I hope it will save time for others who needs it.
You can see my
post about it
Hope it will be useful to you.