Found 5 packages
Interval tree implementation focused on memory efficiency and performance. Similar to the RangeTree implementation, but uses as little as <10% of the peak memory in comparison.
A generic implementation of a centered interval tree in C#. In computer science, an interval tree is an ordered tree data structure to hold intervals. Specifically, it allows one to efficiently find all intervals that overlap with any given interval or point. It is often used for windowing queries, for instance, to find all roads on a computerized map inside a rectangular viewport, or to find all visible elements inside a three-dimensional scene.
Deprecated: This project has been moved. Please install Jamarino.IntervalTree to get the latest performance improvements and future updates.
Itc4net is a C# implementation of Interval Tree Clocks, a causality tracking mechanism.
This project aim to provide an abstract layer to time related facilities in C#. See project site for further details.