vector: Efficient Arrays

[ bsd3, data, data-structures, library ] [ Propose Tags ]
Versions 0.1, 0.2, 0.3, 0.3.1, 0.4, 0.4.1, 0.4.2, 0.5, 0.6,,, 0.7,, 0.7.1, 0.8, 0.9, 0.9.1, 0.10,,,,,,,,,,,,,, (info)
Dependencies base (>=2 && <5), ghc (>=6.9), primitive (==0.1.*) [details]
License BSD-3-Clause
Copyright (c) Roman Leshchinskiy 2008-2009
Author Roman Leshchinskiy <>
Maintainer Roman Leshchinskiy <>
Category Data, Data Structures
Home page
Uploaded by RomanLeshchinskiy at Thu Dec 3 14:59:28 UTC 2009
Distributions Arch:, Debian:, Fedora:, FreeBSD:, LTSHaskell:, NixOS:, Stackage:, openSUSE:
Downloads 324888 total (505 in the last 30 days)
Rating 2.0 (votes: 1) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI

An efficient implementation of Int-indexed arrays with a powerful loop fusion framework.

It is structured as follows:

boxed vectors of arbitrary types
unboxed vectors of primitive types as defined by the primitive package
unboxed vectors of Storable types
generic interface to the vector types





Enable assertions that check parameters to functions are reasonable. These will impose a moderate performance cost on users of the library, with the benefit that you get reasonable errors rather than segmentation faults!


Use -f <flag> to enable a flag, or -f -<flag> to disable that flag. More info


Maintainer's Corner

For package maintainers and hackage trustees