ADPfusion | 43 | 0.0 | Efficient, high-level dynamic programming. | (algorithms, bioinformatics, bsd3, data-structures, formal-languages, library) | ChristianHoener |

ADPfusionSet | 4 | 0.0 | Dynamic programming for Set data structures. | (algorithms, bioinformatics, bsd3, data-structures, formal-languages, library) | ChristianHoener |

AlignmentAlgorithms | 12 | 0.0 | Collection of alignment algorithms | (algorithms, bioinformatics, data-structures, gpl, library, linguistics) | ChristianHoener |

AvlTree | 22 | 0.0 | Balanced binary trees using the AVL algorithm. | (bsd3, data-structures, library) | AdrianHey |

BiobaseTypes | 20 | 0.0 | Collection of types for bioinformatics | (bioinformatics, bsd3, data-structures, library) | ChristianHoener |

CTRex | 5 | 0.0 | Open records using closed type families. | (bsd3, data, data-structures, library) | AtzeVanDerPloeg |

DrIFT | 17 | 0.0 | Program to derive type class instances | (bsd3, data-structures, library, program) | KiwamuOkabe |

DrIFT-cabalized (deprecated in favor of DrIFT) | 9 | 0.0 | Program to derive type class instances | (bsd3, data-structures, deprecated, program) | GwernBranwen, KiwamuOkabe |

EdisonAPI | 132 | 0.0 | A library of efficient, purely-functional data structures (API) | (data-structures, library, mit) | RobertDockins |

EdisonCore | 140 | 0.0 | A library of efficent, purely-functional data structures (Core Implementations) | (data-structures, library) | RobertDockins |

EnumMap | 4 | 0.0 | More general IntMap replacement. | (bsd3, data-structures, library) | JohnVanEnk |

Etage-Graph | 11 | 0.0 | Data-flow based graph algorithms | (data-structures, lgpl, library, program) | MitarMilutinovic |

FenwickTree | 7 | 0.0 | Data structure for fast query and update of cumulative sums | (bsd3, data-structures, library) | MichalGajda |

GiST | 2 | 0.0 | A Haskell implementation of a Generalized Search Tree (GiST) | (data-structures, gpl, library) | MihailBogojeski |

HLearn-approximation (deprecated) | 3 | 0.0 | | (bsd3, data-mining, data-structures, deprecated, library, machine-learning) | MikeIzbicki |

HLearn-datastructures (deprecated) | 3 | 0.0 | | (bsd3, data-mining, data-structures, deprecated, library, machine-learning) | MikeIzbicki |

HMap | 33 | 0.0 | Fast heterogeneous maps and unconstrained typeable like functionality. | (bsd3, data, data-structures, library) | AtzeVanDerPloeg |

HoleyMonoid | 7 | 0.0 | Monoids with holes. | (bsd3, data-structures, library) | MartijnVanSteenbergen |

PSQueue | 15 | 0.0 | Priority Search Queue | (bsd3, data-structures, library) | ScottDillard |

PerfectHash | 18 | 0.0 | A perfect hashing library for mapping bytestrings to values. | (bsd3, data, data-structures, library) | MarkWotton |

RBTree | 15 | 0.0 | Pure haskell Red-Black-Tree implemetation | (bsd3, data-structures, library) | XingboWu |

Stack | 12 | 2.25 | Stack data structure | (bsd3, data-structures, library) | rwlock |

SuffixStructures | 2 | 0.0 | Suffix array construction | (benchmark, bsd3, data, data-structures, library, program) | ChristianHoener |

TernaryTrees | 36 | 0.0 | Efficient pure ternary tree Sets and Maps | (bsd3, data-structures, library, program) | AlexMason |

TreeStructures | 7 | 0.0 | A collection of heaps and search trees | (bsd3, data-structures, library) | BrendanHickey |

adjunctions | 950 | 2.25 | Adjunctions and representable functors | (adjunctions, bsd3, data-structures, library) | EdwardKmett |

adp-multi | 6 | 0.0 | ADP for multiple context-free languages | (algorithms, bioinformatics, bsd3, data-structures, library) | MaikRiechert |

adp-multi-monadiccp | 6 | 0.0 | Subword construction in adp-multi using monadiccp | (algorithms, bioinformatics, bsd3, data-structures, library) | MaikRiechert |

algebraic-graphs | 14 | 2.5 | A library for algebraic graph construction and transformation | (algebra, algorithms, benchmark, data-structures, graphs, library, mit) | snowleopard |

