@hackage indexation dependencies

23 results

library:indexation (23 dependencies)

@haskell/vector

Efficient Arrays

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

@haskell/transformers

Concrete functor and monad transformers

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

@haskell/text

An efficient packed Unicode text type.

BSD-2-Clause>=1 && <2

@haskell/deepseq

Deep evaluation of data structures

BSD-3-Clause>=1.4.3 && <2

@haskell/bytestring

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

BSD-3-Clause>=0.10.8 && <0.11

@haskell/base

Core data structures and operations

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

@hackage/vector-th-unbox

Deriver for Data.Vector.Unboxed using Template Haskell

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

@hackage/unordered-containers

Efficient hashing-based container types

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

@hackage/stm-containers

Containers for STM

MIT>=1.1 && <1.2

@hackage/profunctors

Profunctors

BSD-3-Clause>=5.2 && <6

@hackage/potoki-cereal

Streaming serialization

MIT>=0.3.1 && <0.4

@hackage/potoki

Simple streaming in IO

MIT>=2.1.3 && <2.2

@hackage/mmorph

Monad morphisms

BSD-3-Clause>=1 && <2

@hackage/list-t

ListT done right

MIT>=1 && <1.1

@hackage/hashable

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

BSD-3-Clause>=1 && <2

@hackage/foldl

Composable, streaming, and efficient left folds

BSD-3-Clause>=1 && <2

@hackage/focus

A general abstraction for manipulating elements of container data structures

MIT>=1.0.1 && <1.1

@hackage/dense-int-set

Dense int-set

MIT>=0.3 && <0.4

@hackage/deferred-folds

Abstractions over deferred folds

MIT>=0.9.6 && <0.10

@hackage/contravariant

Contravariant functors

BSD-3-Clause>=1.4 && <2

@hackage/cereal-vector

Serialize instances for Data.Vector types.

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

@hackage/cereal

A binary serialization library

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

@hackage/bitvec

Space-efficient bit vectors

BSD-3-Clause>=0.1.0.2 && <0.2