Data Structures

@hackage/nested-sets

Nested set model implementation

@hackage/generic-tree

Generic Tree data type

@hackage/dph-lifted-base

Data Parallel Haskell common definitions used by other dph-lifted packages.

@hackage/tie-knot

"Ties the knot" on a given set of structures that reference each other by keys.

@hackage/sdp4unordered

SDP classes for unordered containers

@haskell/array

Mutable and immutable arrays

@hackage/barbies

Classes for working with types that can change clothes.

@hackage/cmph

low level interface to CMPH

@hackage/repa-algorithms

Algorithms using the Repa array library.

@hackage/int-multimap

A data structure that associates each Int key with a set of values

@hackage/boolexpr

Boolean expressions with various representations and search queries.

@hackage/lca

O(log n) persistent online lowest common ancestor search without preprocessing

@hackage/PerfectHash

A perfect hashing library for mapping bytestrings to values.

@hackage/bit-array

A bit array (aka bitset, bitmap, bit vector) API for numeric types

@hackage/HLearn-approximation

@hackage/depq

Double-ended priority queues

@hackage/fgl

Martin Erwig's Functional Graph Library

@hackage/repa-plugin

Data Flow Fusion GHC Plugin.

@hackage/nspace

Efficient, infinite-precision 2D and 3D spatial containers.

@hackage/FenwickTree

Data structure for fast query and update of cumulative sums

@hackage/ixset

Efficient relational queries on Haskell sets.

@hackage/diffarray

DiffArray

@hackage/hkd

"higher-kinded data"

@hackage/fingertree-tf

Generic finger-tree structure using type families.

@hackage/RBTree

Pure haskell Red-Black-Tree implemetation

@hackage/pomaps

Maps and sets of partial orders

@hackage/tst

BK-tree implementation

@hackage/appendmap

Map with a Semigroup and Monoid instances delegating to Semigroup of the elements

@hackage/repa-devil

Support for image reading and writing of Repa arrays using in-place FFI calls

@hackage/suffixtree

Efficient, lazy suffix tree implementation

@hackage/bitwise-enum

Bitwise operations on bounded enumerations

@hackage/vector-stream

Efficient Streams

@hackage/I1M

Code for the Haskell course taught at the University of Seville.

@hackage/interval-tree-clock

Interval Tree Clocks

@hackage/DrIFT-cabalized

Program to derive type class instances

@hackage/EdisonCore

A library of efficient, purely-functional data structures (Core Implementations)

@hackage/multi-containers

A few multimap variants.

@hackage/path-tree

`Data.Tree` for file paths

@hackage/selections

Combinators for operating with selections over an underlying functor

@hackage/hCM

Conceptual modelling support for Haskell

@hackage/extended-containers-lens

lens instances for extended-containers

@hackage/gmap

Composable maps and generic tries.

@hackage/edit-distance-vector

Calculate edit distances and edit scripts between vectors.

@hackage/rle

A data type of run-length-encoded lists

@hackage/dph-prim-par

Data Parallel Haskell segmented arrays. (production version)

@hackage/data-forest

A simple multi-way tree data structure

@hackage/nthable

@hackage/dph-lifted-copy

Data Parallel Haskell lifted array combinators. (deprecated version)

@hackage/fingertree

Generic finger-tree structure, with example instances

@hackage/TrieMap

Automatic type inference of generalized tries with Template Haskell.

@hackage/semilattices

Semilattices

@hackage/list-tries

Tries and Patricia tries: finite sets and maps for list keys

@hackage/data-stringmap

An efficient implementation of maps from strings to arbitrary values

@hackage/hashtables-plus

Extensions for a "hashtables" library

@hackage/repa-sndfile

Reading and writing sound files with repa arrays

@hackage/text-trie

An efficient finite map from Text to values, based on bytestring-trie.

@hackage/hw-fingertree

Generic finger-tree structure, with example instances

@hackage/hw-dsv

Unbelievably fast streaming DSV file parser

@hackage/merkle-patricia-db

A modified Merkle Patricia DB

@hackage/data-lens-ixset

A Lens for IxSet

@hackage/vector-heterogenous

A type-safe library for vectors whose elements can be of any type, or any type satisfying some constraints

@hackage/treap

Efficient implementation of the implicit treap data structure

@hackage/repa-scalar

Scalar data types and conversions.

@hackage/swapper

Transparently swapping data from in-memory structures to disk

@hackage/cayley-dickson

Complex numbers, quaternions, octonions, sedenions, etc.

@hackage/HLearn-datastructures

@hackage/yarr