array | 417 | 2.0 | Mutable and immutable arrays | (bsd3, data-structures, library) | AustinSeipp, HerbertValerioRiedel, IanLynagh |

array-utils (deprecated) | 16 | 0.0 | Primitive functions for updating many elements in mutable arrays at once | (bsd3, data, data-structures, deprecated, library) | AlexMason |

bag (deprecated in favor of dlist) | 3 | 0.0 | A simple stable bag. | (data-structures, deprecated, library, mit) | DanielWaterworth |

bit-array | 4 | 0.0 | A bit array (aka bitset, bitmap, bit vector) API for numeric types | (bit-vectors, data-structures, library, mit, pretty-printer) | NikitaVolkov |

bitset | 22 | 0.0 | A space-efficient set data structure. | (benchmark, data-structures, library, mit) | DenisBueno, FedorGogolev, SergeiLebedev |

bitwise | 18 | 0.0 | fast multi-dimensional unboxed bit packed Bool arrays | (benchmark, bit-vectors, bsd3, data, data-structures, library) | ClaudeHeilandAllen |

bk-tree | 3 | 0.0 | BK-tree implementation | (data-structures, library, public-domain) | FrancescoMazzoli |

bktrees | 25 | 0.0 | A set data structure with approximate searching | (bsd3, data-structures, library) | JosefSvenningsson |

bookkeeper | 11 | 0.0 | Anonymous records and overloaded labels | (benchmark, bsd3, data-structures, library, program, records) | jkarni, aminb |

bookkeeper-permissions | 1 | 0.0 | Permissions for bookkeeper records | (bsd3, data-structures, library, records) | pkamenarsky |

boolexpr | 2 | 0.0 | Boolean expressions with various representations and search queries. | (bsd3, data-structures, library, parsing, search) | NicolasPouillard |

btree-concurrent | 5 | 0.0 | A backend agnostic, concurrent BTree | (data-structures, lgpl, library) | JohanBrinch |

bytestring-trie | 127 | 2.25 | An efficient finite map from (byte)strings to values. | (bsd3, data, data-structures, library) | WrenThornton |

cmph | 2 | 0.0 | low level interface to CMPH | (bsd3, data, data-structures, library) | MarkWotton |

collections | 7 | 0.0 | Useful standard collections types and related functions. | (bsd3, data-structures, library) | JeanPhilippeBernardy, JohannesWaldmann |

collections-api | 3 | 0.0 | API for collection data structures. | (bsd3, data-structures, library) | JeanPhilippeBernardy |

collections-base-instances | 4 | 0.0 | Useful standard collections types and related functions. | (bsd3, data-structures, library) | JeanPhilippeBernardy |

container-classes (deprecated) | 3 | 0.0 | Generic classes for interacting with different container types | (bsd3, data-structures, deprecated, library) | IvanMiljenovic |

containers | 581 | 2.75 | Assorted concrete container types | (benchmark, bsd3, data-structures, library) | EdwardKmett, JohanTibell, MilanStraka, WrenThornton, dfeuer, WrenRomano |

ctrie | 8 | 0.0 | Non-blocking concurrent map | (benchmark, concurrency, data-structures, library, mit) | MichaelSchroeder |

data-clist | 79 | 0.0 | Simple functional ring type. | (bsd3, data-structures, library) | JohnVanEnk, jeremyjh |

data-forest | 18 | 0.0 | A simple multi-way tree data structure. | (apache, data-structures, library) | chris_martin |

data-lens-ixset (deprecated in favor of data-store, tables, lens) | 5 | 0.0 | A Lens for IxSet | (bsd3, comonads, control, data-structures, deprecated, library) | DagOdenhall |

data-r-tree | 6 | 0.0 | R-Tree is a spatial data structure similar to Quadtrees or B-Trees. | (data-structures, library, mit) | SebastianPhilipp |

data-stringmap | 7 | 0.0 | An efficient implementation of maps from strings to arbitrary values | (data-structures, library, mit) | UweSchmidt, SebastianPhilipp |

dawg | 16 | 0.0 | Directed acyclic word graphs | (bsd3, data, data-structures, library) | JakubWaszczuk |

dawg-ord | 15 | 2.0 | Directed acyclic word graphs | (bsd3, data, data-structures, library) | JakubWaszczuk |

