SegmentTree: Data structure for O(log n) mconcats on list intervals
The SegmentTree data structure allows for logarithmic
time accumulations on preprocessed lists of Monoids.
Downloads
- SegmentTree-0.1.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 [details] |
| License | LicenseRef-LGPL |
| Author | Alexandru Scvortov |
| Maintainer | scvalex@gmail.com |
| Category | Data |
| Home page | http://scvalex.github.com/articles/SegmentTree.html |
| Uploaded | by AlexandruScvortov at 2009-01-31T14:16:26Z |
| Distributions | |
| Reverse Dependencies | 1 direct, 0 indirect [details] |
| Downloads | 3712 total (7 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] |