Yet another array library

@hackage/multimap

A multimap.

@hackage/unordered-graphs

Graph library using unordered-containers

@hackage/nested-sequence

List-like data structures with O(log(n)) random access

@hackage/monus-weighted-search

Efficient search weighted by an ordered monoid with monus.

@hackage/representable-tries

Tries from representations of polynomial functors

@hackage/spool

Convert between ByteString and Vector.Storable without copying

@hackage/hw-rankselect-base

Rank-select base

@hackage/comfort-array

Arrays where the index type is a function of the shape type

@hackage/ethereum-rlp

Ethereum Recursive Length Prefix Encoding

@hackage/dawg

Directed acyclic word graphs

@hackage/knead

Repa-like array processing using LLVM JIT

@hackage/range-set-list

Memory efficient sets with ranges of elements.

@hackage/impure-containers

Mutable containers in Haskell.

@hackage/rational-list

finite or repeating lists

@hackage/ctrie

Non-blocking concurrent map

@hackage/relation

A data structure representing Relations on Sets.

@hackage/build

Build Systems à la Carte

@hackage/HoleyMonoid

Monoids with holes.

@hackage/collections-api

API for collection data structures.

@hackage/psqueues

Pure priority search queues

@hackage/symantic-cli

Symantics for parsing and documenting a CLI

@hackage/adjunctions

Adjunctions and representable functors

@hackage/massiv-serialise

Compatibility of 'massiv' with 'serialise'

@hackage/exposed-containers

A distribution of the 'containers' package, with all modules exposed.

@hackage/InternedData

Data interning (with compact regions where possible)

@hackage/dph-base

Data Parallel Haskell common config and debugging functions.

@hackage/strict-containers-lens

Strict containers - Lens instances

@hackage/suffix-array

Simple and moderately efficient suffix array implementation

@hackage/HMap

Fast heterogeneous maps and unconstrained typeable-like functionality.

@hackage/sdp4text

SDP wrapper for Text.

@hackage/ADPfusion

Efficient, high-level dynamic programming.

@hackage/EnumMap

More general IntMap replacement.

@hackage/perfecthash

A perfect hashing library for mapping bytestrings to values.

@hackage/monadic-arrays

Boxed and unboxed arrays for monad transformers

@hackage/AlignmentAlgorithms

Collection of alignment algorithms

@hackage/atomic-counter

Mutable counters that can be modified with atomic operatinos

@hackage/q4c12-twofinger

Efficient alternating finger trees

@hackage/nibblestring

Packed, strict nibble arrays with a list interface (ByteString for nibbles)

@hackage/miso-examples

A tasty Haskell front-end framework

@hackage/enummaps

Enum wrappers for IntMap and IntSet

@hackage/PSQueue

Priority Search Queue

@hackage/hobbits

A library for canonically representing terms with binding

@hackage/row-types-aeson

aeson instances for Open Records and Variants

@hackage/vector-mmap

Memory map immutable and mutable vectors

@hackage/javelin

Labeled one-dimensional arrays

@hackage/megastore

Bulk image or strict bytestring storage

@hackage/random-tree

Create random trees

@hackage/radix-tree

Radix trees

@hackage/heap

Heaps in Haskell

@hackage/representable-functors

Representable functors

@hackage/sequence

A type class for sequences and various sequence data structures.

@hackage/Stack

Stack data structure

@hackage/enummapset

IntMap and IntSet with Enum keys/elements.

@hackage/symantic-xml

Library for reading, validating and writing XML.

@hackage/dequeue

A typeclass and an implementation for double-ended queues.

@hackage/container-classes

Generic classes for interacting with different container types

@hackage/SuffixStructures

Suffix array construction

@hackage/listlike-instances

Extra instances of the ListLike class

@hackage/igraph

Bindings to the igraph C library.

@hackage/grids

@hackage/containers-good-graph

Data.Graph, but it doesn't suck!

@hackage/thrist

Type-threaded list

@hackage/graphs

A simple monadic graph library

@hackage/graph-wrapper

A wrapper around the standard Data.Graph with a less awkward interface

@hackage/stm-containers

Containers for STM

@hackage/ralist

Random access list with a list compatible interface.

@hackage/ethereum-merkle-patricia-db

A modified Merkle Patricia DB

@hackage/type-aligned

Various type-aligned sequence data structures.

@hackage/semigroups-actions

Semigroups actions

@hackage/hamtmap

A purely functional and persistent hash map

@hackage/expiring-containers

Expiring containers

@hackage/map-exts

Extensions to Data.Map