dequeue | 21 | 0.0 | A typeclass and an implementation for double-ended queues. | (bsd3, data-structures, library) | HenryBucklow |

diffarray | 5 | 0.0 | DiffArray | (bsd3, data-structures, library) | AndreasAbel, IanLynagh |

disjoint-sets-st | 12 | 0.0 | Imperative ST/IO based disjoint set data structure. | (bsd3, data-structures, library) | PetrPudlak |

distributive | 1700 | 2.0 | Distributive functors -- Dual to Traversable | (bsd3, data-structures, library) | EdwardKmett, EricMertens, ryanglscott |

dph-base | 5 | 0.0 | Data Parallel Haskell common config and debugging functions. | (bsd3, data-structures, library) | BenLippmeier |

dph-examples | 15 | 0.0 | Data Parallel Haskell example programs. | (bsd3, data-structures, program) | BenLippmeier |

dph-lifted-base | 3 | 0.0 | Data Parallel Haskell common definitions used by other dph-lifted packages. | (bsd3, data-structures, library) | BenLippmeier |

dph-lifted-copy | 3 | 0.0 | Data Parallel Haskell lifted array combinators. (deprecated version) | (bsd3, data-structures, library) | BenLippmeier |

dph-lifted-vseg | 5 | 0.0 | Data Parallel Haskell lifted array combinators. | (bsd3, data-structures, library) | BenLippmeier |

dph-par | 5 | 0.0 | (deprecated) | (bsd3, data-structures, library) | BenLippmeier |

dph-prim-interface | 5 | 0.0 | Data Parallel Haskell segmented arrays. (abstract interface) | (bsd3, data-structures, library) | BenLippmeier |

dph-prim-par | 5 | 0.0 | Data Parallel Haskell segmented arrays. (production version) | (bsd3, data-structures, library) | BenLippmeier |

dph-prim-seq | 6 | 0.0 | Data Parallel Haskell segmented arrays. (sequential implementation) | (bsd3, data-structures, library) | BenLippmeier |

dph-seq | 4 | 0.0 | (deprecated) | (bsd3, data-structures, library) | BenLippmeier |

edit-distance-vector | 7 | 0.0 | Calculate edit distances and edit scripts between vectors. | (algorithms, bsd3, data, data-structures, library) | ThomasSutton |

enummapmap | 9 | 0.0 | Map of maps using Enum types as keys | (benchmark, bsd3, data, data-structures, library) | MatthewWest |

ethereum-client-haskell | 4 | 0.0 | A Haskell version of an Ethereum client | (bsd3, data-structures, program) | jamshid |

ethereum-merkle-patricia-db (deprecated in favor of merkle-patricia-db) | 1 | 0.0 | A modified Merkle Patricia DB | (bsd3, data-structures, deprecated, library) | jamshid |

ethereum-rlp | 24 | 0.0 | Ethereum Recursive Length Prefix Encoding | (apache, data-structures, library) | jamshid |

exposed-containers | 3 | 0.0 | A distribution of the 'containers' package, with all modules exposed. | (bsd3, data-structures, library) | vi |

fgl | 486 | 2.25 | Martin Erwig's Functional Graph Library | (bsd3, data-structures, graphs, library) | IvanMiljenovic, MartinErwig |

fgl-extras-decompositions | 4 | 0.0 | Graph decomposition algorithms | (bsd3, data-structures, graphs, library) | ChristianHoener |

fingertree | 504 | 2.0 | Generic finger-tree structure, with example instances | (bsd3, data-structures, library) | RossPaterson |

fingertree-psqueue | 13 | 0.0 | Implementation of priority search queues as finger trees. | (bsd3, data-structures, library) | CaleGibbard |

fingertree-tf | 9 | 0.0 | Generic finger-tree structure using type families. | (bsd3, data, data-structures, library) | pawel834 |

generic-tree (deprecated in favor of free) | 6 | 0.0 | Generic Tree data type | (data-structures, deprecated, lgpl, library) | MatthewFarkasDyck |

gmap | 3 | 0.0 | Composable maps and generic tries. | (bsd3, data-structures, library) | JamieBrandon |

graph-matchings | 10 | 2.0 | An implementation of algorithms for matchings in graphs | (data-structures, graphs, lgpl, library) | eberlm |

graph-utils | 13 | 0.0 | A simple wrapper & quasi quoter for fgl. | (bsd3, data, data-structures, graphs, library) | HiromiIshii |

