SegmentTree: Data structure for querying the set (or count) of intervals covering given point
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]
Flags
Automatic Flags
| Name | Description | Default |
|---|---|---|
| test | Disabled |
Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info
Downloads
- SegmentTree-0.3.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
- No Candidates
| Versions [RSS] | 0.1, 0.2, 0.3 |
|---|---|
| Dependencies | base (>=3 && <=5), HUnit, QuickCheck (>=2.0.0), test-framework, test-framework-hunit, test-framework-quickcheck2 [details] |
| Tested with | ghc >=6.10.4 |
| License | BSD-3-Clause |
| Author | Dmitry Astapov <dastapov@gmail.com> |
| Maintainer | Dmitry Astapov <dastapov@gmail.com> |
| Category | Data |
| Uploaded | by DmitryAstapov at 2012-10-29T22:16:04Z |
| Distributions | |
| Reverse Dependencies | 1 direct, 0 indirect [details] |
| Executables | SegmentTreeTests |
| Downloads | 3669 total (6 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs uploaded by user Build status unknown [no reports yet] |