@hackage/functor-friends

Friendly helpers for your recursion schemes.

@cardano/diff-containers

Diffs for containers

@hackage/decision-diagrams

Binary Decision Diagrams (BDD) and Zero-suppressed Binary Decision Diagrams (ZDD)

@hackage/dph-prim-seq

Data Parallel Haskell segmented arrays. (sequential implementation)

@hackage/pangraph

A set of parsers for graph languages and conversions to graph libaries.

@hackage/dph-seq

(deprecated)

@hackage/repa-bytestring

(deprecated)

@hackage/row-types-barbies

barbies instances for Open Records and Variants

@hackage/bk-tree

BK-tree implementation

@hackage/ixset-typed

Efficient relational queries on Haskell sets.

@hackage/focus

A general abstraction for manipulating elements of container data structures

@hackage/vp-tree

Vantage Point Trees

@hackage/hw-excess

Excess

@hackage/ixset-typed-conversions

Conversions from ixset-typed to other containers.

@hackage/indexed-containers

Simple, no-frills indexed lists.

@hackage/vector-rotcev

Vectors with O(1) reverse

@hackage/stm-hamt

STM-specialised Hash Array Mapped Trie

@hackage/repa-flow

Data-parallel data flows.

@hackage/lapack

Numerical Linear Algebra using LAPACK

@hackage/KdTree

KdTree, for efficient search in K-dimensional point clouds.

@hackage/javelin-io

IO operations for the `javelin` package

@hackage/composite-xstep

ReaderT transformer pattern for higher kinded composite data.

@hackage/reflection-without-remorse

Efficient free and operational monads.

@hackage/sparsebit

Sparse bitmaps for pattern match coverage

@hackage/vector-read-instances

(deprecated) Read instances for 'Data.Vector'

@hackage/DrIFT

Program to derive type class instances

@hackage/bookkeeper-permissions

Permissions for bookkeeper records

@hackage/splay

Generic splay-based sequence representation

@hackage/adp-multi

ADP for multiple context-free languages

@hackage/localization

Library for localization (l10n)

@hackage/ADPfusionSet

Dynamic programming for Set data structures.

@hackage/record

Anonymous records

@hackage/vary

Vary: Friendly and fast polymorphic variants (open unions/coproducts/extensible sums)

@hackage/composite-tuple

Tuple functions for composite records.

@hackage/rstream

stream-fusion framework from vector

@hackage/sirkel

Sirkel, a Chord DHT

@hackage/type-level-sets

Type-level sets and finite maps (with value-level counterparts)

@hackage/function-builder

Create poly variadic functions for monoidal results

@cardano/fingertree-rm

Finger-trees with root measures

@hackage/BiobaseTypes

Collection of types for bioinformatics

@hackage/semigroups

Anything that associates

@hackage/strict-containers

Strict containers.

@hackage/dawg-ord

Directed acyclic word graphs

@hackage/btree-concurrent

A backend agnostic, concurrent BTree

@hackage/rp-tree

Random projection trees

@hackage/trial-tomland

Trial helper functions for tomland

@hackage/repa-examples

Examples using the Repa array library.

@hackage/map-syntax

Syntax sugar for defining maps

@hackage/void

A Haskell 98 logically uninhabited data type

@hackage/array-utils

Primitive functions for updating many elements in mutable arrays at once

@hackage/interval-patterns

Intervals, and monoids thereof

@hackage/enummapmap

Map of maps using Enum types as keys

@hackage/sdp

Simple Data Processing

@hackage/ixset-typed-binary-instance

Binary instance for ixset-typed.

@hackage/more-containers

A few more collections

@hackage/type-indexed-queues

Queues with verified and unverified versions.

@hackage/sdp-io

SDP IO extension

@hackage/pqueue

Reliable, persistent, fast priority queues.

@hackage/int-like

Newtype wrappers over IntSet and IntMap

@hackage/bitwise

fast multi-dimensional unboxed bit packed Bool arrays

@hackage/haggle

A graph library offering mutable, immutable, and inductive graphs

@hackage/algebraic-graphs

A library for algebraic graph construction and transformation

@hackage/bookkeeper

Anonymous records and overloaded labels

@hackage/sdp4vector

SDP wrapper for Vector

@hackage/adp-multi-monadiccp

Subword construction in adp-multi using monadiccp

@hackage/repa-stream

Stream functions not present in the vector library.

@hackage/disjoint-sets-st

Imperative ST/IO based disjoint set data structure.

@hackage/loc

Line and column positions and ranges in text files

@hackage/intset-imperative

