@hackage tries dependencies

@haskell/containers

Assorted concrete container types

@haskell/bytestring

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

@haskell/base

Core data structures and operations

@hackage/unordered-containers

Efficient hashing-based container types

@hackage/sets

Ducktyped set interface for Haskell containers.

@hackage/semigroups

Anything that associates

@hackage/rose-trees

Various trie implementations in Haskell

BSD-3-Clause>=0.0.2.1

@hackage/quickcheck-instances

Common quickcheck instances

@hackage/keys

Keyed functors and containers

@hackage/hashable

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

@hackage/composition

Combinators for unorthodox function composition

@hackage/QuickCheck

Automatic testing of Haskell programs

BSD-3-Clause>=2.9.2

test:tries-test (17 dependencies)

@haskell/mtl

Monad classes for transformers, using functional dependencies

@haskell/deepseq

Deep evaluation of data structures

@haskell/containers

Assorted concrete container types

@haskell/bytestring

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

@haskell/base

Core data structures and operations

@hackage/unordered-containers

Efficient hashing-based container types

@hackage/tries

Various trie implementations in Haskell

@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.

@hackage/semigroups

Anything that associates

@hackage/rose-trees

Various trie implementations in Haskell

BSD-3-Clause>=0.0.2.1

@hackage/quickcheck-instances

Common quickcheck instances

@hackage/keys

Keyed functors and containers

@hackage/hashable

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

@hackage/composition

Combinators for unorthodox function composition

@hackage/QuickCheck

Automatic testing of Haskell programs

benchmark:tries-bench (16 dependencies)

@haskell/mtl

Monad classes for transformers, using functional dependencies

@haskell/deepseq

Deep evaluation of data structures

@haskell/containers

Assorted concrete container types

@haskell/bytestring

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

@haskell/base

Core data structures and operations

@hackage/unordered-containers

Efficient hashing-based container types

@hackage/tries

Various trie implementations in Haskell

@hackage/sets

Ducktyped set interface for Haskell containers.

@hackage/semigroups

Anything that associates

@hackage/rose-trees

Various trie implementations in Haskell

@hackage/quickcheck-instances

Common quickcheck instances

@hackage/keys

Keyed functors and containers

@hackage/hashable

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

@hackage/criterion

Robust, reliable performance measurement and analysis

@hackage/composition

Combinators for unorthodox function composition

@hackage/QuickCheck

Automatic testing of Haskell programs

BSD-3-Clause>=2.9.2

benchmark:tries-bench-lookup (16 dependencies)

@haskell/mtl

Monad classes for transformers, using functional dependencies

@haskell/deepseq

Deep evaluation of data structures

@haskell/containers

Assorted concrete container types

@haskell/bytestring

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

@haskell/base

Core data structures and operations

@hackage/unordered-containers

Efficient hashing-based container types

@hackage/tries

Various trie implementations in Haskell

@hackage/sets

Ducktyped set interface for Haskell containers.

@hackage/semigroups

Anything that associates

@hackage/rose-trees

Various trie implementations in Haskell

@hackage/quickcheck-instances

Common quickcheck instances

@hackage/keys

Keyed functors and containers

@hackage/hashable

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

@hackage/criterion

Robust, reliable performance measurement and analysis

@hackage/composition

Combinators for unorthodox function composition