@hackage witherable dependencies

12 results

Efficient Arrays

Concrete functor and monad transformers

Assorted concrete container types

Core data structures and operations

Witherable = Traversable + Filterable

A Haskell 98 logically uninhabited data type

Efficient hashing-based container types

A small compatibility shim for the transformers library

Containers with monoidal accumulation

Lenses, Folds and Traversals

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

Backwards-compatible orphan instances for base