graph-wrapper | 27 | 0.0 | A wrapper around the standard Data.Graph with a less awkward interface | (bsd3, data-structures, graphs, library) | MaxBolingbroke, SoenkeHahn |

graphite | 82 | 0.0 | Graphs and networks library | (bsd3, data-structures, graphs, library) | alx741, DanielCampoverde |

graphs | 28 | 0.0 | A simple monadic graph library | (algorithms, bsd3, data-structures, graphs, library) | EdwardKmett |

gtk-largeTreeStore | 3 | 0.0 | Large TreeStore support for gtk2hs | (data-structures, graphics, lgpl, library) | rakatan |

hCM | 4 | 0.0 | Conceptual modelling support for Haskell | (data-structures, development, library, mit, model, program) | MarekSuchanek |

hamtmap | 4 | 0.0 | A purely functional and persistent hash map | (bsd3, data-structures, library) | KevinWuWon |

hashtables-plus (deprecated) | 2 | 0.0 | Extensions for a "hashtables" library | (benchmark, data, data-structures, deprecated, library, mit) | NikitaVolkov |

heap | 53 | 0.0 | Heaps in Haskell | (bsd3, data-structures, library) | StephanFriedrichs, eberlm |

heaps | 358 | 2.0 | Asymptotically optimal Brodal/Okasaki heaps. | (bsd3, data-structures, library) | EdwardKmett, EricMertens, ryanglscott |

hetero-map | 13 | 0.0 | Pure heterogeneous maps. | (bsd3, data, data-structures, library) | LukePalmer |

hgal | 12 | 0.0 | library for computation automorphism group and canonical labelling of a graph | (algorithms, data-structures, gpl, library) | JeanPhilippeBernardy |

hobbits | 14 | 0.0 | A library for canonically representing terms with binding | (bsd3, data-structures, library) | EddyWestbrook |

igraph | 3 | 2.0 | Bindings to the igraph C library. | (bsd3, data-structures, graphs, library) | NilsSchweinsberg |

intern | 45 | 2.0 | Efficient hash-consing for arbitrary data types | (bsd3, data, data-structures, library) | EdwardKmett |

interval | 5 | 0.0 | Intervals with adherences. | (data-structures, gpl, library) | julm |

iterable | 6 | 0.0 | API for hierarchical multilevel collections. | (bsd3, data-structures, library) | MichalGajda |

ixset | 16 | 0.0 | Efficient relational queries on Haskell sets. | (bsd3, data-structures, library) | JeremyShaw |

ixset-typed | 29 | 0.0 | Efficient relational queries on Haskell sets. | (bsd3, data-structures, library) | AndresLoeh |

justified-containers | 15 | 0.0 | Keyed container types with type-checked proofs of key presence. | (bsd2, data-structures, library) | mnoonan |

kan-extensions | 1034 | 2.25 | Kan extensions, Kan lifts, various forms of the Yoneda lemma, and (co)density (co)monads | (bsd3, comonads, data-structures, functors, library, monads) | EdwardKmett, EricMertens |

keys | 204 | 0.0 | Keyed functors and containers | (bsd3, containers, data-structures, library) | EdwardKmett, EricMertens |

knead | 25 | 0.0 | Repa array processing using LLVM JIT | (bsd3, data-structures, library) | HenningThielemann |

labeled-graph | 4 | 0.0 | Labeled graph structure | (bsd3, data-structures, library) | JeanPhilippeBernardy |

labeled-tree | 4 | 0.0 | Labeled tree structure | (bsd3, data-structures, library) | JeanPhilippeBernardy |

lca | 13 | 2.0 | O(log n) persistent on-line lowest common ancestor calculation without preprocessing | (algorithms, bsd3, data-structures, library) | EdwardKmett |

libgraph | 32 | 0.0 | Store and manipulate data in a graph. | (algorithms, bsd3, data-structures, library) | faddegon |

linked-list-with-iterator | 4 | 0.0 | A pure linked list which is mutable through iterators. | (bsd3, data-structures, library) | CindyLinz |

list-t | 365 | 2.0 | ListT done right | (control, data-structures, library, mit, streaming) | NikitaVolkov |

list-tries | 28 | 0.0 | Tries and Patricia tries: finite sets and maps for list keys | (bsd3, data, data-structures, library) | MattiNiemenmaa |

listlike-instances (deprecated in favor of ListLike) | 11 | 0.0 | Extra instances of the ListLike class | (bsd3, data-structures, deprecated, generics, library) | JohnLato |

