http://hackage.haskell.org/cgi-bin/hackage-scripts/package/rangeminefficiently
(in effectively linear lazy preprocessing time) processes an
array to find minimum elements of subranges of the array in constant time.
--
Louis Wasserman
wasserman.lo...@gmail.com
_
The typehash library allows you to produce a unique identifier (a
cryptographic hash) for a type.
This is useful if you save values of some type to a file (text,
binary, whatever format you wish)
and then when you read it back in again you want to verify that the
type you want to read is the
one yo
Hello,
I've been sitting on this for a while, waiting for some changes to uvector to
go in, but finally decided I should just release it, and fix it up if and when
said changes go in. So, I'm announcing the first release of uvector-
algorithms.
What it is is a library of algorithms (mostly sort
