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.1.0/interval-map-0.1.0.tbz sha256=73aad4d6fd4993e3a98e0da1120d551b863c90282fc316f92d127a525aa7322c sha512=895e2aa016a1f048e15b823080899ef996e06298167321dfdeca1d37b8c5d0730261f3fea17f6f1a8e796e0b4f7ff0cd638cf97db867f1281cc7803a2cfda2ae |
| Edit | https://github.com/ocaml/opam-repository/tree/master/packages/interval-map/interval-map.0.1.0/opam |
No package is dependent