loc | 30 | 0.0 | Types representing line and column positions and ranges in text files. | (apache, data-structures, library) | chris_martin |

magma | 8 | 0.0 | magma is an algebraic structure consisting a set together with an binary operation. | (algebra, bsd3, data, data-structures, library, math) | KatsutoshiItoh |

map-exts | 4 | 2.0 | Extensions to Data.Map | (bsd3, data-structures, library, program) | coopercm |

map-syntax | 60 | 2.0 | Syntax sugar for defining maps | (bsd3, data-structures, library) | DougBeardsley |

meldable-heap | 20 | 0.0 | Asymptotically optimal, Coq-verified meldable heaps, AKA priority queues | (bsd3, data-structures, library) | JimApple |

merkle-patricia-db | 14 | 0.0 | A modified Merkle Patricia DB | (apache, data-structures, library) | jamshid |

miso | 192 | 2.0 | A tasty Haskell front-end framework | (bsd3, data-structures, library, miso, web) | DavidJohnson |

monadic-arrays | 16 | 0.0 | Boxed and unboxed arrays for monad transformers | (bsd3, data-structures, library) | EdwardKmett |

multimap | 9 | 0.0 | A multimap. | (data-structures, library, mit) | JulianFleischer |

multiset | 23 | 0.0 | The Data.MultiSet container type | (bsd3, data-structures, library) | TwanVanLaarhoven |

naperian | 9 | 0.0 | Efficient representable functors | (bsd3, data-structures, library) | AaronVargo |

nested-sequence | 12 | 0.0 | List-like data structures with O(log(n)) random access | (bsd3, data, data-structures, library) | BalazsKomuves |

nested-sets | 10 | 0.0 | Nested set model implementation | (data-structures, gpl, library) | rakatan |

nibblestring | 4 | 0.0 | Packed, strict nibble arrays with a list interface (ByteString for nibbles) | (bsd3, data-structures, library) | jamshid |

nthable | 5 | 0.0 | | (bsd3, data-structures, library) | GeorgePollard |

perfecthash | 1 | 0.0 | A perfect hashing library for mapping bytestrings to values. | (benchmark, bsd3, data, data-structures, library) | MarkWotton |

permutation | 23 | 0.0 | A library for permutations and combinations. | (bsd3, data-structures, library, math) | PatrickPerry, spacekitteh |

pqueue | 26 | 0.0 | Reliable, persistent, fast priority queues. | (bsd3, data-structures, library) | LouisWasserman, lspitzner |

psqueues | 669 | 0.0 | Pure priority search queues | (benchmark, bsd3, data-structures, library) | JasperVanDerJeugt |

quickset | 2 | 0.0 | Very fast and memory-compact query-only set and map structures | (bsd3, data, data-structures, library) | ErtugrulSoeylemez, esz |

ralist | 6 | 0.0 | Random access list with a list compatible interface. | (benchmark, bsd3, data-structures, library) | CarterSchonwald, LennartAugustsson |

random-access-list | 5 | 0.0 | Random-access lists in Haskell | (bsd3, data-structures, library) | StephanFriedrichs |

random-tree | 3 | 0.0 | Create random trees | (data-structures, gpl, library) | GregorySchwartz |

randproc | 9 | 0.0 | Data structures and support functions for working with random processes | (bsd3, data-structures, library) | DavidBanas |

record | 24 | 0.0 | Anonymous records | (control, data-structures, library, mit, records) | NikitaVolkov |

reflection-without-remorse | 7 | 0.0 | Efficient free and operational monads. | (bsd3, data, data-structures, library) | AtzeVanDerPloeg |

relacion | 4 | 0.0 | A relation data structure. | (bsd3, data-structures, library) | LeonelFonseca |

relation | 4 | 0.0 | A data structure representing Relations on Sets. | (bsd3, data-structures, library) | DrewDay |

repa | 116 | 2.0 | High performance, regular, shape polymorphic parallel arrays. | (bsd3, data-structures, library) | BasVanDijk, BenLippmeier, PepeIborra, TrevorMcDonell |

repa-algorithms | 57 | 0.0 | Algorithms using the Repa array library. | (bsd3, data-structures, library) | BasVanDijk, BenLippmeier, PepeIborra, TrevorMcDonell |

repa-array | 5 | 0.0 | Bulk array representations and operators. | (bsd3, data-structures, library) | BasVanDijk, BenLippmeier, PepeIborra, TrevorMcDonell |

