Lazy +Data.IntMap

module Data.IntMap.Lazy
containers Data.IntMap.Lazy
An efficient implementation of maps from integer keys to values (dictionaries). API of this module is strict in the keys, but lazy in the values. If you need value-strict maps, use Data.IntMap.Strict instead. The IntMap type itself is shared between the lazy and strict modules, meaning that the same IntMap value can be passed to functions in both modules (although that is rarely needed). These modules are intended to be imported qualified, to avoid name clashes with Prelude functions, e.g. > import Data.IntMap.Lazy (IntMap) > import qualified Data.IntMap.Lazy as IntMap The implementation is based on big-endian patricia trees. This data structure performs especially well on binary operations like union and intersection. However, my benchmarks show that it is also (much) faster on insertions and deletions when compared to a generic size-balanced map implementation (see Data.Map). * Chris Okasaki and Andy Gill, "Fast Mergeable Integer Maps", Workshop on ML, September 1998, pages 77-86, * D.R. Morrison, "/PATRICIA -- Practical Algorithm To Retrieve Information Coded In Alphanumeric/", Journal of the ACM, 15(4), October 1968, pages 514-534. Operation comments contain the operation time complexity in the Big-O notation Many operations have a worst-case complexity of O(min(n,W)). This means that the operation can become linear in the number of elements with a maximum of W -- the number of bits in an Int (32 or 64).
package LazyVault
LazyVault is a sandboxing tool to install libraries and executables with a sandboxed environment. At the moment it's only supported under Unix or Gnu Systems. This package has only been tested under Gnu/Linux however. This program creates cabal sandboxes which you can use globally. For a detailed explaination on how this works refer to the README file found on the github page. Version 0.0.1
package lazy-csv
The CSV format is defined by RFC 4180. These efficient lazy parsers (String and ByteString variants) can report all CSV formatting errors, whilst also returning all the valid data, so the user can choose whether to continue, to show warnings, or to halt on error.  Valid fields retain information about their original location in the input, so a secondary parser from textual fields to typed values can give intelligent error messages. Version 0.5
package lazy-io
The library provides some basic but useful lazy IO functions. Keep in mind that lazy IO is generally discouraged. Perhaps a coroutine library (e.g. pipes) will better suit your needs. Version 0.1.0
package lazyarray
This package built on standard array package adds support for lazy monolithic arrays. Such arrays are lazy not only in their values, but in their indexes as well. Read the paper "Efficient Graph Algorithms Using Lazy Monolithic Arrays" ( for further details. Version 0.1.3
package lazyio
Run IO actions lazily while respecting their order. Running a value of the LazyIO monad in the IO monad is like starting a thread which is however driven by its output. That is, the LazyIO action is only executed as far as necessary in order to provide the required data. Version
package lazysmallcheck
Lazy SmallCheck is a library for exhaustive, demand-driven testing of Haskell programs.  It is based on the idea that if a property holds for a partially-defined input then it must also hold for all fully-defined refinements of the that input.  Compared to ``eager'' input generation as in SmallCheck, Lazy SmallCheck may require significantly fewer test-cases to verify a property for all inputs up to a given depth. Version 0.6
package lazysplines
See the source of Numeric.LazySplines.Examples for usage. Version 0.1
package MonadRandomLazy
Support for lazy computations which consume random values. Version 0.1
package NumLazyByteString
Num, Enum, Eq, Integral, Ord, Real, and Show instances for Lazy ByteStrings Version
package safe-lazy-io
Provides a safer API for incremental IO processing in a way very close to standard lazy IO. Version 0.1
package vector-functorlazy
Functor-lazy vectors perform the fmap operation in constant time, whereas other vectors require linear time.  All vector operations are supported except for slicing.  See for details on how this module works under the hood. Version 0.0.1