10

8

6

4

2


10.0

8.1
miso

9.9

9.8
Agda

9.8

6.3
containers

9.7

8.2
vinyl

9.6

7.3
singletons

9.5

2.8
repa-scalar

100 Data Structures packages and projects

  • miso

    10.0 8.1 Haskell
    A tasty Haskell front-end framework

  • Agda

    9.9 9.8 Haskell
    A dependently typed functional programming language and proof assistant

  • containers

    9.8 6.3 Haskell
    Assorted concrete container types

  • vinyl

    9.7 8.2 Haskell
    Extensible Records

  • singletons

    9.6 7.3 Haskell
    A framework for generating singleton types

  • repa-scalar

    9.5 2.8 Haskell
    Scalar data types and conversions.

  • repa-convert

    9.5 2.8 Haskell
    Packing and unpacking flat tables.

  • repa-eval

    9.5 2.8 Haskell
    Low-level parallel operators on bulk random-accessble arrays.

  • exposed-containers

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

  • repa-array

    9.5 2.8 Haskell
    Bulk array representations and operators.

  • cubical

    9.4 0.0 Haskell
    Implementation of Univalence in Cubical Sets

  • parameterized-utils

    9.1 8.1 Haskell
    Classes and data structures for working with data-kind indexed types

  • ethereum-client-haskell

    9.0 0.0 Haskell
    A Haskell version of an Ethereum client

  • psqueues

    8.9 3.1 Haskell
    Pure priority search queues

  • bookkeeper

    8.8 0.0 Haskell
    Anonymous records and overloaded labels

  • hoq

    8.8 0.0 Haskell
    A language based on homotopy type theory with an interval type

  • distributive

    8.7 3.8 Haskell
    Distributive functors -- Dual to Traversable

  • clafer

    8.6 1.4 Haskell
    Compiles Clafer models to other formats

  • type-level-sets

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

  • EdisonAPI

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

  • slist

    8.1 5.7 Haskell
    Sized list

  • justified-containers

    8.0 0.7 Haskell
    Keyed container types with verified keys.

  • void

    7.9 0.0 Haskell
    A Haskell 98 logically uninhabited data type

  • hamtmap

    7.8 0.0 Haskell
    A purely functional and persistent hash map

  • multiset

    7.6 3.9 Haskell
    The Data.MultiSet container type

  • bitset

    7.6 0.0 Haskell
    A space-efficient set data structure.

  • heaps

    7.5 4.8 Haskell
    Asymptotically optimal Brodal/Okasaki heaps.

  • ixset-typed

    7.3 2.0 Haskell
    Efficient relational queries on Haskell sets.

  • rawr

    7.2 0.0 Haskell
    Anonymous extensible records

  • bytestring-trie

    7.2 6.2 Haskell
    An efficient finite map from (byte)strings to values.

  • claferIG

    7.1 0.0 Haskell
    claferIG is an interactive tool that generates instances of Clafer models.

  • graphite

    6.9 4.1 Haskell
    Graphs and networks library

  • hw-fingertree-strict

    6.8 5.6 Haskell
    Generic strict finger-tree structure

  • map-exts

    6.8 2.0 Haskell
    Extensions to Data.Map

  • eliminators

    6.8 5.4 Haskell
    Dependently typed elimination functions using singletons

  • data-r-tree

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

  • nonempty-containers

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

  • mtl-c

    6.4 0.0 Haskell
    Very strict CPS'd transformers

  • igraph

    6.3 0.0 Haskell
    Bindings to the igraph C library.

  • supermonad

    6.2 0.6 Haskell
    Plugin and base library to support supermonads in Haskell

  • map-syntax

    6.2 2.5 Haskell
    Syntax sugar for defining maps

  • helf

    6.1 1.2 Haskell
    Typechecking terms of the Edinburgh Logical Framework (LF).

  • regional-pointers

    6.0 0.0 Haskell
    Regional memory pointers

  • DrIFT-cabalized

    6.0 0.0 Haskell
    Program to derive type class instances

  • DrIFT

    6.0 0.0 Haskell
    Program to derive type class instances

  • composition-tree

    5.8 0.0 Haskell
    Composition trees for arbitrary monoids.

  • data-clist

    5.8 1.9 Haskell
    Simple functional ring type.

  • ixset

    5.8 0.6 Haskell
    Efficient relational queries on Haskell sets.

  • selections

    5.7 2.7 Haskell
    Combinators for operating with selections over an underlying functor

  • heap

    5.7 0.0 Haskell
    Heaps in Haskell

  • TypeCompose

    5.5 1.9 Haskell
    Type composition classes & instances

  • safer-file-handles

    5.5 0.0 Haskell
    Type-safe file handling

  • composition-extra

    5.3 0.0 Haskell
    Combinators for unorthodox structure composition

  • repa-devil

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

  • ethereum-analyzer

    5.2 0.0 Haskell
    A Ethereum contract analyzer.

  • usb-safe

    5.0 0.0 Haskell
    Type-safe communication with USB devices.

  • ethereum-merkle-patricia-db

    5.0 0.0 Haskell
    A modified Merkle Patricia DB

  • colorful-monoids

    5.0 0.3 Haskell
    Styled console text output using ANSI escape sequences.

  • data-stringmap

    4.8 0.0 Haskell
    An efficient implementation of maps from strings to arbitrary values

  • composition

    4.8 0.0 Haskell
    Combinators for unorthodox function composition

  • ethereum-rlp

    4.8 0.0 Haskell
    Ethereum Recursive Length Prefix Encoding

  • open-typerep

    4.8 0.0 Haskell
    Open type representations and dynamic types

  • permutation

    4.6 0.0 Haskell
    A library for permutations and combinations.

  • hw-fingertree

    4.3 5.3 Haskell
    Generic finger-tree structure, with example instances

  • ilist

    4.1 0.0 Haskell
    Optimised list functions for doing index-related things

  • btree-concurrent

    4.1 0.0 Haskell
    A backend agnostic, concurrent BTree

  • type-indexed-queues

    4.1 0.0 Haskell
    Queues with verified and unverified versions.

  • bk-tree

    4.1 0.0 Haskell
    BK-tree implementation

  • naperian

    4.1 0.6 Haskell
    Efficient representable functors

  • I1M

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

  • loc

    3.2 3.9 Haskell
    Types representing line and column positions and ranges in text files.

  • pomaps

    3.2 3.5 Haskell
    Maps and sets of partial orders

  • Sit

    3.2 0.0 Haskell
    Prototypical type checker for Type Theory with Sized Natural Numbers

  • type-level-bst

    3.2 0.0 Haskell
    type-level binary search trees in haskell

  • flux-monoid

    3.2 0.0 Haskell
    A monoid for tracking changes

  • monadic-arrays

    3.2 0.0 Haskell
    Boxed and unboxed arrays for monad transformers

  • HoleyMonoid

    2.9 0.0 Haskell
    Monoids with holes.

  • safer-file-handles-bytestring

    2.9 0.0 Haskell
    Extends safer-file-handles with ByteString operations

  • safer-file-handles-text

    2.9 0.0 Haskell
    Extends safer-file-handles with Text operations

  • agda-snippets

    2.9 0.0 Haskell
    Render just the Agda snippets of a literate Agda file to HTML

  • array-memoize

    2.5 0.0 Haskell
    Memoization combinators using arrays for finite sub-domains of functions

  • tie-knot

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

  • repa-sndfile

    2.1 0.0 Haskell
    Reading and writing sound files with repa arrays

  • suffix-array

    2.1 0.0 Haskell
    Simple and moderately efficient suffix array implementation

  • invertible

    2.1 0.0 Haskell
    bidirectional arrows, bijective functions, and invariant functors

  • repa-fftw

    2.1 0.0 Haskell
    Perform fft with repa via FFTW

  • nonemptymap

    2.0 0.4 Haskell
    A NonEmptyMap Implementation

  • bookkeeper-permissions

    1.8 0.0 Haskell
    Permissions for bookkeeper records

  • subwordgraph

    1.8 0.0 Haskell
    Subword graph implementation

  • multi-containers

    1.5 4.8 Haskell
    A few multimap variants.

  • bytestring-to-vector

    1.5 1.5 Haskell
    Convert between ByteString and Vector.Storable without copying

  • stack-type

    1.3 0.0 Haskell
    The basic stack type

  • radix-tree

    1.3 0.0 Haskell
    Radix tree data structive over short byte-strings

  • q4c12-twofinger

    1.1 8.4 Haskell
    Efficient alternating finger trees

  • functor-friends

    1.1 0.0 Haskell
    Friendly helpers for your recursion schemes.

  • perfect-hash-generator

    1.1 0.0 Haskell
    Perfect minimal hashing implementation in native Haskell

  • function-builder

    1.0 2.8 Haskell
    Create poly variadic functions for monoidal results

  • nibblestring

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

  • more-containers

    0.8 6.1 Haskell
    A few more collections

  • data-forest

    0.8 3.4 Haskell
    A simple multi-way tree data structure.
Monitor and correlate metrics, traces, and logs in one platform. Free 14-day trial.
More from our partner

Popular Comparisons

SaaSHub - Software Alternatives and Reviews
More from our team

Add another 'Data Structures' Package