@hackage SegmentTree0.1

Data structure for O(log n) mconcats on list intervals

Categories
License
LicenseRef-LGPL
Maintainer
scvalex@gmail.com
Links
- Homepage
- Documentation
- No source repository
- Security
Versions
- 0.3 Mon, 29 Oct 2012
- 0.2 Fri, 9 Apr 2010
- 0.1 Sat, 31 Jan 2009

Installation
In your cabal file:
Dependencies (1)
- base
Dependents (2)
@hackage/IntervalMap, @hackage/acme-everything

The SegmentTree data structure allows for logarithmic time accumulations on preprocessed lists of Monoids.