interval-mapversion Documentation on ocaml.org
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 | Daniel Gallagher |
|---|---|
| License | MIT |
| Published | |
| Homepage | https://github.com/dgllghr/interval-map |
| Issue Tracker | https://github.com/dgllghr/interval-map/issues |
| Maintainer | Daniel Gallagher |
| Dependencies | |
| Source [http] | https://github.com/dgllghr/interval-map/releases/download/0.2.1/interval-map-0.2.1.tbz sha256=194a9a3e5c032413edbd496af6c8cc2b534a56ae655bef24a26dda09ec587d88 sha512=d46f4d3af9b974daf4c21d8e766a5c706a9a4642ae86fee2ddb8e2bac1a68a4c7541e325ba9f22e1c3c81048965470078d73a6fb037c580d6f773afdb483bed6 |
| Edit | https://github.com/ocaml/opam-repository/tree/master/packages/interval-map/interval-map.0.2.1/opam |
No package is dependent
