Int -base
Pure stream based interface to lower level zlib wrapper
An efficient implementation of maps from integer keys to values (dictionaries).
This module re-exports the value lazy Lazy API, plus several value strict functions from Strict.
These modules are intended to be imported qualified, to avoid name clashes with Prelude functions, e.g.
> import Data.IntMap (IntMap)
> import qualified Data.IntMap 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, http://citeseer.ist.psu.edu/okasaki98fast.html
* 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 http://en.wikipedia.org/wiki/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).
An efficient implementation of integer sets.
These modules are intended to be imported qualified, to avoid name clashes with Prelude functions, e.g.
> import Data.IntSet (IntSet)
> import qualified Data.IntSet as IntSet
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 set implementation (see Data.Set).
* Chris Okasaki and Andy Gill, "Fast Mergeable Integer Maps", Workshop on ML, September 1998, pages 77-86, http://citeseer.ist.psu.edu/okasaki98fast.html
* D.R. Morrison, "/PATRICIA -- Practical Algorithm To Retrieve Information Coded In Alphanumeric/", Journal of the ACM, 15(4), October 1968, pages 514-534.
Additionally, this implementation places bitmaps in the leaves of the tree. Their size is the natural size of a machine word (32 or 64 bits) and greatly reduce memory footprint and execution times for dense sets, e.g. sets other. The asymptotics are not affected by this optimization.
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).
A module containing private Text internals. This exposes the Text representation and low level construction functions. Modules which extend the Text system may need to use this module.
You should not use this module unless you are determined to monkey with the internals, as the functions here do just about nothing to preserve data invariants. You have been warned!
A module containing private Text internals. This exposes the Text representation and low level construction functions. Modules which extend the Text system may need to use this module.
You should not use this module unless you are determined to monkey with the internals, as the functions here do just about nothing to preserve data invariants. You have been warned!
This lexeme parser parses an integer (a whole number). This parser is like natural except that it can be prefixed with sign (i.e. '-' or '+'). Returns the value of the number. The number can be specified in decimal, hexadecimal or octal. The number is parsed according to the grammar rules in the Haskell report.
Used for overloaded and non-overloaded literals. We don't have a good way to represent non-overloaded literals at the moment. Maybe that doesn't matter?
Fast robust numeric integration via tanh-sinh quadrature
Version 0.1
AES encryption with optional hardware acceleration. Plus, statistically sound, splittable random number generation based on AES. This package is nothing more than a wrapper around the Intel-provided AESNI sample library which also includes a portable software implementation of AES by Brian Gladman. It contains C, assembly, and Haskell sources. And it includes prebuilt dynamic libraries to make the build process less fragile. (Rebuilding requires the yasm assembler.) But prebuilt shared libraries are not included for all platforms yet. (Volunteers needed!) Finally, note that this package is currently triggering some haddock problems. A manually built copy of the documentation can be found at: http://cs.indiana.edu/~rrnewton/intel-aes-doc/
Version 0.2.1.1
Show more results