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

[ bsd3, data, library ] [ Propose Tags ]

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

Versions 0.1, 0.2, 0.3
Dependencies base [details]
License LicenseRef-LGPL
Author Alexandru Scvortov
Category Data
Home page
Uploaded by AlexandruScvortov at Sat Jan 31 14:16:26 UTC 2009
Distributions LTSHaskell:0.3, NixOS:0.3, Stackage:0.3, openSUSE:0.3
Downloads 1548 total (15 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




Maintainer's Corner

For package maintainers and hackage trustees