storablevector

Fast, packed, strict storable arrays with a list interface like ByteString

http://www.haskell.org/haskellwiki/Storable_Vector

Version on this page:	0.2.13.1
LTS Haskell 20.16:	0.2.13.1@rev:1
Stackage Nightly 2023-03-27:	0.2.13.1@rev:1
Latest on Hackage:	0.2.13.1@rev:1

See all snapshots storablevector appears in

BSD-3-Clause licensed by Spencer Janssen, Henning Thielemann

Maintained by Henning Thielemann

This version can be pinned in stack with:storablevector-0.2.13.1@sha256:b5c0208f92da30e15712ec315b84a9a7096cd319cb54e39aa2ef05dc28c99782,4773

Module documentation for 0.2.13.1

Data
- Data.StorableVector

Depends on 9 packages(full list with versions):

base, deepseq, non-negative, QuickCheck, semigroups, syb, transformers, unsafe, utility-ht

Used by 3 packages in nightly-2022-09-26(full list with versions):

battleship-combinatorics, comfort-array, synthesizer-core

Fast, packed, strict storable arrays with a list interface, a chunky lazy list interface with variable chunk size and an interface for write access via the ST monad. This is much like bytestring and binary but can be used for every Foreign.Storable.Storable type. See also package http://hackage.haskell.org/package/vector with a similar intention.

We do not provide advanced fusion optimization, since especially for lazy vectors this would either be incorrect or not applicable. However we provide fusion with lazy lists in the package http://hackage.haskell.org/package/storablevector-streamfusion.