Packages tagged data-structures
353 packages have this tag.
[Merge tag] (trustees only)Related tags: library (348), bsd3 (255), data (88), mit (48), program (24), deprecated (18), apache (17), algorithms (14), graphs (13), gpl (11), math (9), algebra (8), succinct-data-structures (8), bioinformatics (6), data-mining (6), concurrency (5), functors (5), machine-learning (5), mpl (5), comonads (4), monads (4), array (3), bit (3), bsd2 (3), containers (3), control (3), data-science (3), dependent-types (3), distributed-computing (3), graphics (3), lgpl (3), records (3), agpl (2), bit-vectors (2), development (2), formal-languages (2), generics (2), lenses (2), miso (2), parallelism (2), public-domain (2), serialization (2), stm (2), text (2), type-system (2), web (2), adjunctions (1), cache (1), caching (1), categories (1), charts (1), codec (1), composite (1), concurrent (1), cryptography (1), csv (1), ...
Name |
DLs |
Rating |
Rev Deps |
Description |
Tags |
Last U/L |
Last Version |
Maintainers |
|---|---|---|---|---|---|---|---|---|
| ADPfusion | 33 | 0.0 | 15 | Efficient, high-level dynamic programming. | (algorithms, bioinformatics, bsd3, data-structures, formal-languages, library) | 2019-10-01 | 0.6.0.0 | ChristianHoener |
| ADPfusionSet | 4 | 0.0 | 3 | Dynamic programming for Set data structures. | (algorithms, bioinformatics, bsd3, data-structures, formal-languages, library) | 2017-10-19 | 0.0.0.2 | ChristianHoener |
| AlignmentAlgorithms | 12 | 0.0 | 1 | Collection of alignment algorithms | (algorithms, bioinformatics, data-structures, gpl, library, linguistics) | 2017-03-14 | 0.1.0.0 | ChristianHoener |
| BiobaseTypes | 35 | 0.0 | 12 | Collection of types for bioinformatics | (bioinformatics, bsd3, data-structures, library) | 2021-06-04 | 0.2.1.0 | ChristianHoener |
| CTRex | 5 | 0.0 | 2 | Open records using closed type families. | (bsd3, data, data-structures, library) | 2014-11-13 | 0.6 | AtzeVanDerPloeg |
| DrIFT | 6 | 0.0 | 1 | Program to derive type class instances | (bsd3, data-structures, library, program) | 2013-11-11 | 2.4.2 | KiwamuOkabe |
| DrIFT-cabalized (deprecated in favor of DrIFT) | 18 | 0.0 | 1 | Program to derive type class instances | (bsd3, data-structures, deprecated, program) | 2013-09-03 | 2.3.0 | GwernBranwen, KiwamuOkabe |
| EdisonAPI | 27 | 0.0 | 5 | A library of efficient, purely-functional data structures (API) | (data-structures, library, mit) | 2025-02-04 | 1.3.3.2 | RobertDockins, lyxia |
| EdisonCore | 52 | 2.25 | 4 | A library of efficient, purely-functional data structures (Core Implementations) | (data-structures, library, mit) | 2025-12-30 | 1.3.3.3 | RobertDockins, lyxia |
| EnumMap | 2 | 0.0 | 1 | More general IntMap replacement. | (bsd3, data-structures, library) | 2009-09-15 | 0.0.2 | JohnVanEnk |
| Etage-Graph | 11 | 0.0 | 1 | Data-flow based graph algorithms | (data-structures, lgpl, library, program) | 2014-05-10 | 0.1.8 | MitarMilutinovic |
| FenwickTree | 8 | 0.0 | 1 | Data structure for fast query and update of cumulative sums | (bsd3, data-structures, library) | 2015-03-19 | 0.1.2.1 | MichalGajda |
| GiST | 2 | 0.0 | 1 | A Haskell implementation of a Generalized Search Tree (GiST) | (data-structures, library) | 2013-06-27 | 0.0.1 | MihailBogojeski |
| HLearn-approximation (deprecated) | 8 | 0.0 | 1 | (bsd3, data-mining, data-structures, deprecated, library, machine-learning) | 2013-07-30 | 1.1.0 | MikeIzbicki | |
| HLearn-datastructures (deprecated) | 5 | 0.0 | 3 | (bsd3, data-mining, data-structures, deprecated, library, machine-learning) | 2013-07-27 | 1.1.0 | MikeIzbicki | |
| HMap | 71 | 0.0 | 1 | Fast heterogeneous maps and unconstrained typeable-like functionality. | (bsd3, data, data-structures, library) | 2018-04-17 | 1.3.0 | AtzeVanDerPloeg |
| HoleyMonoid | 6 | 0.0 | 1 | Monoids with holes. | (bsd3, data-structures, library) | 2017-02-13 | 0.1.2 | MartijnVanSteenbergen |
| I1M | 31 | 0.0 | 0 | Code for the Haskell course taught at the University of Seville. | (data-structures, education, gpl, library) | 2024-10-09 | 0.2.2 | Jose_A_Alonso |
| Infinitree | 1 | 0.0 | 0 | Infinitely deep trees for lazy stateless memoization | (agpl, cache, caching, data-structures, library) | 2025-10-15 | 0.1.0.0 | VegOwOtenks |
| InternedData | 3 | 0.0 | 1 | Data interning (with compact regions where possible) | (bsd3, data, data-structures, library, natural-language-processing) | 2019-10-02 | 0.0.0.1 | ChristianHoener |
| KdTree | 15 | 0.0 | 1 | KdTree, for efficient search in K-dimensional point clouds. | (bsd3, data-mining, data-structures, graphics, library, machine-learning) | 2017-09-29 | 0.2.2.1 | IssacTrotts, jessekempf |
| PSQueue | 17 | 0.0 | 15 | Priority Search Queue | (bsd3, data-structures, library) | 2025-08-24 | 1.2.2 | HerbertValerioRiedel, ScottDillard, teo |
| PerfectHash (deprecated in favor of perfecthash) | 13 | 0.0 | 1 | A perfect hashing library for mapping bytestrings to values. | (bsd3, data, data-structures, deprecated, library) | 2016-04-29 | 0.1.5 | MarkWotton |
| RBTree | 9 | 0.0 | 2 | Pure haskell Red-Black-Tree implemetation | (bsd3, data-structures, library) | 2011-06-09 | 0.0.5 | XingboWu |
| Stack | 11 | 2.25 | 1 | Stack data structure | (bsd3, data-structures, library) | 2019-01-18 | 0.4.0 | rwlock |
| SuffixStructures | 2 | 0.0 | 0 | Suffix array construction | (bsd3, data, data-structures, library, program) | 2015-05-07 | 0.0.1.0 | ChristianHoener |
| TernaryTrees | 47 | 0.0 | 1 | Efficient pure ternary tree Sets and Maps | (bsd3, data-structures, library, program) | 2011-01-22 | 0.2.0.2 | AlexMason |
| TreeStructures | 6 | 0.0 | 1 | A collection of heaps and search trees | (bsd3, data-structures, library) | 2010-03-15 | 0.0.2 | BrendanHickey |
| ac-library-hs | 75 | 1.5 | 0 | Data structures and algorithms | (algorithms, data-structures, library, program) | 2026-04-11 | 1.5.3.2 | toyboot4e |
| adjunctions | 278 | 2.25 | 71 | Adjunctions and representable functors | (adjunctions, bsd2, data-structures, library) | 2026-01-10 | 4.4.4 | EdwardKmett, EricMertens, ryanglscott, AaronVargo |
| adp-multi | 20 | 0.0 | 2 | ADP for multiple context-free languages | (algorithms, bioinformatics, bsd3, data-structures, library) | 2013-05-29 | 0.2.3 | MaikRiechert |
| adp-multi-monadiccp | 15 | 0.0 | 1 | Subword construction in adp-multi using monadiccp | (algorithms, bioinformatics, bsd3, data-structures, library) | 2013-05-29 | 0.2.1 | MaikRiechert |
| algebraic-edge-graphs | 4 | 2.0 | 0 | A library for algebraic edge-graph construction and transformation | (algebra, algorithms, data-structures, graphs, library, mit) | 2026-04-27 | 0.1.1 | jackliellcock |
| algebraic-graphs | 22 | 2.75 | 24 | A library for algebraic graph construction and transformation | (algebra, algorithms, data-structures, graphs, library, mit) | 2026-01-18 | 0.8 | snowleopard |
| appendmap | 22 | 0.0 | 3 | Map with a Semigroup and Monoid instances delegating to Semigroup of the elements | (bsd3, data-structures, library) | 2018-09-02 | 0.1.5 | AlexeyKotlyarov |
| array | 93 | 2.25 | 1157 | Mutable and immutable arrays | (bsd3, data-structures, library) | 2024-09-08 | 0.5.8.0 | AustinSeipp, BenGamari, HerbertValerioRiedel, IanLynagh, wz1000, July541 |
| array-mhs | 4 | 0.0 | 0 | Mutable and immutable arrays | (apache, data-structures, library) | 2025-09-12 | 0.5.8.0 | LennartAugustsson |
| array-utils (deprecated) | 10 | 0.0 | 1 | Primitive functions for updating many elements in mutable arrays at once | (bsd3, data, data-structures, deprecated, library) | 2011-01-29 | 0.3 | AlexMason |
| atomic-counter | 40 | 0.0 | 3 | Mutable counters that can be modified with atomic operatinos | (apache, concurrency, data, data-structures, library) | 2025-10-07 | 0.1.2.4 | SergeyVinokurov |
| bag (deprecated in favor of dlist) | 2 | 0.0 | 1 | A simple stable bag. | (data-structures, deprecated, library, mit) | 2011-07-22 | 0.1 | DanielWaterworth |
| barbies | 77 | 2.25 | 15 | Classes for working with types that can change clothes. | (bsd3, data-structures, library) | 2024-01-13 | 2.1.1.0 | DanielGorin |
| barbies-layered | 6 | 0.0 | 0 | Barbies with layered clothes. | (apache, data-structures, library) | 2021-07-15 | 0.1.0.0 | kakkun61 |
| barbies-th | 48 | 0.0 | 2 | Create strippable HKD via TH | (bsd3, data, data-structures, generics, library) | 2023-12-12 | 0.1.11 | FumiakiKinoshita |
| bcp47 | 33 | 0.0 | 2 | Language tags as specified by BCP 47 | (data, data-structures, library, mit) | 2025-07-08 | 0.3.0.0 | PatrickBrisbin, dukerutledge, mjgpy3, chris_martin, FreckleEngineering, OlaoluwaM |
| bit-array | 18 | 0.0 | 1 | A bit array (aka bitset, bitmap, bit vector) API for numeric types | (bit-vectors, data-structures, library, mit, pretty-printer) | 2016-10-01 | 0.1.2 | NikitaVolkov |
| bitset | 48 | 0.0 | 8 | A space-efficient set data structure. | (data-structures, library, mit) | 2014-03-10 | 1.4.8 | DenisBueno, FedorGogolev, SergeiLebedev |
| bitwise | 21 | 0.0 | 6 | fast multi-dimensional unboxed bit packed Bool arrays | (bit-vectors, bsd3, data, data-structures, library) | 2018-04-26 | 1.0.0.1 | ClaudeHeilandAllen |
| bitwise-enum | 45 | 0.0 | 1 | Bitwise operations on bounded enumerations | (bsd3, data, data-structures, foreign, library) | 2023-07-30 | 1.0.1.2 | jnbooth |
| bk-tree | 9 | 0.0 | 2 | BK-tree implementation | (data-structures, library, public-domain) | 2012-10-29 | 0.1.1 | FrancescoMazzoli |
| bktrees | 42 | 0.0 | 2 | A set data structure with approximate searching | (bsd3, data-structures, library) | 2010-11-22 | 0.3.1 | JosefSvenningsson |
| bookkeeper | 45 | 0.0 | 1 | Anonymous records and overloaded labels | (bsd3, data-structures, library, program, records) | 2017-12-17 | 0.2.5 | jkarni, bandali |
| bookkeeper-permissions | 6 | 0.0 | 1 | Permissions for bookkeeper records | (bsd3, data-structures, library, records) | 2016-09-12 | 0.1.0.0 | pkamenarsky |
| boolexpr | 9 | 0.0 | 2 | Boolean expressions with various representations and search queries. | (bsd3, data-structures, library, parsing, search) | 2023-03-13 | 0.2 | NicolasPouillard |
| btree-concurrent | 19 | 0.0 | 1 | A backend agnostic, concurrent BTree | (data-structures, library) | 2012-10-31 | 0.1.5 | JohanBrinch |
| build | 14 | 2.0 | 1 | Build Systems à la Carte | (algorithms, data-structures, library, mit) | 2024-05-18 | 1.1 | snowleopard |
| bytestring-to-vector | 6 | 0.0 | 7 | Convert between ByteString and Vector.Storable without copying | (bsd3, data-structures, library) | 2019-02-08 | 0.3.0.1 | SvenHeyll |
| bytestring-trie | 104 | 2.5 | 24 | An efficient finite map from bytestrings to values. | (bsd3, data, data-structures, library) | 2025-02-12 | 0.2.7.6 | WrenThornton, WrenRomano |
| circular | 16 | 0.0 | 1 | Circular fixed-sized mutable vectors | (bsd3, data-structures, library, math) | 2022-07-10 | 0.4.0.3 | dschrempf |
| cmph | 3 | 0.0 | 1 | low level interface to CMPH | (bsd3, data, data-structures, library) | 2016-04-30 | 0.0.1 | MarkWotton |
| collections | 8 | 0.0 | 1 | Useful standard collections types and related functions. | (bsd3, data-structures, library) | 2011-07-30 | 0.3.1.1 | JeanPhilippeBernardy, JohannesWaldmann |
| collections-api | 3 | 0.0 | 6 | API for collection data structures. | (bsd3, data-structures, library) | 2010-08-25 | 1.0.0.0 | JeanPhilippeBernardy |
| collections-base-instances | 1 | 0.0 | 2 | Useful standard collections types and related functions. | (bsd3, data-structures, library) | 2010-08-25 | 1.0.0.0 | JeanPhilippeBernardy |
| comfort-array | 77 | 2.0 | 16 | Arrays where the index type is a function of the shape type | (bsd3, data-structures, library) | 2024-05-18 | 0.5.5 | HenningThielemann |
| comfort-array-shape | 5 | 0.0 | 2 | Additional shape types for the comfort-array package | (bsd3, data-structures, library) | 2021-08-05 | 0.0 | HenningThielemann |
| composite-tuple | 7 | 0.0 | 1 | Tuple functions for composite records. | (composite, data-structures, library, mit) | 2020-09-18 | 0.1.2.0 | locallycompact |
| composite-xstep | 3 | 0.0 | 1 | ReaderT transformer pattern for higher kinded composite data. | (data-structures, library, mit) | 2020-09-05 | 0.1.0.0 | locallycompact |
| container-classes (deprecated) | 6 | 0.0 | 1 | Generic classes for interacting with different container types | (bsd3, data-structures, deprecated, library) | 2010-07-18 | 0.0.0.0 | IvanMiljenovic |
| containers | 130 | 2.75 | 5814 | Assorted concrete container types | (bsd3, data-structures, library) | 2025-03-01 | 0.8 | dfeuer, MattRenaud, meooow |
| containers-good-graph | 8 | 0.0 | 1 | Data.Graph, but it doesn't suck! | (bsd3, data-structures, library) | 2021-06-03 | 0.6.4.1 | isovector |
| ctrie | 24 | 0.0 | 3 | Non-blocking concurrent map | (concurrency, data-structures, library, mit) | 2017-09-29 | 0.2 | MichaelSchroeder |
| data-clist | 75 | 0.0 | 7 | Simple functional ring type. | (bsd3, data-structures, library) | 2022-02-25 | 0.2 | JohnVanEnk, jeremyjh |
| data-forest | 35 | 0.0 | 1 | A simple multi-way tree data structure | (apache, data-structures, library) | 2025-01-21 | 0.1.0.13 | chris_martin, Monoid_Mary |
| data-functor-logistic | 3 | 0.0 | 1 | Updatable analogue of Distributive functors | (bsd3, data-structures, library) | 2021-11-16 | 0.0 | FumiakiKinoshita |
| data-lens-ixset (deprecated in favor of data-store, tables, lens) | 13 | 0.0 | 1 | A Lens for IxSet | (bsd3, comonads, control, data-structures, deprecated, library) | 2012-01-15 | 0.1.4 | DagOdenhall |
| data-r-tree (deprecated in favor of r-tree) | 17 | 0.0 | 2 | R-Tree is a spatial data structure similar to Quadtrees or B-Trees. | (data-structures, deprecated, library, mit) | 2020-01-22 | 0.6.0 | SebastianPhilipp, OleksiiDivak |
| data-stringmap | 16 | 0.0 | 4 | An efficient implementation of maps from strings to arbitrary values | (data-structures, library, mit) | 2014-02-27 | 1.0.1.1 | UweSchmidt, SebastianPhilipp |
| data-vector-growable | 4 | 0.0 | 0 | Dynamic growable resizable mutable generic vector | (bsd3, data, data-structures, library) | 2020-12-24 | 0.0.1 | FumiakiKinoshita |
| dawg | 51 | 0.0 | 9 | Directed acyclic word graphs | (bsd3, data, data-structures, library) | 2013-07-22 | 0.11 | JakubWaszczuk |
| dawg-ord | 26 | 2.0 | 1 | Directed acyclic word graphs | (bsd3, data, data-structures, library) | 2020-09-24 | 0.5.1.2 | JakubWaszczuk |
| day-comonoid | 1 | 0.0 | 1 | A comonoid w.r.t. Day | (bsd3, comonads, data-structures, functors, library) | 2023-10-15 | 0.1 | viercc |
| decision-diagrams | 9 | 0.0 | 1 | Binary Decision Diagrams (BDD) and Zero-suppressed Binary Decision Diagrams (ZDD) | (bsd3, data, data-structures, library, logic) | 2021-11-25 | 0.2.0.0 | MasahiroSakai |
| delta-store | 6 | 0.0 | 0 | Facilities for storing a Haskell value, using delta types. | (apache, data-structures, library) | 2025-03-27 | 1.0.0.0 | HeinrichApfelmus, cardano_foundation |
| delta-types | 4 | 0.0 | 1 | Delta types, also known as change actions. | (apache, data-structures, library) | 2025-03-27 | 1.0.0.0 | HeinrichApfelmus, cardano_foundation |
| depq | 16 | 2.0 | 1 | Double-ended priority queues | (bsd3, data, data-mining, data-structures, library) | 2021-04-12 | 0.4.2 | ocramz |
| dequeue | 52 | 0.0 | 6 | A typeclass and an implementation for double-ended queues. | (bsd3, data-structures, library) | 2015-09-03 | 0.1.12 | HenryBucklow |
| diffarray | 12 | 0.0 | 2 | DiffArray | (bsd3, data-structures, library) | 2013-06-11 | 0.1.1 | AndreasAbel, IanLynagh |
| disjoint-sets-st | 2 | 0.0 | 1 | Imperative ST/IO based disjoint set data structure. | (bsd3, data-structures, library) | 2013-05-29 | 0.1 | PetrPudlak |
| distributive | 152 | 1.75 | 94 | Distributive functors -- Dual to Traversable | (bsd3, data-structures, library) | 2026-01-10 | 0.6.3 | EdwardKmett, EricMertens, ryanglscott |
| dph-base | 20 | 0.0 | 11 | Data Parallel Haskell common config and debugging functions. | (bsd3, data-structures, library) | 2012-10-25 | 0.7.0.1 | BenLippmeier |
| dph-examples | 31 | 0.0 | 1 | Data Parallel Haskell example programs. | (bsd3, data-structures, program) | 2012-10-25 | 0.7.0.5 | BenLippmeier |
| dph-lifted-base | 14 | 0.0 | 2 | Data Parallel Haskell common definitions used by other dph-lifted packages. | (bsd3, data-structures, library) | 2012-10-25 | 0.7.0.1 | BenLippmeier |
| dph-lifted-copy | 14 | 0.0 | 1 | Data Parallel Haskell lifted array combinators. (deprecated version) | (bsd3, data-structures, library) | 2012-10-25 | 0.7.0.1 | BenLippmeier |
| dph-lifted-vseg | 24 | 0.0 | 1 | Data Parallel Haskell lifted array combinators. | (bsd3, data-structures, library) | 2012-10-25 | 0.7.0.1 | BenLippmeier |
| dph-par | 7 | 0.0 | 2 | (deprecated) | (bsd3, data-structures, library) | 2012-10-25 | 0.5.1.99 | BenLippmeier |
| dph-prim-interface | 14 | 0.0 | 3 | Data Parallel Haskell segmented arrays. (abstract interface) | (bsd3, data-structures, library) | 2012-10-25 | 0.7.0.1 | BenLippmeier |
| dph-prim-par | 13 | 0.0 | 8 | Data Parallel Haskell segmented arrays. (production version) | (bsd3, data-structures, library) | 2012-10-25 | 0.7.0.1 | BenLippmeier |
| dph-prim-seq | 16 | 0.0 | 4 | Data Parallel Haskell segmented arrays. (sequential implementation) | (bsd3, data-structures, library) | 2012-10-25 | 0.7.0.1 | BenLippmeier |
| dph-seq | 6 | 0.0 | 2 | (deprecated) | (bsd3, data-structures, library) | 2012-10-25 | 0.5.1.99 | BenLippmeier |
| edit-distance-vector | 10 | 0.0 | 3 | Calculate edit distances and edit scripts between vectors. | (algorithms, bsd3, data, data-structures, library) | 2016-05-24 | 1.0.0.4 | ThomasSutton |
| enummapmap | 18 | 0.0 | 1 | Map of maps using Enum types as keys | (bsd3, data, data-structures, library) | 2014-02-01 | 0.7.0 | MatthewWest |
| enummaps | 13 | 2.0 | 0 | Enum wrappers for IntMap and IntSet | (bsd3, data-structures, library) | 2020-06-23 | 0.6.2.1.7 | leif |
| enummapset | 60 | 2.0 | 22 | IntMap and IntSet with Enum keys/elements. | (bsd3, data-structures, library) | 2024-09-04 | 0.7.3.0 | MichalTerepeta, MikolajKonarski |
| ethereum-client-haskell | 17 | 0.0 | 1 | A Haskell version of an Ethereum client | (bsd3, data-structures, program) | 2015-01-02 | 0.0.4 | jamshid |
| ethereum-merkle-patricia-db (deprecated in favor of merkle-patricia-db) | 3 | 0.0 | 1 | A modified Merkle Patricia DB | (bsd3, data-structures, deprecated, library) | 2015-01-02 | 0.0.1 | jamshid |
| ethereum-rlp | 8 | 0.0 | 3 | Ethereum Recursive Length Prefix Encoding | (apache, data-structures, library) | 2017-08-31 | 0.1.0 | jamshid |
| exposed-containers | 4 | 0.0 | 1 | A distribution of the 'containers' package, with all modules exposed. | (bsd3, data-structures, library) | 2014-07-15 | 0.5.5.1 | vi |
| extended-containers | 6 | 0.0 | 1 | Heap and Vector container types | (bsd3, data-structures, library) | 2021-04-22 | 0.1.1.0 | konsumlamm |
| extended-containers-lens | 5 | 0.0 | 0 | lens instances for extended-containers | (bsd3, data-structures, lenses, library) | 2020-04-29 | 0.1.0.0 | konsumlamm |
| fgl | 51 | 2.75 | 115 | Martin Erwig's Functional Graph Library | (bsd3, data-structures, graphs, library) | 2024-09-30 | 5.8.3.0 | IvanMiljenovic, MartinErwig, TroelsHenriksen |
| fgl-extras-decompositions | 9 | 0.0 | 2 | Graph decomposition algorithms | (bsd3, data-structures, graphs, library) | 2015-05-07 | 0.1.1.0 | ChristianHoener |
| fingertree | 92 | 2.25 | 61 | Generic finger-tree structure, with example instances | (bsd3, data-structures, library) | 2025-12-22 | 0.1.6.3 | RossPaterson |
| fingertree-psqueue | 10 | 0.0 | 1 | Implementation of priority search queues as finger trees. | (bsd3, data-structures, library) | 2011-09-28 | 0.3 | CaleGibbard |
| fingertree-tf | 3 | 0.0 | 1 | Generic finger-tree structure using type families. | (bsd3, data, data-structures, library) | 2014-10-05 | 0.1.0.0 | pawel834 |
| flux-monoid | 11 | 0.0 | 1 | A monoid for tracking changes | (bsd3, data-structures, library) | 2025-08-13 | 1.0.0.0 | ChrisPenner |
| function-builder | 29 | 0.0 | 1 | Create poly variadic functions for monoidal results | (bsd3, data-structures, library) | 2019-02-06 | 0.3.0.1 | SvenHeyll |
| functor-friends | 5 | 0.0 | 1 | Friendly helpers for your recursion schemes. | (bsd3, data-structures, library) | 2017-10-08 | 0.1.0.0 | mnoonan |
| generic-tree (deprecated in favor of hs-functors) | 20 | 0.0 | 1 | Generic Tree data type | (data-structures, deprecated, library) | 2011-12-21 | 15329.2 | |
| gmap | 4 | 0.0 | 1 | Composable maps and generic tries. | (bsd3, data-structures, library) | 2008-12-15 | 0.1 | JamieBrandon |
| graph-matchings | 4 | 2.0 | 1 | An implementation of algorithms for matchings in graphs | (data-structures, graphs, lgpl, library) | 2014-11-27 | 0.1.0.0 | eberlm |
| graph-utils | 18 | 0.0 | 1 | A simple wrapper & quasi quoter for fgl. | (bsd3, data, data-structures, graphs, library) | 2010-06-29 | 0.3.7 | HiromiIshii |
| graph-wrapper | 60 | 0.0 | 3 | A wrapper around the standard Data.Graph with a less awkward interface | (bsd3, data-structures, graphs, library) | 2019-01-25 | 0.2.6.0 | MaxBolingbroke, SoenkeHahn |
| graphite | 100 | 0.0 | 2 | Graphs and networks library | (bsd3, data-structures, graphs, library) | 2019-06-08 | 0.10.0.1 | alx741, DanielCampoverde |
| graphs | 73 | 0.0 | 1 | A simple monadic graph library | (algorithms, bsd3, data-structures, graphs, library) | 2025-03-03 | 0.7.3 | EdwardKmett, ryanglscott |
| grids | 31 | 0.0 | 0 | (bsd3, data-structures, library) | 2019-03-10 | 0.5.0.1 | ChrisPenner | |
| gtk-largeTreeStore | 1 | 0.0 | 2 | Large TreeStore support for gtk2hs | (data-structures, graphics, lgpl, library) | 2014-10-11 | 0.0.1.0 | rakatan |
| hCM | 6 | 0.0 | 0 | Conceptual modelling support for Haskell | (data-structures, development, library, mit, model, program) | 2017-05-08 | 0.1.0.0 | MarekSuchanek |
| haggle | 13 | 0.0 | 0 | A graph library offering mutable, immutable, and inductive graphs | (bsd3, data-structures, graphs, library) | 2025-08-26 | 0.3.1 | TristanRavitch |
| hamtmap | 7 | 0.0 | 1 | A purely functional and persistent hash map | (bsd3, data-structures, library) | 2011-01-20 | 0.3 | KevinWuWon |
| hash-cons | 4 | 0.0 | 0 | Opportunistic hash-consing data structure | (bsd3, data-structures, library) | 2024-10-08 | 0.2.0.0 | RyanTrinkle |
| hashmap-throw | 4 | 0.0 | 0 | Throw behaviour for hashmap lookup. | (data-structures, library, mit) | 2020-08-28 | 0.1.0.0 | locallycompact |
| hashtables-plus (deprecated) | 3 | 0.0 | 1 | Extensions for a "hashtables" library | (data, data-structures, deprecated, library, mit) | 2014-04-29 | 0.2.0 | NikitaVolkov |
| heap | 47 | 0.0 | 13 | Heaps in Haskell | (bsd3, data-structures, library) | 2018-04-11 | 1.0.4 | StephanFriedrichs, eberlm |
| heaps | 55 | 2.0 | 20 | Asymptotically optimal Brodal/Okasaki heaps. | (bsd3, data-structures, library) | 2024-12-04 | 0.4.1 | EdwardKmett, EricMertens, ryanglscott |
| heph-sparse-set | 2 | 0.0 | 0 | Really fast mutable sparse sets | (bsd3, data-structures, library) | 2025-06-08 | 0.1.0.0 | jtnuttall |
| hetero-map | 6 | 0.0 | 1 | Pure heterogeneous maps. | (bsd3, data, data-structures, library) | 2009-01-12 | 0.21 | LukePalmer |
| hgal | 12 | 0.0 | 2 | library for computation automorphism group and canonical labelling of a graph | (algorithms, data-structures, library) | 2023-05-12 | 2.0.0.3 | JeanPhilippeBernardy, marcellus |
| hkd | 10 | 0.0 | 1 | "higher-kinded data" | (data-structures, library) | 2023-10-15 | 0.2.1 | EdwardKmett, phadej |
| hobbits | 36 | 0.0 | 1 | A library for canonically representing terms with binding | (bsd3, data-structures, library) | 2020-12-02 | 1.3.1 | EddyWestbrook |
| hw-balancedparens | 68 | 0.0 | 10 | Balanced parentheses | (bit, bsd3, data, data-structures, library, program, succinct-data-structures) | 2022-12-05 | 0.4.1.3 | newhoggy, haskellworks, GeorgeWilson |
| hw-dsv | 54 | 0.0 | 3 | Unbelievably fast streaming DSV file parser | (bsd3, csv, data-structures, library, program, simd, succinct-data-structures, text) | 2024-01-10 | 0.4.1.2 | newhoggy, haskellworks, GeorgeWilson |
| hw-eliasfano | 21 | 0.0 | 2 | Elias-Fano | (bsd3, data, data-structures, library, program, succinct-data-structures) | 2022-03-25 | 0.1.2.1 | newhoggy, haskellworks |
| hw-excess | 40 | 0.0 | 3 | Excess | (bsd3, data, data-structures, library, succinct-data-structures) | 2020-04-14 | 0.2.3.0 | newhoggy, haskellworks |
| hw-fingertree | 22 | 0.0 | 5 | Generic finger-tree structure, with example instances | (bsd3, data-structures, library) | 2022-03-21 | 0.1.2.1 | newhoggy, haskellworks |
| hw-fingertree-strict | 27 | 0.0 | 2 | Generic strict finger-tree structure | (bsd3, data-structures, library) | 2022-03-25 | 0.1.2.1 | newhoggy, haskellworks |
| hw-json-lens | 10 | 0.0 | 2 | Lens for hw-json | (bsd3, data, data-structures, json, library, succinct-data-structures) | 2020-04-14 | 0.2.1.0 | newhoggy, haskellworks |
| hw-rankselect | 130 | 2.0 | 14 | Rank-select | (bit, bsd3, data, data-structures, library, program, succinct-data-structures) | 2022-03-23 | 0.13.4.1 | newhoggy, haskellworks, GeorgeWilson |
| hw-rankselect-base | 35 | 0.0 | 15 | Rank-select base | (bit, bsd3, data, data-structures, library, succinct-data-structures) | 2020-06-09 | 0.3.4.1 | newhoggy, haskellworks, GeorgeWilson |
| hw-xml | 36 | 2.25 | 1 | XML parser based on succinct data structures. | (bsd3, data, data-structures, library, program, succinct-data-structures, xml) | 2024-01-10 | 0.5.1.2 | newhoggy, haskellworks |
| igraph | 6 | 2.0 | 1 | Bindings to the igraph C library. | (bsd3, data-structures, graphs, library) | 2013-01-15 | 0.1.1 | NilsSchweinsberg |
| impure-containers | 27 | 0.0 | 1 | Mutable containers in Haskell. | (bsd3, data-structures, library) | 2020-02-14 | 0.5.1 | andrewthad, chessai |
| indexed-containers | 7 | 0.0 | 0 | Simple, no-frills indexed lists. | (bsd3, data-structures, library) | 2020-03-02 | 0.1.0.2 | zliu41 |
| int-like | 29 | 0.0 | 2 | Newtype wrappers over IntSet and IntMap | (bsd3, data-structures, library) | 2025-06-26 | 0.3.1 | ejconlon |
| intern | 106 | 2.0 | 18 | Efficient hash-consing for arbitrary data types | (bsd3, data, data-structures, library) | 2024-12-04 | 0.9.6 | EdwardKmett, ryanglscott |
| interval | 3 | 0.0 | 1 | Intervals with adherences. | (data-structures, gpl, library) | 2016-08-21 | 1.20160821 | julm |
| interval-patterns | 41 | 0.0 | 0 | Intervals, and monoids thereof | (algebra, bsd3, charts, data-structures, library, math, statistics) | 2025-06-20 | 0.8.1 | melaniebrown |
| interval-tree-clock | 9 | 2.0 | 0 | Interval Tree Clocks | (data, data-structures, distributed-computing, library, mit) | 2022-07-13 | 0.2.0.0 | arnemileswinter |
| intset-imperative | 4 | 0.0 | 1 | An imperative integer set written in Haskell. | (bsd3, data-structures, library) | 2018-08-03 | 0.1.0.0 | hverr |
| iterable | 15 | 0.0 | 2 | API for hierarchical multilevel collections. | (bsd3, data-structures, library) | 2014-05-19 | 3.0 | MichalGajda |
| ixset | 37 | 0.0 | 16 | Efficient relational queries on Haskell sets. | (bsd3, data-structures, library) | 2022-04-22 | 1.1.1.2 | DavidFox, JeremyShaw |
| ixset-typed | 46 | 0.0 | 12 | Efficient relational queries on Haskell sets. | (bsd3, data-structures, library) | 2022-05-10 | 0.5.1.0 | AndresLoeh |
| ixset-typed-binary-instance | 6 | 0.0 | 1 | Binary instance for ixset-typed. | (data-structures, library, mit) | 2020-08-28 | 0.1.0.2 | locallycompact |
| ixset-typed-conversions | 18 | 0.0 | 1 | Conversions from ixset-typed to other containers. | (data-structures, library, mit) | 2020-09-14 | 0.1.2.0 | locallycompact |
| ixset-typed-hashable-instance | 12 | 0.0 | 1 | Hashable instance for ixset-typed. | (data-structures, library, mit) | 2020-08-28 | 0.1.0.2 | locallycompact |
| javelin | 30 | 2.0 | 1 | Labeled one-dimensional arrays | (data, data-science, data-structures, library, mit, program) | 2025-03-02 | 0.1.4.2 | LaurentRDC |
| javelin-frames | 16 | 0.0 | 0 | Type-safe data frames based on higher-kinded types. | (data, data-science, data-structures, library, mit) | 2025-07-13 | 0.1.0.2 | LaurentRDC |
| javelin-io | 17 | 0.0 | 0 | IO operations for the `javelin` package | (data, data-science, data-structures, library, mit) | 2025-03-02 | 0.1.1.3 | LaurentRDC |
| justified-containers | 6 | 2.25 | 1 | Keyed container types with type-checked proofs of key presence. | (bsd2, data-structures, library) | 2018-02-11 | 0.3.0.0 | mnoonan |
| kan-extensions | 257 | 2.25 | 51 | Kan extensions, Kan lifts, the Yoneda lemma, and (co)density (co)monads | (bsd3, comonads, data-structures, functors, library, monads) | 2026-01-10 | 5.2.8 | EdwardKmett, EricMertens, ryanglscott |
| keys | 111 | 2.0 | 31 | Keyed functors and containers | (bsd3, containers, data-structures, library) | 2026-01-10 | 3.12.5 | EdwardKmett, EricMertens, ryanglscott |
| knead | 23 | 0.0 | 2 | Repa-like array processing using LLVM JIT | (bsd3, data-structures, library) | 2024-04-11 | 1.0.1.1 | HenningThielemann |
| knit | 13 | 0.0 | 0 | Ties the knot on data structures that reference each other by unique keys. | (bsd3, data-structures, library) | 2024-08-02 | 0.4.0.0 | pkamenarsky |
| known-lists | 2 | 0.0 | 0 | Easy type-level lists with term-level membership proofs. | (bsd3, data-structures, dependent-types, library, type-system) | 2026-01-30 | 0.1.0.0 | ShapeOfMatter |
| labeled-graph | 3 | 0.0 | 1 | Labeled graph structure | (bsd3, data-structures, library) | 2012-11-05 | 1.0.0.0 | JeanPhilippeBernardy |
| labeled-tree | 3 | 0.0 | 5 | Labeled tree structure | (bsd3, data-structures, library) | 2010-08-04 | 1.0.0.0 | JeanPhilippeBernardy |
| lca | 29 | 2.0 | 1 | O(log n) persistent online lowest common ancestor search without preprocessing | (algorithms, bsd3, data-structures, library) | 2021-02-17 | 0.4 | EdwardKmett, ryanglscott |
| libgraph | 28 | 0.0 | 3 | Store and manipulate data in a graph. | (algorithms, bsd3, data-structures, library) | 2017-09-03 | 1.14 | faddegon |
| linked-list-with-iterator | 1 | 2.0 | 1 | A pure linked list which is mutable through iterators. | (bsd3, data-structures, library) | 2016-09-29 | 0.1.1.0 | CindyLinz |
| list-t | 101 | 2.0 | 44 | ListT done right | (control, data-structures, library, mit, streaming) | 2023-10-11 | 1.0.5.7 | NikitaVolkov |
| list-tries | 75 | 0.0 | 10 | Tries and Patricia tries: finite sets and maps for list keys | (bsd3, data, data-structures, library) | 2024-09-03 | 0.6.7.1 | MattiNiemenmaa, arybczak |
| listlike-instances (deprecated in favor of ListLike) | 20 | 0.0 | 6 | Extra instances of the ListLike class | (bsd3, data-structures, deprecated, generics, library) | 2012-11-13 | 0.2.3.1 | JohnLato |
| loc | 51 | 2.0 | 1 | Line and column positions and ranges in text files | (apache, data-structures, library, text) | 2023-06-26 | 0.2.0.0 | chris_martin, Monoid_Mary |
| localization | 5 | 0.0 | 1 | Library for localization (l10n) | (data-structures, gpl, library) | 2018-02-27 | 1.0.1.20180226 | julm |
| magma | 34 | 0.0 | 1 | magma is an algebraic structure. | (algebra, bsd3, data, data-structures, library, math) | 2026-04-11 | 0.7.0.0 | KatsutoshiItoh |
| map-exts | 8 | 2.0 | 1 | Extensions to Data.Map | (bsd3, data-structures, library, program) | 2018-01-10 | 0.2.0.0 | coopercm |
| map-syntax | 16 | 2.0 | 15 | Syntax sugar for defining maps | (bsd3, data-structures, library) | 2018-04-03 | 0.3 | DougBeardsley |
| mappings | 58 | 0.0 | 0 | Types which represent functions k -> v | (bsd3, data-structures, library, program) | 2026-02-20 | 0.4.0.0 | jcranch |
| massiv | 163 | 2.5 | 18 | Massiv (Массив) is an Array Library. | (array, bsd3, data, data-structures, library, parallelism) | 2025-05-31 | 1.0.5.0 | lehins |
| massiv-io | 73 | 2.0 | 3 | Import/export of Image files into massiv Arrays | (bsd3, data, data-structures, library) | 2021-10-23 | 1.0.0.1 | lehins |
| massiv-persist | 14 | 0.0 | 0 | Compatibility of 'massiv' with 'persist' | (array, bsd3, data-structures, library, serialization) | 2022-07-05 | 1.0.0.3 | lehins |
| massiv-serialise | 15 | 2.0 | 0 | Compatibility of 'massiv' with 'serialise' | (array, bsd3, data-structures, library, serialization) | 2021-11-25 | 1.0.0.2 | lehins |
| massiv-test | 49 | 0.0 | 0 | Library that contains generators, properties and tests for Massiv Array Library. | (bsd3, data, data-structures, library, parallelism) | 2025-01-12 | 1.1.0.1 | lehins |
| megastore | 17 | 0.0 | 0 | Bulk image or strict bytestring storage | (bsd3, data, data-structures, image, library) | 2026-03-24 | 0.1.1.2 | MilesLitteral |
| meldable-heap | 26 | 0.0 | 1 | Asymptotically optimal, Coq-verified meldable heaps, AKA priority queues | (bsd3, data-structures, library) | 2010-05-23 | 2.0.3 | JimApple |
| merkle-patricia-db | 1 | 0.0 | 1 | A modified Merkle Patricia DB | (apache, data-structures, library) | 2017-09-01 | 0.1.0 | jamshid |
| min-max-pqueue | 10 | 0.0 | 0 | Double-ended priority queues. | (bsd3, data-structures, library) | 2020-06-25 | 0.1.0.2 | zliu41 |
| miso | 162 | 2.25 | 8 | A tasty Haskell front-end web framework | (bsd3, data-structures, library, miso, web) | 2026-04-02 | 1.9.0.0 | DavidJohnson |
| miso-examples | 47 | 0.0 | 0 | A tasty Haskell front-end web framework | (bsd3, data-structures, miso, web) | 2025-02-11 | 1.8.7.0 | DavidJohnson |
| monadic-arrays | 25 | 0.0 | 1 | Boxed and unboxed arrays for monad transformers | (bsd3, data-structures, library) | 2016-01-17 | 0.2.2 | EdwardKmett |
| mono-traversable-keys | 5 | 0.0 | 1 | Type-classes for interacting with monomorphic containers with a key | (bsd3, containers, data, data-structures, library) | 2023-05-05 | 0.3.0 | recursion_ninja |
| monoidmap | 102 | 1.5 | 4 | Monoidal map type | (apache, data-structures, library, monoidal) | 2026-04-19 | 0.0.5.1 | JonathanKnowles |
| monoidmap-aeson | 31 | 0.0 | 0 | JSON support for monoidmap. | (apache, data-structures, library) | 2026-04-19 | 0.0.0.7 | JonathanKnowles |
| monoidmap-examples | 5 | 0.0 | 0 | Examples for monoidmap. | (apache, data-structures, library) | 2026-04-19 | 0.0.0.2 | JonathanKnowles |
| monoidmap-hashable | 3 | 0.0 | 0 | Hashing support for monoidmap. | (apache, data-structures, library) | 2026-04-19 | 0.0.0.1 | JonathanKnowles |
| monoidmap-internal | 9 | 0.0 | 1 | Internal support for monoidmap. | (apache, data-structures, library) | 2026-04-19 | 0.1.0.2 | JonathanKnowles |
| monoidmap-quickcheck | 14 | 0.0 | 0 | QuickCheck support for monoidmap. | (apache, data-structures, library) | 2026-04-19 | 0.0.0.4 | JonathanKnowles |
| monus-weighted-search | 1 | 2.0 | 0 | Efficient search weighted by an ordered monoid with monus. | (data-structures, library, mit) | 2021-08-29 | 0.1.0.0 | oisdk |
| more-containers | 21 | 0.0 | 1 | A few more collections | (data-structures, library, mit) | 2021-04-05 | 0.2.2.2 | mtth |
| multi-containers | 17 | 0.0 | 0 | A few multimap variants. | (bsd3, data-structures, library) | 2021-07-09 | 0.2 | zliu41 |
| multimap | 17 | 0.0 | 13 | A multimap. | (data-structures, library, mit) | 2013-06-01 | 1.2.1 | JulianFleischer |
| multiset | 40 | 0.0 | 21 | The Data.MultiSet container type | (bsd3, data-structures, library) | 2019-12-15 | 0.3.4.3 | TwanVanLaarhoven |
| naperian | 4 | 0.0 | 1 | Efficient representable functors | (bsd3, data-structures, library) | 2017-08-21 | 0.1.0.0 | AaronVargo |
| nested-sequence | 5 | 0.0 | 1 | List-like data structures with O(log(n)) random access | (bsd3, data, data-structures, library) | 2016-07-09 | 0.2 | BalazsKomuves |
| nested-sets | 6 | 0.0 | 2 | Nested set model implementation | (data-structures, gpl, library) | 2014-10-11 | 0.0.1.1 | rakatan |
| nibblestring | 9 | 0.0 | 4 | Packed, strict nibble arrays with a list interface (ByteString for nibbles) | (bsd3, data-structures, library) | 2015-01-02 | 0.0.3 | jamshid |
| nonempty-containers | 38 | 2.25 | 13 | Non-empty variants of containers data types, with full API | (bsd3, data-structures, library) | 2025-05-20 | 0.3.5.0 | jle |
| nonempty-zipper | 25 | 0.0 | 1 | A non-empty comonadic list zipper | (data, data-structures, library, mit) | 2025-01-14 | 1.0.1.1 | PatrickBrisbin, dukerutledge, mjgpy3, chris_martin, FreckleEngineering, OlaoluwaM |
| nonemptymap | 24 | 0.0 | 1 | A NonEmptyMap Implementation | (bsd3, data-structures, library) | 2018-11-10 | 0.0.6.0 | ChristopherDavenport |
| nspace | 5 | 0.0 | 0 | Efficient, infinite-precision 2D and 3D spatial containers. | (bsd3, data-structures, library) | 2024-01-01 | 0.2.0.0 | isovector |
| nthable | 3 | 0.0 | 1 | (bsd3, data-structures, library) | 2009-02-09 | 0.1 | GeorgePollard | |
| overeasy | 6 | 0.0 | 0 | A purely functional E-Graph library | (bsd3, data-structures, library) | 2022-10-04 | 0.2.0 | ejconlon |
| pangraph | 11 | 0.0 | 2 | A set of parsers for graph languages and conversions to graph libaries. | (bsd3, data-structures, graphs, library, parser) | 2018-10-05 | 0.2.1 | thisiswhereitype |
| parameterized-utils | 61 | 2.0 | 16 | Classes and data structures for working with data-kind indexed types | (bsd3, data-structures, dependent-types, library) | 2026-03-09 | 2.3.0.0 | KevinQuick, RobertDockins, ryanglscott, galoisinc, mccleeary, sauclovian_g, aschwerdfeger_galois |
| partialord | 26 | 0.0 | 1 | Data structure supporting partial orders | (bsd3, data-structures, library) | 2025-05-13 | 0.1.1 | jcranch |
| path-tree | 3 | 0.0 | 1 | `Data.Tree` for file paths | (data-structures, library, mit) | 2022-04-03 | 0.2.0.0 | sridca |
| pedestrian-dag | 6 | 0.0 | 4 | A pedestrian implementation of directed acyclic graphs | (bsd3, data, data-structures, library) | 2018-09-19 | 0.2.0 | JakubWaszczuk |
| perfect-hash-generator | 27 | 2.25 | 0 | Perfect minimal hashing implementation in native Haskell | (apache, data-structures, embedded, library, program) | 2022-06-27 | 1.0.0 | kostmo |
| perfecthash | 7 | 0.0 | 1 | A perfect hashing library for mapping bytestrings to values. | (bsd3, data, data-structures, library) | 2016-05-02 | 0.2.0 | MarkWotton |
| permutation | 41 | 0.0 | 5 | A library for permutations and combinations. | (bsd3, data-structures, library, math) | 2015-01-20 | 0.5.0.5 | PatrickPerry, spacekitteh |
| pomaps | 40 | 0.0 | 1 | Maps and sets of partial orders | (data-structures, library, mit) | 2021-02-07 | 0.2.0.1 | sgraf812 |
| pqueue | 89 | 0.0 | 18 | Reliable, persistent, fast priority queues. | (bsd3, data-structures, library) | 2026-04-16 | 1.7.0.0 | LouisWasserman, lspitzner, dfeuer, konsumlamm |
| primitive-containers | 18 | 0.0 | 3 | containers backed by arrays | (bsd3, data-structures, library) | 2023-07-05 | 0.5.1 | andrewthad |
| provide | 2 | 0.0 | 0 | Lightweight dependency injection / namespaced+typed implicit-ish arguments | (bsd3, data-structures, library) | 2024-11-24 | 0.1.0.0 | RyanTrinkle |
| psqueues | 91 | 2.5 | 40 | Pure priority search queues | (bsd3, data-structures, library) | 2025-12-28 | 0.2.8.3 | JasperVanDerJeugt |
| q4c12-twofinger | 13 | 0.0 | 1 | Efficient alternating finger trees | (bsd2, data-structures, library) | 2018-01-17 | 0.2 | quasicomputational |
| quickset | 3 | 0.0 | 1 | Very fast and memory-compact query-only set and map structures | (bsd3, data, data-structures, library) | 2012-11-14 | 0.1.0 | ErtugrulSoeylemez, esz |
| r-tree | 1 | 0.0 | 0 | R-/R*-trees. | (data-structures, library, mit) | 2024-09-08 | 1.0.0.0 | OleksiiDivak |
| radix-tree | 13 | 2.25 | 2 | Radix trees | (bsd3, data-structures, library) | 2024-10-25 | 1.1.0.0 | SergeyVinokurov, OleksiiDivak |
| ralist | 33 | 0.0 | 2 | Random access list with a list compatible interface. | (bsd3, data-structures, library) | 2026-03-17 | 0.4.1.0 | CarterSchonwald, LennartAugustsson |
| random-access-list | 4 | 0.0 | 1 | Random-access lists in Haskell | (bsd3, data-structures, library) | 2008-06-16 | 0.2 | StephanFriedrichs |
| random-tree | 4 | 0.0 | 1 | Create random trees | (data-structures, gpl, library) | 2016-02-09 | 0.6.0.5 | GregorySchwartz |
| randproc | 4 | 0.0 | 1 | Data structures and support functions for working with random processes | (bsd3, data-structures, library) | 2011-07-03 | 0.4 | DavidBanas |
| rational-list | 1 | 0.0 | 0 | finite or repeating lists | (bsd3, data-structures, library) | 2019-10-20 | 1.0.0.0 | RossPaterson |
| rbst | 3 | 0.0 | 0 | Randomized Binary Search Trees | (data-structures, library, mit) | 2020-05-09 | 0.0.0.1 | ArnauAbella |
| record | 91 | 0.0 | 6 | Anonymous records | (control, data-structures, library, mit, records) | 2016-10-24 | 0.4.2 | NikitaVolkov |
| reflection-without-remorse | 17 | 0.0 | 1 | Efficient free and operational monads. | (bsd3, data, data-structures, library) | 2014-12-30 | 0.9.5 | AtzeVanDerPloeg |
| relacion | 2 | 0.0 | 1 | A relation data structure. | (bsd3, data-structures, library) | 2010-11-15 | 0.1 | LeonelFonseca |
| relation | 19 | 0.0 | 2 | A data structure representing Relations on Sets. | (bsd3, data-structures, library) | 2020-04-14 | 0.5.2.0 | newhoggy, haskellworks |
| repa | 96 | 2.0 | 49 | High performance, regular, shape polymorphic parallel arrays. | (bsd3, data-structures, library) | 2024-12-08 | 3.4.2.0 | BasVanDijk, BenLippmeier, PepeIborra, TrevorMcDonell, vmchale, LaurentRDC |
| repa-algorithms | 58 | 0.0 | 2 | Algorithms using the Repa array library. | (bsd3, data-structures, library) | 2024-12-08 | 3.4.2.0 | BasVanDijk, BenLippmeier, PepeIborra, TrevorMcDonell, vmchale, LaurentRDC |
| repa-array | 23 | 0.0 | 2 | Bulk array representations and operators. | (bsd3, data-structures, library) | 2016-06-18 | 4.2.3.1 | BasVanDijk, BenLippmeier, PepeIborra, TrevorMcDonell, LaurentRDC |
| repa-bytestring | 18 | 0.0 | 3 | (deprecated) | (bsd3, data-structures, library) | 2012-04-03 | 3.0.0.1 | BasVanDijk, BenLippmeier, TrevorMcDonell |
| repa-convert | 32 | 0.0 | 3 | Packing and unpacking flat tables. | (bsd3, data-structures, library) | 2025-01-11 | 4.2.4.0 | BasVanDijk, BenLippmeier, PepeIborra, TrevorMcDonell, LaurentRDC |
| repa-devil (deprecated in favor of friday) | 34 | 0.0 | 4 | Support for image reading and writing of Repa arrays using in-place FFI calls | (bsd3, data-structures, deprecated, library) | 2015-04-13 | 0.3.2.6 | DonaldStewart, RaphaelJavaux, ThomasDuBuisson |
| repa-eval | 12 | 0.0 | 3 | Low-level parallel operators on bulk random-accessble arrays. | (bsd3, data-structures, library) | 2024-12-20 | 4.2.4.0 | BasVanDijk, BenLippmeier, PepeIborra, TrevorMcDonell, LaurentRDC |
| repa-examples | 84 | 0.0 | 1 | Examples using the Repa array library. | (bsd3, data-structures, program) | 2024-12-08 | 3.4.2.0 | BasVanDijk, BenLippmeier, PepeIborra, TrevorMcDonell, vmchale, LaurentRDC |
| repa-fftw | 10 | 0.0 | 1 | Perform fft with repa via FFTW | (bsd3, data-structures, library) | 2013-12-21 | 3.2.3.2 | AtsuroHoshino |
| repa-flow | 23 | 0.0 | 1 | Data-parallel data flows. | (bsd3, data-structures, library) | 2016-06-18 | 4.2.3.1 | BasVanDijk, BenLippmeier, PepeIborra, TrevorMcDonell, LaurentRDC |
| repa-io | 40 | 0.0 | 1 | Read and write Repa arrays in various formats. | (bsd3, data-structures, library) | 2024-12-08 | 3.4.2.0 | BasVanDijk, BenLippmeier, PepeIborra, TrevorMcDonell, vmchale, LaurentRDC |
| repa-plugin | 2 | 0.0 | 1 | Data Flow Fusion GHC Plugin. | (bsd3, data-structures, library) | 2013-07-26 | 1.0.0.1 | BasVanDijk, BenLippmeier, LaurentRDC |
| repa-scalar | 37 | 0.0 | 4 | Scalar data types and conversions. | (bsd3, data-structures, library) | 2024-12-17 | 4.2.4.0 | BasVanDijk, BenLippmeier, PepeIborra, TrevorMcDonell, vmchale, LaurentRDC |
| repa-series | 3 | 0.0 | 1 | Series Expressionss API | (bsd3, data-structures, library) | 2013-07-26 | 1.0.0.1 | BasVanDijk, BenLippmeier, PepeIborra, TrevorMcDonell, LaurentRDC |
| repa-sndfile | 3 | 0.0 | 1 | Reading and writing sound files with repa arrays | (bsd3, data-structures, library) | 2013-12-21 | 3.2.3.3 | AtsuroHoshino |
| repa-stream | 19 | 0.0 | 3 | Stream functions not present in the vector library. | (bsd3, data-structures, library) | 2016-06-18 | 4.2.3.1 | BasVanDijk, BenLippmeier, PepeIborra, TrevorMcDonell, LaurentRDC |
| representable-functors (deprecated in favor of adjunctions) | 122 | 0.0 | 10 | Representable functors | (bsd3, data-structures, deprecated, functors, library, monads) | 2013-10-13 | 3.2.0.2 | EdwardKmett, EricMertens, ryanglscott, AaronVargo |
| representable-tries | 139 | 0.0 | 2 | Tries from representations of polynomial functors | (bsd3, comonads, data-structures, functors, library, monads) | 2013-01-06 | 3.0.2 | EdwardKmett |
| rle | 3 | 0.0 | 0 | A data type of run-length-encoded lists | (apache, data-structures, library) | 2021-09-17 | 0.1.0.1 | AndrewPritchard |
| rosezipper | 2 | 2.0 | 9 | Generic zipper implementation for Data.Tree | (bsd3, data-structures, library) | 2010-06-06 | 0.2 | EricKow, IavorDiatchki |
| row-types | 32 | 0.0 | 16 | Open Records and Variants | (data, data-structures, library, mit) | 2021-09-10 | 1.0.1.2 | dwincort |
| row-types-aeson | 6 | 0.0 | 0 | aeson instances for Open Records and Variants | (data, data-structures, library, mit) | 2022-07-10 | 1.1.0.0 | dwincort |
| row-types-barbies | 4 | 0.0 | 0 | barbies instances for Open Records and Variants | (data, data-structures, library, mit) | 2021-09-26 | 1.0.0.0 | dwincort |
| rp-tree | 29 | 2.0 | 0 | Random projection trees | (bsd3, data, data-mining, data-structures, library, machine-learning, program) | 2021-11-04 | 0.7.1 | ocramz |
| rrb-vector | 24 | 0.0 | 1 | Efficient RRB-Vectors | (bsd3, data-structures, library) | 2024-07-17 | 0.2.2.1 | konsumlamm |
| rstream | 4 | 0.0 | 1 | stream-fusion framework from vector | (bsd3, data, data-structures, library) | 2018-11-01 | 0.1.0.0 | chessai |
| sdp | 14 | 0.0 | 9 | Simple Data Processing | (bsd3, data-structures, library) | 2021-12-10 | 0.2.1.1 | AndreyMulik |
| sdp-binary | 7 | 0.0 | 0 | Binary instances for SDP | (bsd3, data-structures, library) | 2021-02-23 | 0.2 | AndreyMulik |
| sdp-deepseq | 4 | 0.0 | 0 | DeepSeq SDP extension. | (bsd3, data-structures, library) | 2021-02-19 | 0.2 | AndreyMulik |
| sdp-hashable | 3 | 0.0 | 1 | Hashable instances for SDP | (bsd3, data-structures, library) | 2021-02-19 | 0.2 | AndreyMulik |
| sdp-io | 5 | 0.0 | 2 | SDP IO extension | (bsd3, data-structures, library) | 2021-02-24 | 0.2 | AndreyMulik |
| sdp-quickcheck | 4 | 0.0 | 0 | SDP QuickCheck support | (bsd3, data-structures, library) | 2021-02-19 | 0.2 | AndreyMulik |
| sdp4bytestring | 4 | 0.0 | 0 | SDP wrapper for ByteString. | (bsd3, data-structures, library) | 2021-02-24 | 0.2 | AndreyMulik |
| sdp4text | 6 | 0.0 | 0 | SDP wrapper for Text. | (bsd3, data-structures, library) | 2021-02-24 | 0.2 | AndreyMulik |
| sdp4unordered | 5 | 0.0 | 0 | SDP classes for unordered containers | (bsd3, data-structures, library) | 2021-02-23 | 0.2 | AndreyMulik |
| sdp4vector | 3 | 0.0 | 0 | SDP wrapper for Vector | (bsd3, data-structures, library) | 2021-02-19 | 0.2 | AndreyMulik |
| selections | 27 | 0.0 | 1 | Combinators for operating with selections over an underlying functor | (bsd3, data-structures, functors, library) | 2020-10-21 | 0.3.0.0 | ChrisPenner |
| semigroups | 218 | 2.75 | 912 | Anything that associates | (algebra, bsd3, data, data-structures, library, math) | 2026-01-10 | 0.20.1 | EdwardKmett, EricMertens, HerbertValerioRiedel, ryanglscott |
| semigroups-actions | 5 | 0.0 | 1 | Semigroups actions | (algebra, bsd3, data, data-structures, library, math) | 2012-12-20 | 0.1 | PetrPudlak |
| semilattices | 35 | 0.0 | 2 | Semilattices | (algebra, bsd3, data, data-structures, library, math) | 2025-09-22 | 0.0.0.9 | robrix |
| semirings | 95 | 2.0 | 18 | two monoids as one, in holy haskimony | (algebra, bsd3, data, data-structures, library, math, mathematics, maths) | 2024-05-21 | 0.7 | chessai |
| seqn | 4 | 0.0 | 0 | Sequences and measured sequences | (bsd3, data-structures, library) | 2024-07-12 | 0.1.1.0 | meooow |
| sequence | 45 | 0.0 | 3 | A type class for sequences and various sequence data structures. | (bsd3, data, data-structures, library) | 2021-08-15 | 0.9.9.0 | AtzeVanDerPloeg, dfeuer |
| signed-multiset | 26 | 0.0 | 1 | Multisets with negative membership. | (bsd3, data-structures, library) | 2023-01-13 | 0.5 | StefanHoldermans, rieckenj |
| sirkel | 4 | 0.0 | 1 | Sirkel, a Chord DHT | (bsd3, concurrency, concurrent, data-structures, database, distributed-computing, library) | 2011-09-16 | 0.1 | MortenLysgaard |
| slist | 26 | 2.25 | 1 | Sized list | (data-structures, library, list, mpl) | 2026-01-16 | 0.3.0.0 | vrom911 |
| sparse-merkle-trees | 6 | 0.0 | 0 | Sparse Merkle trees with proofs of inclusion and exclusion | (bsd3, cryptography, data-structures, library) | 2022-05-26 | 0.2.0.0 | tochicool |
| sparsebit | 24 | 0.0 | 1 | Sparse bitmaps for pattern match coverage | (bsd3, data-structures, development, library) | 2009-03-10 | 0.5 | KiYungAhn |
| splay | 18 | 2.0 | 1 | Generic splay-based sequence representation | (bsd3, data-structures, library) | 2015-07-12 | 0.0.6 | dramforever |
| spool | 3 | 0.0 | 7 | Convert between ByteString and Vector.Storable without copying | (bsd3, data-structures, library) | 2011-09-15 | 0.1 | KeeganMcAllister |
| srtree | 58 | 0.0 | 2 | A general library to work with Symbolic Regression expression trees. | (bsd3, data, data-structures, library, math, program) | 2026-04-19 | 2.0.1.8 | olivetti |
| stable-heap | 10 | 0.0 | 1 | Purely functional stable heaps (fair priority queues) | (data-structures, library, mit) | 2025-12-10 | 0.3.0.0 | JakeMcArthur |
| statethread | 7 | 0.0 | 2 | The ST monad and STRefs | (bsd3, data-structures, library, monads) | 2012-04-07 | 0.1.1 | HenningThielemann |
| static-hash | 5 | 0.0 | 2 | Immutable hash | (bsd3, data-structures, library) | 2022-08-22 | 0.0.2 | KazuYamamoto |
| stm-containers | 131 | 2.0 | 37 | Containers for STM | (concurrency, data-structures, library, mit, stm) | 2026-01-04 | 1.2.2 | NikitaVolkov |
| stm-hamt | 70 | 0.0 | 1 | STM-specialised Hash Array Mapped Trie | (concurrency, data-structures, library, mit, stm) | 2026-01-13 | 1.2.2.1 | NikitaVolkov |
| strict-containers | 17 | 2.0 | 2 | Strict containers. | (bsd3, data, data-structures, library) | 2024-08-05 | 0.2.1 | ErikDeCastroLopo, infinity0 |
| strict-containers-lens | 11 | 0.0 | 0 | Strict containers - Lens instances | (bsd3, data, data-structures, lenses, library) | 2022-12-12 | 0.2 | ErikDeCastroLopo, infinity0 |
| strict-containers-serialise | 4 | 0.0 | 0 | Strict containers - Serialise instances | (bsd3, codec, data, data-structures, library) | 2022-12-12 | 0.2 | ErikDeCastroLopo, infinity0 |
| subwordgraph | 8 | 0.0 | 1 | Subword graph implementation | (bsd3, data-structures, library) | 2016-06-07 | 1.0.2 | adambak |
| subzero | 24 | 0.0 | 1 | Helps when going "seed values" -> alternatives and optional -> answers | (data-structures, gpl, library) | 2017-12-10 | 0.1.0.8 | codeshot |
| suffix | 6 | 0.0 | 0 | Suffix arrays and friends | (bsd3, data-structures, library) | 2024-08-04 | 0.1.0.0 | meooow |
| suffix-array | 3 | 0.0 | 0 | Simple and moderately efficient suffix array implementation | (bsd3, data-structures, library, program) | 2017-01-11 | 0.3.0.0 | kadoban |
| suffixtree | 21 | 0.0 | 3 | Efficient, lazy suffix tree implementation | (bsd3, data, data-structures, library) | 2011-10-17 | 0.2.2.1 | BryanOSullivan |
| swapper | 5 | 0.0 | 1 | Transparently swapping data from in-memory structures to disk | (bsd3, data-structures, library) | 2011-08-29 | 0.1 | RomanSmrz |
| symantic-base | 15 | 0.0 | 2 | Basic symantic combinators for Embedded Domain-Specific Languages (EDSL) | (agpl, data-structures, library) | 2023-01-25 | 0.5.0.20221211 | julm |
| symbolise (deprecated in favor of symbolize) | 3 | 0.0 | 0 | You want Symbolize with a Z | (bsd3, data, data-structures, deprecated, library) | 2025-03-02 | 0.0.0.1 | qqwy |
| symbolize | 24 | 0.0 | 0 | Efficient global Symbol table, with Garbage Collection. | (bsd3, data, data-structures, library) | 2025-03-02 | 1.0.3.1 | qqwy |
| tangle | 8 | 0.0 | 0 | Heterogenous memoisation monad | (bsd3, data-structures, library, monad, program) | 2021-11-08 | 0.1 | FumiakiKinoshita |
| text-compression | 46 | 2.0 | 0 | A text compression library. | (bsd3, data-structures, library) | 2022-12-09 | 0.1.0.25 | DavidFox, MatthewMosior |
| text-containers | 2 | 0.0 | 0 | Memory-efficient string-indexed container types. | (data, data-structures, gpl, library) | 2017-10-13 | 0.1.0.0 | HerbertValerioRiedel |
| text-trie | 0 | 0.0 | 1 | An efficient finite map from Text to values, based on bytestring-trie. | (bsd3, data, data-structures, library) | 2019-04-11 | 0.2.5.0 | lambdamichael |
| thrist | 44 | 0.0 | 2 | Type-threaded list | (bsd3, categories, data-structures, library) | 2018-11-15 | 0.4 | GaborGreif |
| tie-knot | 5 | 0.0 | 1 | "Ties the knot" on a given set of structures that reference each other by keys. | (data-structures, library, recursion) | 2012-12-07 | 0.2 | PetrPudlak |
| total-maps | 13 | 0.0 | 1 | Dense and sparse total maps. | (containers, data, data-structures, library, mit) | 2015-11-19 | 1.0.0.3 | pawel834 |
| translatable-intset | 3 | 0.0 | 1 | Integer sets with a constant time translate operation. | (data-structures, library, mit) | 2011-02-04 | 0.1 | JannisHarder |
| treap | 5 | 0.0 | 0 | Efficient implementation of the implicit treap data structure | (data-structures, library, mpl, tree) | 2019-04-29 | 0.0.0.0 | vrom911 |
| treemap | 6 | 0.0 | 1 | A tree of Data.Map. | (data-structures, gpl, library) | 2018-02-14 | 2.4.0.20180213 | julm |
| treeseq | 4 | 0.0 | 3 | Library for a multi-way tree (rose tree), using Seq (finger tree) for forests | (data-structures, gpl, library) | 2018-02-14 | 1.0.0.20180213 | julm |
| trial | 3 | 0.0 | 4 | Trial Data Structure | (data, data-structures, library, mpl) | 2020-06-21 | 0.0.0.0 | tomjaguarpaw, vrom911 |
| trial-tomland | 6 | 0.0 | 1 | Trial helper functions for tomland | (data, data-structures, library, mpl) | 2020-06-21 | 0.0.0.0 | tomjaguarpaw, vrom911 |
| trie-simple | 16 | 0.0 | 1 | Simple Map-based Trie | (bsd3, data-structures, library) | 2025-02-23 | 0.4.4 | viercc |
| tst | 6 | 0.0 | 2 | BK-tree implementation | (data-structures, library, public-domain) | 2012-10-29 | 0.1.1 | FrancescoMazzoli |
| type-aligned | 19 | 0.0 | 6 | Various type-aligned sequence data structures. | (bsd3, data, data-structures, library) | 2014-12-30 | 0.9.6 | AtzeVanDerPloeg, dfeuer |
| type-indexed-queues | 10 | 0.0 | 1 | Queues with verified and unverified versions. | (data-structures, library, mit) | 2017-04-27 | 0.2.0.0 | oisdk |
| type-level-bst | 3 | 0.0 | 1 | type-level binary search trees in haskell | (bsd3, data-structures, dependent-types, library) | 2014-10-28 | 0.1 | Kinokkory |
| type-level-sets | 17 | 2.0 | 5 | Type-level sets and finite maps (with value-level counterparts) | (bsd3, data-structures, library, type-system) | 2018-11-29 | 0.8.9.0 | DominicOrchard |
| typerep-map | 34 | 2.5 | 9 | Efficient implementation of a dependent map with types as keys | (data, data-structures, library, mpl, types) | 2026-01-14 | 0.7.0.0 | vrom911 |
| unboxing-vector | 7 | 0.0 | 3 | A newtype-friendly variant of unboxed vectors | (bsd3, data, data-structures, library) | 2020-09-27 | 0.2.0.0 | aratamizuki |
| unordered-graphs | 11 | 0.0 | 1 | Graph library using unordered-containers | (data-structures, graphs, library, mit) | 2016-07-19 | 0.1.0.1 | IvanMiljenovic |
| vary | 15 | 2.0 | 0 | Vary: Friendly and fast polymorphic variants (open unions/coproducts/extensible sums) | (data, data-structures, error-handling, library, mit) | 2025-06-17 | 0.1.1.3 | qqwy |
| vector | 162 | 2.75 | 2205 | Efficient Arrays | (bsd3, data, data-structures, library) | 2024-10-31 | 0.13.2.0 | AlexeyKhudyakov, lehins, Bodigrim, topos |
| vector-clock | 21 | 0.0 | 1 | Vector clocks for versioning message flows | (data, data-structures, distributed-computing, gpl, library) | 2013-06-23 | 0.2.2 | AlexandruScvortov, hansonkd |
| vector-endian | 4 | 0.0 | 0 | Storable vectors with cpu-independent representation. | (data, data-structures, library, mit) | 2019-04-22 | 0.1.0.0 | isd |
| vector-functorlazy | 5 | 0.0 | 1 | vectors that perform the fmap operation in constant time | (bsd3, data, data-structures, library) | 2013-07-05 | 0.0.1 | MikeIzbicki |
| vector-heterogenous | 22 | 0.0 | 2 | A type-safe library for vectors whose elements can be of any type, or any type satisfying some constraints | (bsd3, data, data-structures, library) | 2014-10-17 | 0.2.0 | MikeIzbicki |
| vector-instances | 80 | 2.0 | 20 | Orphan Instances for 'Data.Vector' | (bsd3, data, data-structures, library) | 2025-06-01 | 3.4.3 | EdwardKmett, ryanglscott |
| vector-mmap | 10 | 0.0 | 1 | Memory map immutable and mutable vectors | (bsd3, data, data-structures, library) | 2017-06-30 | 0.0.3 | DanielPeebles, fho |
| vector-read-instances (deprecated in favor of vector) | 4 | 0.0 | 3 | (deprecated) Read instances for 'Data.Vector' | (bsd3, data, data-structures, deprecated, library) | 2011-08-29 | 0.0.2.0 | ChristianHoener |
| vector-rotcev | 8 | 0.0 | 0 | Vectors with O(1) reverse | (bsd3, data, data-structures, library) | 2023-01-14 | 0.1.0.2 | Bodigrim |
| vector-split | 18 | 0.0 | 3 | Combinator library for splitting vectors. | (data, data-structures, library, mit) | 2025-06-16 | 1.0.0.4 | fho |
| vector-static (deprecated) | 16 | 0.0 | 1 | Statically checked sizes on Data.Vector | (bsd3, data, data-structures, deprecated, library) | 2010-11-11 | 0.3.0.1 | DanielPeebles, JakeMcArthur |
| vector-stream | 11 | 0.0 | 4 | Efficient Streams | (bsd3, data, data-structures, library) | 2024-01-06 | 0.1.0.1 | AlexeyKhudyakov, lehins, Bodigrim |
| void | 77 | 2.25 | 134 | A Haskell 98 logically uninhabited data type | (bsd3, data-structures, library) | 2025-12-08 | 0.7.4 | EdwardKmett, phadej, ryanglscott |
| vp-tree | 5 | 0.0 | 0 | Vantage Point Trees | (bsd3, data, data-mining, data-structures, library, machine-learning) | 2021-04-30 | 0.1.0.1 | ocramz |
| yarr | 30 | 0.0 | 2 | Yet another array library | (data-flow, data-structures, graphics, library, mit) | 2016-06-06 | 1.4.0.2 | DominicSteinitz, RomanLeventov |