repa-bytestring | 18 | 0.0 | (deprecated) | (bsd3, data-structures, library) | BasVanDijk, BenLippmeier, TrevorMcDonell |

repa-convert | 6 | 0.0 | Packing and unpacking flat tables. | (bsd3, data-structures, library) | BasVanDijk, BenLippmeier, PepeIborra, TrevorMcDonell |

repa-devil (deprecated in favor of friday) | 14 | 0.0 | Support for image reading and writing of Repa arrays using in-place FFI calls | (bsd3, data-structures, deprecated, library) | DonaldStewart, RaphaelJavaux, ThomasDuBuisson |

repa-eval | 5 | 0.0 | Low-level parallel operators on bulk random-accessble arrays. | (bsd3, data-structures, library) | BasVanDijk, BenLippmeier, PepeIborra, TrevorMcDonell |

repa-examples | 41 | 0.0 | Examples using the Repa array library. | (bsd3, data-structures, program) | BasVanDijk, BenLippmeier, PepeIborra, TrevorMcDonell |

repa-fftw | 3 | 0.0 | Perform fft with repa via FFTW | (benchmark, bsd3, data-structures, library) | AtsuroHoshino |

repa-flow | 10 | 0.0 | Data-parallel data flows. | (bsd3, data-structures, library) | BasVanDijk, BenLippmeier, PepeIborra, TrevorMcDonell |

repa-io | 48 | 0.0 | Read and write Repa arrays in various formats. | (bsd3, data-structures, library) | BasVanDijk, BenLippmeier, PepeIborra, TrevorMcDonell |

repa-plugin | 1 | 0.0 | Data Flow Fusion GHC Plugin. | (bsd3, data-structures, library) | BasVanDijk, BenLippmeier |

repa-scalar | 6 | 0.0 | Scalar data types and conversions. | (bsd3, data-structures, library) | BasVanDijk, BenLippmeier, PepeIborra, TrevorMcDonell |

repa-series | 1 | 0.0 | Series Expressionss API | (bsd3, data-structures, library) | BasVanDijk, BenLippmeier, PepeIborra, TrevorMcDonell |

repa-sndfile | 4 | 0.0 | Reading and writing sound files with repa arrays | (bsd3, data-structures, library) | AtsuroHoshino |

repa-stream | 5 | 0.0 | Stream functions not present in the vector library. | (bsd3, data-structures, library) | BasVanDijk, BenLippmeier, PepeIborra, TrevorMcDonell |

representable-functors (deprecated in favor of adjunctions) | 65 | 0.0 | Representable functors | (bsd3, data-structures, deprecated, functors, library, monads) | EdwardKmett |

representable-tries | 65 | 0.0 | Tries from representations of polynomial functors | (bsd3, comonads, data-structures, functors, library, monads) | EdwardKmett |

rosezipper | 27 | 0.0 | Generic zipper implementation for Data.Tree | (bsd3, data-structures, library) | EricKow, IavorDiatchki |

selections | 21 | 0.0 | Combinators for operating with selections over an underlying functor | (bsd3, data-structures, functors, library) | ChrisPenner |

semigroups | 3186 | 2.5 | Anything that associates | (algebra, bsd3, data, data-structures, library, math) | EdwardKmett, EricMertens, HerbertValerioRiedel, ryanglscott |

semigroups-actions | 1 | 0.0 | Semigroups actions | (algebra, bsd3, data, data-structures, library, math) | PetrPudlak |

sequence | 14 | 0.0 | A type class for sequences and various sequence data structures. | (bsd3, data, data-structures, library) | AtzeVanDerPloeg |

signed-multiset | 7 | 0.0 | Multisets with negative membership. | (bsd3, data-structures, library) | StefanHoldermans |

sirkel | 2 | 0.0 | Sirkel, a Chord DHT | (bsd3, concurrency, concurrent, data-structures, database, distributed-computing, library) | MortenLysgaard |

sparsebit | 8 | 0.0 | Sparse bitmaps for pattern match coverage | (bsd3, data-structures, development, library) | KiYungAhn |

splay | 7 | 2.0 | Generic splay-based sequence representation | (bsd3, data-structures, library) | dramforever |

spool | 64 | 0.0 | Convert between ByteString and Vector.Storable without copying | (bsd3, data-structures, library) | KeeganMcAllister |

