homepage: http://moire.be/haskell/
changelog-type: ''
hash: 85af65341cb65bb60d6c67a2159d19a93e3417d093b2a48a941ca9d72330bfaa
test-bench-deps:
  base: ! '>=4 && <5'
  tasty-quickcheck: -any
  tasty-hunit: -any
  random: -any
  tasty: -any
  QuickCheck: ! '>=2'
  compact-word-vectors: ! '>=0.1'
  primitive: ! '>=0.7'
maintainer: bkomuves (plus) hackage (at) gmail (dot) com
synopsis: Small vectors of small integers stored very compactly.
changelog: ''
basic-deps:
  base: ! '>=4 && <5'
  primitive: ! '>=0.7'
all-versions:
- '0.1'
author: Balazs Komuves
latest: '0.1'
description-type: haddock
description: |-
  A data structure to store small vectors of small integers
  with minimal memory overhead. For example the vector
  corresponding to [1..14] only takes 16 bytes (2 machine
  words on 64 bit architectures) of heap memory.
license-name: BSD-3-Clause

Update from Hackage at 2019-11-20T15:20:54Z
Update from Hackage at 2019-11-20T15:20:54Z
