interval-mapversion
An immutable interval map data structure
An immutable interval map data structure implemented as an interval tree. Based on jgblight/im_interval_tree.
Interval maps are great for finding intervals and their associated values which overlap a given interval. This interval map supports intervals with excluded, included, and unbounded bound ends. Multiple values may be associated with the same interval.
| Author | Dan Gallagher |
|---|---|
| License | MIT |
| Published | |
| Homepage | https://github.com/dgllghr/interval-map |
| Issue Tracker | https://github.com/dgllghr/interval-map/issues |
| Maintainer | Dan Gallagher |
| Dependencies | |
| Source [http] | https://github.com/dgllghr/interval-map/releases/download/0.2.0/interval-map-0.2.0.tbz sha256=e7fb0d1aa8dc5d680066069e4dc8d2f7c4204b7d3398649c74c32690fc13ee91 sha512=ff6091efdef6f4c4c8e0fd93428f8646b99beefc1b47c5de74153be5d4b9264bb11e64388c794deb6dd1017ff7d383e82d0b6590799e901fe6b42aa015dd5a3f |
| Edit | https://github.com/ocaml/opam-repository/tree/master/packages/interval-map/interval-map.0.2.0/opam |
No package is dependent