stable-heap | 1 | 0.0 | Purely functional stable heaps (fair priority queues) | (benchmark, data-structures, library, mit) | JakeMcArthur |

statethread | 3 | 0.0 | The ST monad and STRefs | (bsd3, data-structures, library, monads) | HenningThielemann |

static-hash | 8 | 0.0 | Immutable hash | (bsd3, data-structures, library) | KazuYamamoto |

stm-containers | 361 | 0.0 | Containers for STM | (benchmark, concurrency, data-structures, library, mit, stm) | NikitaVolkov |

subwordgraph | 6 | 0.0 | Subword graph implementation | (bsd3, data-structures, library) | adambak |

suffix-array | 5 | 0.0 | Simple and moderately efficient suffix array implementation | (benchmark, bsd3, data-structures, library, program) | kadoban |

suffixtree | 12 | 0.0 | Efficient, lazy suffix tree implementation | (bsd3, data, data-structures, library) | BryanOSullivan |

swapper | 2 | 0.0 | Transparently swapping data from in-memory structures to disk | (bsd3, data-structures, library) | RomanSmrz |

thrist | 18 | 0.0 | Type-threaded list | (bsd3, categories, data-structures, library) | GaborGreif |

tie-knot | 3 | 0.0 | "Ties the knot" on a given set of structures that reference each other by
keys. | (data-structures, lgpl, library, recursion) | PetrPudlak |

total-maps | 9 | 0.0 | Dense and sparse total maps. | (containers, data, data-structures, library, mit) | pawel834 |

translatable-intset | 4 | 0.0 | Integer sets with a constant time translate operation. | (data-structures, library, mit) | JannisHarder |

treemap | 6 | 0.0 | A tree of Data.Map. | (data-structures, gpl, library) | julm |

tst | 5 | 0.0 | BK-tree implementation | (data-structures, library, public-domain) | FrancescoMazzoli |

type-aligned | 12 | 0.0 | Various type-aligned sequence data structures. | (bsd3, data, data-structures, library) | AtzeVanDerPloeg |

type-indexed-queues | 9 | 0.0 | Queues with verified and unverified versions. | (benchmark, data-structures, library, mit) | oisdk |

type-level-bst | 2 | 0.0 | type-level binary search trees in haskell | (bsd3, data-structures, dependent-types, library) | Kinokkory |

type-level-sets | 22 | 2.0 | Type-level sets and finite maps (with value-level counterparts) | (bsd3, data-structures, library, type-system) | DominicOrchard |

unordered-graphs | 5 | 0.0 | Graph library using unordered-containers | (data-structures, graphs, library, mit) | IvanMiljenovic |

vector | 3646 | 0.0 | Efficient Arrays | (bsd3, data, data-structures, library) | BryanOSullivan, DanDoel, HerbertValerioRiedel, RomanLeshchinskiy |

vector-clock | 7 | 0.0 | Vector clocks for versioning message flows | (data, data-structures, distributed-computing, gpl, library) | AlexandruScvortov, hansonkd |

vector-functorlazy | 2 | 0.0 | vectors that perform the fmap operation in constant time | (bsd3, data, data-structures, library) | MikeIzbicki |

vector-heterogenous | 8 | 0.0 | A type-safe library for vectors whose elements can be of any type, or any type satisfying some constraints | (bsd3, data, data-structures, library) | MikeIzbicki |

vector-instances | 90 | 0.0 | Orphan Instances for 'Data.Vector' | (bsd3, data, data-structures, library) | EdwardKmett, ryanglscott |

vector-mmap | 8 | 0.0 | Memory map immutable and mutable vectors | (bsd3, data, data-structures, library) | DanielPeebles, fho |

vector-read-instances (deprecated in favor of vector) | 7 | 0.0 | (deprecated) Read instances for 'Data.Vector' | (bsd3, data, data-structures, deprecated, library) | ChristianHoener |

vector-split | 5 | 0.0 | Combinator library for splitting vectors. | (data, data-structures, library, mit) | fho |

vector-static (deprecated) | 15 | 0.0 | Statically checked sizes on Data.Vector | (bsd3, data, data-structures, deprecated, library) | DanielPeebles, JakeMcArthur |

void | 1957 | 2.0 | A Haskell 98 logically uninhabited data type | (bsd3, data-structures, library) | EdwardKmett |

yarr | 15 | 0.0 | Yet another array library | (data-flow, data-structures, graphics, library, mit) | DominicSteinitz, RomanLeventov |