Crate sif_itree

A simple library implementing an immutable, flat representation of an augmented interval tree

Supports querying for overlapping intervals without temporary allocations and uses a flat memory layout that can be backed by memory maps.

Structs

• ITree
  Interval tree mapping half-open intervals with boundaries of type K to values of type V

Type Aliases

• Item
  The items stored in the tree consisting of an interval and an associated value
• Node
  The nodes of which the tree is built consisting of an item and the maximum of the interval upper bounds in the subtree