@hackage tries dependencies

70 results

library:tries (15 dependencies)

@haskell/deepseq

Deep evaluation of data structures

BSD-3-Clause

@haskell/containers

Assorted concrete container types

BSD-3-Clause

@haskell/bytestring

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

BSD-3-Clause

@haskell/base

Core data structures and operations

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

@hackage/unordered-containers

Efficient hashing-based container types

BSD-3-Clause

@hackage/sets

Ducktyped set interface for Haskell containers.

BSD-3-Clause>=0.0.5

@hackage/semigroups

Anything that associates

BSD-3-Clause

@hackage/rose-trees

Various trie implementations in Haskell

BSD-3-Clause>=0.0.2.1

@hackage/quickcheck-instances

Common quickcheck instances

BSD-3-Clause

@hackage/keys

Keyed functors and containers

BSD-3-Clause

@hackage/hashable

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

BSD-3-Clause

@hackage/composition-extra

Combinators for unorthodox structure composition

BSD-3-Clause>=2.0.0

@hackage/composition

Combinators for unorthodox function composition

BSD-3-Clause

@hackage/bytestring-trie

An efficient finite map from bytestrings to values.

BSD-3-Clause

@hackage/QuickCheck

Automatic testing of Haskell programs

BSD-3-Clause

test:test (19 dependencies)

@haskell/mtl

Monad classes for transformers, using functional dependencies

BSD-3-Clause

@haskell/deepseq

Deep evaluation of data structures

BSD-3-Clause

@haskell/containers

Assorted concrete container types

BSD-3-Clause

@haskell/bytestring

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

BSD-3-Clause

@haskell/base

Core data structures and operations

BSD-3-Clause

@hackage/unordered-containers

Efficient hashing-based container types

BSD-3-Clause

@hackage/tries

Various trie implementations in Haskell

BSD-3-Clause

@hackage/tasty-quickcheck

QuickCheck support for the Tasty test framework.

MIT

@hackage/tasty

Modern and extensible testing framework

MIT

@hackage/sets

Ducktyped set interface for Haskell containers.

BSD-3-Clause

@hackage/semigroups

Anything that associates

BSD-3-Clause

@hackage/rose-trees

Various trie implementations in Haskell

BSD-3-Clause

@hackage/quickcheck-instances

Common quickcheck instances

BSD-3-Clause

@hackage/keys

Keyed functors and containers

BSD-3-Clause

@hackage/hashable

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

BSD-3-Clause

@hackage/composition-extra

Combinators for unorthodox structure composition

BSD-3-Clause

@hackage/composition

Combinators for unorthodox function composition

BSD-3-Clause

@hackage/bytestring-trie

An efficient finite map from bytestrings to values.

BSD-3-Clause

@hackage/QuickCheck

Automatic testing of Haskell programs

BSD-3-Clause

benchmark:bench (18 dependencies)

@haskell/mtl

Monad classes for transformers, using functional dependencies

BSD-3-Clause

@haskell/deepseq

Deep evaluation of data structures

BSD-3-Clause

@haskell/containers

Assorted concrete container types

BSD-3-Clause

@haskell/bytestring

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

BSD-3-Clause

@haskell/base

Core data structures and operations

BSD-3-Clause

@hackage/unordered-containers

Efficient hashing-based container types

BSD-3-Clause

@hackage/tries

Various trie implementations in Haskell

BSD-3-Clause

@hackage/sets

Ducktyped set interface for Haskell containers.

BSD-3-Clause

@hackage/semigroups

Anything that associates

BSD-3-Clause

@hackage/rose-trees

Various trie implementations in Haskell

BSD-3-Clause

@hackage/quickcheck-instances

Common quickcheck instances

BSD-3-Clause

@hackage/keys

Keyed functors and containers

BSD-3-Clause

@hackage/hashable

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

BSD-3-Clause

@hackage/criterion

Robust, reliable performance measurement and analysis

BSD-3-Clause

@hackage/composition-extra

Combinators for unorthodox structure composition

BSD-3-Clause

@hackage/composition

Combinators for unorthodox function composition

BSD-3-Clause

@hackage/bytestring-trie

An efficient finite map from bytestrings to values.

BSD-3-Clause

@hackage/QuickCheck

Automatic testing of Haskell programs

BSD-3-Clause

benchmark:bench-lookup (18 dependencies)

@haskell/mtl

Monad classes for transformers, using functional dependencies

BSD-3-Clause

@haskell/deepseq

Deep evaluation of data structures

BSD-3-Clause

@haskell/containers

Assorted concrete container types

BSD-3-Clause

@haskell/bytestring

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

BSD-3-Clause

@haskell/base

Core data structures and operations

BSD-3-Clause

@hackage/unordered-containers

Efficient hashing-based container types

BSD-3-Clause

@hackage/tries

Various trie implementations in Haskell

BSD-3-Clause

@hackage/sets

Ducktyped set interface for Haskell containers.

BSD-3-Clause

@hackage/semigroups

Anything that associates

BSD-3-Clause

@hackage/rose-trees

Various trie implementations in Haskell

BSD-3-Clause

@hackage/quickcheck-instances

Common quickcheck instances

BSD-3-Clause

@hackage/keys

Keyed functors and containers

BSD-3-Clause

@hackage/hashable

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

BSD-3-Clause

@hackage/criterion

Robust, reliable performance measurement and analysis

BSD-3-Clause

@hackage/composition-extra

Combinators for unorthodox structure composition

BSD-3-Clause

@hackage/composition

Combinators for unorthodox function composition

BSD-3-Clause

@hackage/bytestring-trie

An efficient finite map from bytestrings to values.

BSD-3-Clause

@hackage/QuickCheck

Automatic testing of Haskell programs

BSD-3-Clause