haskell-segtree is an polymorphic implementation of a lazy segment tree (lazy as in the context of data structures, not in the Haskell way) written in Haskell.
To build the library, run cabal build. To run the QuickCheck tests, run
cabal test.
The code is annotated with Haddock-style comments. To generate HTML
documentation, run cabal haddock.
See /src/example.lhs for sample usage, along with a little bit of explanation regarding the functioning of the library.