homepage: https://github.com/bkomuves/compact-word-vectors
changelog-type: ''
hash: e46c7c3186dafe1ae22434556ddec91af022f2360c57c30a46397758938f3acc
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'
- 0.2.0.1
- 0.2.0.2
author: Balazs Komuves
latest: 0.2.0.2
description-type: haddock
description: |-
  A data structure to store small vectors of small integers
  with minimal memory overhead. For example the (word) vector
  corresponding to [1..14] only takes 16 bytes (2 machine
  words on 64 bit architectures) of heap memory.
  See the module "Data.Vector.Compact.WordVec" for more
  details.
license-name: BSD-3-Clause

homepage: https://github.com/bkomuves/compact-word-vectors
changelog-type: ''
hash: 49cf00f224000f149306e7043c228fa33e3dba87f10589e8326388c3278ba594
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.8 && <5'
  primitive: '>=0.7'
all-versions:
- '0.1'
- 0.2.0.1
- 0.2.0.2
author: Balazs Komuves
latest: 0.2.0.2
description-type: haddock
description: |-
  A data structure to store small vectors of small integers
  with minimal memory overhead. For example the (word) vector
  corresponding to [1..14] only takes 16 bytes (2 machine
  words on 64 bit architectures) of heap memory.
  See the module "Data.Vector.Compact.WordVec" for more
  details.
license-name: BSD-3-Clause

Update from Hackage at 2022-09-04T18:12:27Z
Update from Hackage at 2022-09-04T18:12:27Z
