@hackage bimaps dependencies

20 results

library:bimaps (14 dependencies)

@haskell/vector

Efficient Arrays

BSD-3-Clause>=0.10 && <0.11

@haskell/primitive

Primitive memory-related operations

BSD-3-Clause>=0.5 && <0.7

@haskell/deepseq

Deep evaluation of data structures

BSD-3-Clause>=1.3 && <1.5

@haskell/containers

Assorted concrete container types

BSD-3-Clause>=0.5 && <0.6

@haskell/binary

Binary serialisation for Haskell values using lazy ByteStrings

BSD-3-Clause>=0.7 && <0.8

@haskell/base

Core data structures and operations

BSD-3-Clause>=4.7 && <4.9

@hackage/vector-th-unbox

Deriver for Data.Vector.Unboxed using Template Haskell

BSD-3-Clause>=0.2 && <0.3

@hackage/vector-binary-instances

Instances of Data.Binary for vector

BSD-3-Clause>=0.2 && <0.3

@hackage/unordered-containers

Efficient hashing-based container types

BSD-3-Clause>=0.2.5 && <0.2.6

@hackage/storable-tuple

Storable instance for pairs and triples

BSD-3-Clause==0.0.2

@hackage/hashable

A class for types that can be converted to a hash value

BSD-3-Clause>=1.2 && <1.3

@hackage/cereal

A binary serialization library

BSD-3-Clause>=0.4 && <0.5

@hackage/aeson

Fast JSON parsing and encoding

BSD-3-Clause>=0.8 && <0.9

@hackage/QuickCheck

Automatic testing of Haskell programs

BSD-3-Clause>=2.7 && <2.9

executable:BenchmarkBimaps (6 dependencies)

@haskell/vector

Efficient Arrays

BSD-3-Clause

@haskell/deepseq

Deep evaluation of data structures

BSD-3-Clause

@haskell/base

Core data structures and operations

BSD-3-Clause

@hackage/mwc-random

Fast, high quality pseudo random number generation

BSD-2-Clause>=0.13 && <0.14

@hackage/criterion

Robust, reliable performance measurement and analysis

BSD-3-Clause>=1.0.2 && <1.1.1

@hackage/bimaps

bijections with multiple implementations.

BSD-3-Clause