uvector: Fast unboxed arrays with a flexible interface

[ bsd3, data, deprecated, library ] [ Propose Tags ]
Deprecated in favor of vector

Fast unboxed arrays with a flexible interface. The library is built of fusible combinators, as described in the paper /Stream Fusion: From Lists to Streams to Nothing at All/.

For best results, compile with your user programs with -O2 -fvia-C -optc-O3.

This library is deprecated: please consider using the vector package, http://hackage.haskell.org/package/vector.

[Skip to Readme]


Automatic Flags

Compile the library with read/write bound checking enabled.


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


Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


  • No Candidates
Versions [RSS] 0.1,,,,,,,
Dependencies base (<4.3), ghc-prim [details]
License BSD-3-Clause
Author Manuel Chakravarty, Gabriele Keller, Roman Leshchinskiy, Don Stewart
Maintainer Don Stewart <dons@galois.com>
Revised Revision 1 made by HerbertValerioRiedel at 2014-12-20T11:22:15Z
Category Data
Home page http://code.haskell.org/~dons/code/uvector
Uploaded by DonaldStewart at 2010-02-15T22:28:40Z
Reverse Dependencies 12 direct, 4748 indirect [details]
Downloads 7086 total (20 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]

Readme for uvector-

[back to package description]
The uvector library is a polished up version of the basic flat, unlifted
arrays from the Data Parallel Haskell project. These arrays use
aggressive fusion optimisations, low level unboxed representations, and
a list-like interface, to provide convenient access to fast arrays in
pure Haskell.

As this is all about speed, the library is only available for GHC. 


When to fuse: don't duplicate work.