@hackage pairing dependencies

50 results

library:pairing (13 dependencies)

@haskell/random

Pseudo-random number generation

BSD-3-Clause

@haskell/bytestring

Fast, compact, strict and lazy byte strings with a list interface

BSD-3-Clause

@haskell/binary

Binary serialisation for Haskell values using lazy ByteStrings

BSD-3-Clause

@haskell/base

Core data structures and operations

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

@hackage/wl-pprint-text

A Wadler/Leijen Pretty Printer for Text values

BSD-3-Clause

@hackage/protolude

A small prelude.

MIT>=0.2

@hackage/memory

memory and related abstraction stuff

BSD-3-Clause

@hackage/integer-logarithms

Integer logarithms.

MIT

@hackage/galois-field

Galois field library

MIT==0.4.0

@hackage/errors

Simplified error-handling

BSD-3-Clause

@hackage/arithmoi

Efficient basic number-theoretic functions.

MIT>=0.8 && <0.10

@hackage/QuickCheck

Automatic testing of Haskell programs

BSD-3-Clause

@hackage/MonadRandom

Random-number generation monad.

BSD-3-Clause

test:pairing-tests (19 dependencies)

@haskell/random

Pseudo-random number generation

BSD-3-Clause

@haskell/bytestring

Fast, compact, strict and lazy byte strings with a list interface

BSD-3-Clause

@haskell/binary

Binary serialisation for Haskell values using lazy ByteStrings

BSD-3-Clause

@haskell/base

Core data structures and operations

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

@hackage/wl-pprint-text

A Wadler/Leijen Pretty Printer for Text values

BSD-3-Clause

@hackage/tasty-quickcheck

QuickCheck support for the Tasty test framework.

MIT

@hackage/tasty-hunit

HUnit support for the Tasty test framework.

MIT

@hackage/tasty-discover

Test discovery for the tasty framework.

MIT

@hackage/tasty

Modern and extensible testing framework

MIT

@hackage/quickcheck-instances

Common quickcheck instances

BSD-3-Clause

@hackage/protolude

A small prelude.

MIT>=0.2

@hackage/memory

memory and related abstraction stuff

BSD-3-Clause

@hackage/integer-logarithms

Integer logarithms.

MIT

@hackage/hexstring

Fast and safe representation of a hex string

MIT

@hackage/galois-field

Galois field library

MIT==0.4.0

@hackage/errors

Simplified error-handling

BSD-3-Clause

@hackage/arithmoi

Efficient basic number-theoretic functions.

MIT>=0.8

@hackage/QuickCheck

Automatic testing of Haskell programs

BSD-3-Clause

@hackage/MonadRandom

Random-number generation monad.

BSD-3-Clause

benchmark:pairing-benchmarks (18 dependencies)

@haskell/random

Pseudo-random number generation

BSD-3-Clause

@haskell/bytestring

Fast, compact, strict and lazy byte strings with a list interface

BSD-3-Clause

@haskell/binary

Binary serialisation for Haskell values using lazy ByteStrings

BSD-3-Clause

@haskell/base

Core data structures and operations

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

@hackage/wl-pprint-text

A Wadler/Leijen Pretty Printer for Text values

BSD-3-Clause

@hackage/tasty-quickcheck

QuickCheck support for the Tasty test framework.

MIT

@hackage/tasty-hunit

HUnit support for the Tasty test framework.

MIT

@hackage/tasty

Modern and extensible testing framework

MIT

@hackage/quickcheck-instances

Common quickcheck instances

BSD-3-Clause

@hackage/protolude

A small prelude.

MIT>=0.2

@hackage/memory

memory and related abstraction stuff

BSD-3-Clause

@hackage/integer-logarithms

Integer logarithms.

MIT

@hackage/galois-field

Galois field library

MIT==0.4.0

@hackage/errors

Simplified error-handling

BSD-3-Clause

@hackage/criterion

Robust, reliable performance measurement and analysis

BSD-3-Clause

@hackage/arithmoi

Efficient basic number-theoretic functions.

MIT>=0.8

@hackage/QuickCheck

Automatic testing of Haskell programs

BSD-3-Clause

@hackage/MonadRandom

Random-number generation monad.

BSD-3-Clause