@hackage arithmoi dependencies

52 results

library:arithmoi (16 dependencies)

@haskell/vector

Efficient Arrays

BSD-3-Clause>=0.12 && <0.14

@haskell/transformers

Concrete functor and monad transformers

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

@haskell/random

Pseudo-random number generation

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

@haskell/ghc-bignum

GHC BigNum library

BSD-3-Clause<1.4

@haskell/deepseq

Deep evaluation of data structures

BSD-3-Clause<1.6

@haskell/containers

Assorted concrete container types

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

@haskell/base

Basic libraries

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

@haskell/array

Mutable and immutable arrays

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

@hackage/semirings

two monoids as one, in holy haskimony

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

@hackage/mod

Fast type-safe modular arithmetic

MIT<0.3

@hackage/integer-roots

Integer roots and perfect powers

MIT>=1.0 && <1.1

@hackage/integer-logarithms

Integer logarithms.

MIT>=1.0 && <1.1

@hackage/infinite-list

Infinite lists

BSD-3-Clause<0.2

@hackage/exact-pi

Exact rational multiples of pi (and integer powers of pi)

MIT>=0.5 && <0.6

@hackage/constraints

Constraint manipulation

BSD-2-Clause<0.14

@hackage/chimera

Lazy infinite streams with O(1) indexing and applications for memoization

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

test:arithmoi-tests (19 dependencies)

@haskell/vector

Efficient Arrays

BSD-3-Clause

@haskell/transformers

Concrete functor and monad transformers

BSD-3-Clause>=0.5

@haskell/random

Pseudo-random number generation

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

@haskell/containers

Assorted concrete container types

BSD-3-Clause

@haskell/base

Basic libraries

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

@hackage/tasty-smallcheck

SmallCheck support for the Tasty test framework.

MIT>=0.8 && <0.9

@hackage/tasty-rerun

Rerun only tests which failed in a previous test run

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

@hackage/tasty-quickcheck

QuickCheck support for the Tasty test framework.

MIT>=0.9 && <0.11

@hackage/tasty-hunit

HUnit support for the Tasty test framework.

MIT>=0.9 && <0.11

@hackage/tasty

Modern and extensible testing framework

MIT>=0.10 && <1.5

@hackage/smallcheck

A property-based testing library

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

@hackage/semirings

two monoids as one, in holy haskimony

BSD-3-Clause>=0.2

@hackage/quickcheck-classes

QuickCheck common typeclasses

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

@hackage/mod

Fast type-safe modular arithmetic

MIT

@hackage/integer-roots

Integer roots and perfect powers

MIT>=1.0

@hackage/infinite-list

Infinite lists

BSD-3-Clause

@hackage/exact-pi

Exact rational multiples of pi (and integer powers of pi)

MIT>=0.4.1.1

@hackage/arithmoi

Efficient basic number-theoretic functions.

MIT

@hackage/QuickCheck

Automatic testing of Haskell programs

BSD-3-Clause>=2.10 && <2.15

benchmark:arithmoi-bench (13 dependencies)

@haskell/vector

Efficient Arrays

BSD-3-Clause

@haskell/random

Pseudo-random number generation

BSD-3-Clause

@haskell/deepseq

Deep evaluation of data structures

BSD-3-Clause

@haskell/containers

Assorted concrete container types

BSD-3-Clause

@haskell/base

Basic libraries

BSD-3-Clause

@haskell/array

Mutable and immutable arrays

BSD-3-Clause

@hackage/tasty-bench

Featherlight benchmark framework

MIT<0.4

@hackage/semirings

two monoids as one, in holy haskimony

BSD-3-Clause

@hackage/mod

Fast type-safe modular arithmetic

MIT

@hackage/integer-logarithms

Integer logarithms.

MIT

@hackage/infinite-list

Infinite lists

BSD-3-Clause

@hackage/constraints

Constraint manipulation

BSD-2-Clause

@hackage/arithmoi

Efficient basic number-theoretic functions.

MIT

benchmark:arithmoi-sequence-model (4 dependencies)

@haskell/containers

Assorted concrete container types

BSD-3-Clause

@haskell/base

Basic libraries

BSD-3-Clause

@hackage/hmatrix-gsl

Numerical computation

GPL-3.0-only

@hackage/arithmoi

Efficient basic number-theoretic functions.

MIT