An imperative integer set written in Haskell.

@hackage/rbst

Randomized Binary Search Trees

@hackage/labeled-tree

Labeled tree structure

@hackage/fingertree-psqueue

Implementation of priority search queues as finger trees.

@hackage/sdp4bytestring

SDP wrapper for ByteString.

@hackage/dph-par

(deprecated)

@hackage/naperian

Efficient representable functors

@hackage/sparse-merkle-trees

Sparse Merkle trees with proofs of inclusion and exclusion

@hackage/bktrees

A set data structure with approximate searching

@hackage/type-level-bst

type-level binary search trees in haskell

@hackage/relacion

A relation data structure.

@hackage/keys

Keyed functors and containers

@hackage/CTRex

Open records using closed type families.

@hackage/comfort-array-shape

Additional shape types for the comfort-array package

@hackage/hw-fingertree-strict

Generic strict finger-tree structure

@hackage/total-maps

Dense and sparse total maps.

@hackage/slist

Sized list

@hackage/collections-base-instances

Useful standard collections types and related functions.

@hackage/hw-eliasfano

Elias-Fano

@hackage/intern

Efficient hash-consing for arbitrary data types

@hackage/statethread

The ST monad and STRefs

@hackage/hmatrix-mmap

Memory map Vector from disk into memory efficiently

@hackage/monoidmap

Monoidal map type

@hackage/ethereum-client-haskell

A Haskell version of an Ethereum client

@hackage/dph-prim-interface

Data Parallel Haskell segmented arrays. (abstract interface)

@hackage/bcp47

Language tags as specified by BCP 47

@hackage/linked-list-with-iterator

A pure linked list which is mutable through iterators.

@hackage/bag

A simple stable bag.

@hackage/miso

A tasty Haskell front-end framework

@hackage/sdp-hashable

Hashable instances for SDP

@hackage/magma

magma is an algebraic structure.

@hackage/typerep-map

Efficient implementation of a dependent map with types as keys

@hackage/treeseq

Library for a multi-way tree (rose tree), using Seq (finger tree) for forests

@hackage/hetero-map

Pure heterogeneous maps.

@hackage/mono-traversable-keys

Type-classes for interacting with monomorphic containers with a key

@hackage/ixset-typed-hashable-instance

Hashable instance for ixset-typed.

@hackage/vector-instances

Orphan Instances for 'Data.Vector'

@hackage/knit

Ties the knot on data structures that reference each other by unique keys.

@hackage/distributive

Distributive functors -- Dual to Traversable

@hackage/barbies-th

Create strippable HKD via TH

@hackage/collections

Useful standard collections types and related functions.

@hackage/hw-xml

XML parser based on succinct data structures.

@hackage/randproc

Data structures and support functions for working with random processes

@hackage/seqn

Sequences and measured sequences

@hackage/srtree

A general framework to work with Symbolic Regression expression trees.

@hackage/symbolize

Efficient global Symbol table, with Garbage Collection.

@hackage/gtk-largeTreeStore

Large TreeStore support for gtk2hs

@hackage/day-comonoid

A comonoid w.r.t. Day

@hackage/rosezipper

Generic zipper implementation for Data.Tree

@hackage/sdp-deepseq

DeepSeq SDP extension.

@hackage/vector-functorlazy

vectors that perform the fmap operation in constant time

@hackage/cybus

multi-dimensional arrays

@hackage/interval

Intervals with adherences.

@hackage/overeasy

A purely functional E-Graph library

@hackage/unsafeperformst

Like unsafeperformIO, but for the ST monad.

@hackage/rrb-vector

Efficient RRB-Vectors

@hackage/trie-simple

Simple Map-based Trie

@hackage/subwordgraph

Subword graph implementation

@hackage/extended-containers

Heap and Vector container types

@hackage/strict-containers-serialise

Strict containers - Serialise instances

@hackage/text-compression

A text compression library.

@hackage/pedestrian-dag

A pedestrian implementation of directed acyclic graphs

@hackage/fgl-extras-decompositions

Graph decomposition algorithms

@hackage/massiv-persist

Compatibility of 'massiv' with 'persist'

@hackage/GiST

A Haskell implementation of a Generalized Search Tree (GiST)

@hackage/EdisonAPI

A library of efficient, purely-functional data structures (API)

@hackage/tangle

Heterogenous memoisation monad

@hackage/min-max-pqueue

Double-ended priority queues.

@hackage/TreeStructures

A collection of heaps and search trees

@hackage/nonempty-containers

Non-empty variants of containers data types, with full API

