[Haskell] [ANNOUNCE]: Ranged Sets
Tomasz Zielonka
tomasz.zielonka at gmail.com
Mon Dec 12 15:06:15 EST 2005
On Sun, Dec 11, 2005 at 11:14:46PM +0000, Paul Johnson wrote:
> From the README:
>
> Ranged sets allow programming with sets of values that are described
> by a
> list of ranges. A value is a member of the set if it lies within one of
> the ranges. The ranges in a set are ordered and non-overlapping, so the
> standard set operations can be implemented by merge algorithms in
> O(n) time.
I was thinking about writing such a library myself. Now I won't have to
:-)
Best regards
Tomasz
--
I am searching for a programmer who is good at least in some of
[Haskell, ML, C++, Linux, FreeBSD, math] for work in Warsaw, Poland
More information about the Haskell
mailing list