SegmentTree

Data structure for querying the set (or count) of intervals covering given point

LTS Haskell 12.26:0.3
Stackage Nightly 2018-09-28:0.3
Latest on Hackage:0.3

See all snapshots SegmentTree appears in

BSD-3-Clause licensed and maintained by Dmitry Astapov

Module documentation for 0.3

This version can be pinned in stack with:[email protected]:a9e70e7151e762c9ac48f8f3736877dac485db9ca800dee348dd747a9ea36245,1129

Segment Tree implemented following section 10.3 and 10.4 of Mark de Berg, Otfried Cheong, Marc van Kreveld, Mark Overmars "Computational Geometry, Algorithms and Applications", Third Edition (2008) pp 231-237

Depends on 1 package(full list with versions):