@hackage/vector-clock

Vector clocks for versioning message flows

@haskell/containers

Assorted concrete container types

@hackage/random-access-list

Random-access lists in Haskell

@hackage/dph-examples

Data Parallel Haskell example programs.

@hackage/data-vector-growable

Dynamic growable resizable mutable generic vector

@hackage/nonempty-zipper

A non-empty comonadic list zipper

@hackage/AvlTree

Balanced binary trees using the AVL algorithm.

@hackage/graphite

Graphs and networks library

@hackage/perfect-hash-generator

Perfect minimal hashing implementation in native Haskell

@hackage/circular

Circular fixed-sized mutable vectors

@hackage/heaps

Asymptotically optimal Brodal/Okasaki heaps.

@hackage/sdp-quickcheck

SDP QuickCheck support

@hackage/hw-rankselect

Rank-select

@hackage/repa-array

Bulk array representations and operators.

@hackage/trial

Trial Data Structure

@hackage/bitset

A space-efficient set data structure.

@hackage/repa-series

Series Expressionss API

@hackage/unboxing-vector

A newtype-friendly variant of unboxed vectors

@hackage/justified-containers

Keyed container types with type-checked proofs of key presence.

@hackage/multiset

The Data.MultiSet container type

@hackage/iterable

API for hierarchical multilevel collections.

@hackage/row-types

Open Records and Variants

@hackage/meldable-heap

Asymptotically optimal, Coq-verified meldable heaps, AKA priority queues

@haskell/vector

Efficient Arrays

@hackage/bytestring-trie

An efficient finite map from bytestrings to values.

@hackage/vector-endian

Storable vectors with cpu-independent representation.

@hackage/repa-convert

Packing and unpacking flat tables.

@hackage/primitive-containers

containers backed by arrays

@hackage/bytestring-to-vector

Convert between ByteString and Vector.Storable without copying

@hackage/signed-multiset

Multisets with negative membership.

@hackage/translatable-intset

Integer sets with a constant time translate operation.

@hackage/vector-static

Statically checked sizes on Data.Vector

@hackage/hw-json-lens

Lens for hw-json

@hackage/repa-fftw

Perform fft with repa via FFTW

@hackage/quickset

Very fast and memory-compact query-only set and map structures

@hackage/graph-utils

A simple wrapper & quasi quoter for fgl.

@hackage/repa

High performance, regular, shape polymorphic parallel arrays.

@hackage/data-clist

Simple functional ring type.

@hackage/subzero

Helps when going "seed values" -> alternatives and optional -> answers

@hackage/TernaryTrees

Efficient pure ternary tree Sets and Maps

@hackage/data-r-tree

R-Tree is a spatial data structure similar to Quadtrees or B-Trees.

@hackage/repa-eval

Low-level parallel operators on bulk random-accessble arrays.

@hackage/flux-monoid

A monoid for tracking changes

@hackage/stable-heap

Purely functional stable heaps (fair priority queues)

@hackage/text-containers

Memory-efficient string-indexed container types.

@hackage/hw-balancedparens

Balanced parentheses

@hackage/libgraph

Store and manipulate data in a graph.

@hackage/list-t

ListT done right

@hackage/kan-extensions

Kan extensions, Kan lifts, the Yoneda lemma, and (co)density (co)monads

@hackage/event-list

Event lists with relative or absolute time stamps

@hackage/massiv

Massiv (Массив) is an Array Library.

@hackage/sdp-binary

Binary instances for SDP

@hackage/treemap

A tree of Data.Map.

@hackage/symantic-base

Basic symantic combinators for Embedded Domain-Specific Languages (EDSL)

@hackage/graph-matchings

An implementation of algorithms for matchings in graphs

@hackage/semirings

two monoids as one, in holy haskimony

@hackage/vector-split

Combinator library for splitting vectors.

@hackage/massiv-test

Library that contains generators, properties and tests for Massiv Array Library.

@hackage/dph-lifted-vseg

Data Parallel Haskell lifted array combinators.

@hackage/data-functor-logistic

Updatable analogue of Distributive functors

@hackage/Etage-Graph

Data-flow based graph algorithms

@hackage/static-hash

Immutable hash

@hackage/permutation

A library for permutations and combinations.

@hackage/massiv-io

Import/export of Image files into massiv Arrays

@hackage/nonemptymap

A NonEmptyMap Implementation

@hackage/repa-io

Read and write Repa arrays in various formats.

@hackage/labeled-graph

Labeled graph structure

@hackage/parameterized-utils

Classes and data structures for working with data-kind indexed types