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

[ bsd3, data, library ] [ Propose Tags ]
Versions 0.1, 0.2, 0.3
Dependencies base (>=3 && <=5), HUnit, QuickCheck (>=2.0.0), test‑framework, test‑framework‑hunit, test‑framework‑quickcheck2 [details]
License BSD-3-Clause
Author Dmitry Astapov <>
Maintainer Dmitry Astapov <>
Category Data
Uploaded by DmitryAstapov at Mon Oct 29 22:16:04 UTC 2012
Distributions LTSHaskell:0.3, NixOS:0.3, Stackage:0.3, openSUSE:0.3
Executables SegmentTreeTests
Downloads 1533 total (13 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI

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

[Skip to Readme]





Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info


Maintainer's Corner

For package maintainers and hackage trustees

Readme for SegmentTree-0.3

[back to package description]
Configure as "cabal configure -ftest" and run "SegmentTreeTests" for
functional test suite.