10

8

6

4

2


10.0

6.7

10.0

9.7

9.8

9.5

9.8

6.0

9.7

4.3

9.7

5.6

100 Data Structures packages and projects

  • miso

    10.0 6.7 Haskell
    A tasty Haskell front-end framework
  • Agda

    10.0 9.7 Haskell
    A dependently typed functional programming language and proof assistant
  • hevm

    9.8 9.5 Haskell
    Ethereum virtual machine evaluator
  • Scout APM uses tracing logic that ties bottlenecks to source code so you know the exact line of code causing performance issues and can get back to building a great product faster.
    Promoted scoutapm.com
  • containers

    9.8 6.0 Haskell
    Assorted concrete container types
  • vinyl

    9.7 4.3 Haskell
    Extensible Records
  • singletons

    9.7 5.6 Haskell
    A framework for generating singleton types
  • fgl

    9.6 1.4 Haskell
    Martin Erwig's Functional Graph Library
  • repa-array

    9.5 0.0 Haskell
    Bulk array representations and operators.
  • repa-convert

    9.5 0.0 Haskell
    Packing and unpacking flat tables.
  • repa-eval

    9.5 0.0 Haskell
    Low-level parallel operators on bulk random-accessble arrays.
  • repa-scalar

    9.5 0.0 Haskell
    Scalar data types and conversions.
  • cubical

    9.4 0.0 Haskell
    Implementation of Univalence in Cubical Sets
  • parameterized-utils

    9.2 5.6 Haskell
    Classes and data structures for working with data-kind indexed types
  • hoq

    9.1 0.0 Haskell
    A language based on homotopy type theory with an interval type
  • psqueues

    9.1 0.0 Haskell
    Pure priority search queues
  • ethereum-client-haskell

    9.1 0.0 Haskell
    A Haskell version of an Ethereum client
  • adjunctions

    9.0 3.0 Haskell
    Adjunctions and representable functors
  • distributive

    8.8 3.0 Haskell
    Distributive functors -- Dual to Traversable
  • bookkeeper

    8.8 0.0 Haskell
    Anonymous records and overloaded labels
  • type-level-sets

    8.8 0.0 Haskell
    Type-level sets and finite maps (with value-level counterparts)
  • EdisonAPI

    8.7 0.0 Haskell
    A library of efficient, purely-functional data structures (API)
  • clafer

    8.7 0.0 Haskell
    Compiles Clafer models to other formats
  • justified-containers

    8.5 0.3 Haskell
    Keyed container types with verified keys.
  • slist

    8.4 3.4 Haskell
    Sized list
  • void

    8.2 1.0 Haskell
    A Haskell 98 logically uninhabited data type
  • multiset

    8.0 0.3 Haskell
    The Data.MultiSet container type
  • knit

    8.0 3.7 Haskell
    Ties the knot on data structures that reference each other by unique keys.
  • ixset-typed

    8.0 1.7 Haskell
    Efficient relational queries on Haskell sets.
  • bitset

    7.9 0.0 Haskell
    A space-efficient set data structure.
  • hamtmap

    7.9 0.0 Haskell
    A purely functional and persistent hash map
  • heaps

    7.9 1.7 Haskell
    Asymptotically optimal Brodal/Okasaki heaps.
  • bytestring-trie

    7.9 0.0 Haskell
    An efficient finite map from (byte)strings to values.
  • haggle

    7.6 0.0 Haskell
    A graph library offering mutable, immutable, and inductive graphs
  • algebra-checkers

    7.5 6.9 Haskell
    Model and test API surfaces algebraically
  • graphite

    7.5 4.8 Haskell
    Graphs and networks library
  • data-r-tree

    7.5 1.2 Haskell
    R-Tree is a spatial data structure similar to Quadtrees or B-Trees.
  • rawr

    7.4 0.0 Haskell
    Anonymous extensible records
  • map-exts

    7.3 0.0 Haskell
    Extensions to Data.Map
  • eliminators

    7.2 1.8 Haskell
    Dependently typed elimination functions using singletons
  • claferIG

    7.2 0.0 Haskell
    claferIG is an interactive tool that generates instances of Clafer models.
  • nonempty-containers

    7.1 3.0 Haskell
    Non-empty variants of containers data types, with full API
  • helf

    7.1 0.0 Haskell
    Typechecking terms of the Edinburgh Logical Framework (LF).
  • map-syntax

    6.9 1.2 Haskell
    Syntax sugar for defining maps
  • representable-functors

    6.9 0.0 Haskell
    Representable functors
  • mtl-c

    6.9 0.0 Haskell
    Very strict CPS'd transformers
  • igraph

    6.7 0.0 Haskell
    Bindings to the igraph C library.
  • ixset

    6.6 0.0 Haskell
    Efficient relational queries on Haskell sets.
  • hw-fingertree-strict

    6.6 4.7 Haskell
    Generic strict finger-tree structure
  • supermonad

    6.5 0.0 Haskell
    Plugin and base library to support supermonads in Haskell
  • regional-pointers

    6.5 0.0 Haskell
    Regional memory pointers
  • selections

    6.5 1.5 Haskell
    Combinators for operating with selections over an underlying functor
  • ethereum-analyzer

    6.1 0.0 Haskell
    A Ethereum contract analyzer.
  • safer-file-handles

    6.1 0.0 Haskell
    Type-safe file handling
  • DrIFT-cabalized

    6.0 0.0 Haskell
    Program to derive type class instances
  • composition-tree

    6.0 0.0 Haskell
    Composition trees for arbitrary monoids.
  • permutation

    6.0 0.0 Haskell
    A library for permutations and combinations.
  • TypeCompose

    6.0 0.0 Haskell
    Type composition classes & instances
  • DrIFT

    6.0 0.0 Haskell
    Program to derive type class instances
  • data-clist

    6.0 0.4 Haskell
    Simple functional ring type.
  • heap

    5.9 0.0 Haskell
    Heaps in Haskell
  • colorful-monoids

    5.7 1.6 Haskell
    Styled console text output using ANSI escape sequences.
  • loc

    5.6 2.9 Haskell
    Types representing line and column positions and ranges in text files.
  • repa-devil

    5.4 0.0 Haskell
    Support for image reading and writing of Repa arrays using in-place FFI calls
  • usb-safe

    5.4 0.0 Haskell
    Type-safe communication with USB devices.
  • composition

    5.4 0.0 Haskell
    Combinators for unorthodox function composition
  • extended-containers

    5.1 4.0 Haskell
    Heap and Vector container types
  • ethereum-merkle-patricia-db

    5.1 0.0 Haskell
    A modified Merkle Patricia DB
  • ilist

    5.1 2.3 Haskell
    Optimised list functions for doing index-related things
  • composition-extra

    4.9 0.0 Haskell
    Combinators for unorthodox structure composition
  • data-stringmap

    4.9 0.0 Haskell
    An efficient implementation of maps from strings to arbitrary values
  • open-typerep

    4.9 0.0 Haskell
    Open type representations and dynamic types
  • ethereum-rlp

    4.9 0.0 Haskell
    Ethereum Recursive Length Prefix Encoding
  • hw-fingertree

    4.7 4.6 Haskell
    Generic finger-tree structure, with example instances
  • monadic-arrays

    4.4 0.0 Haskell
    Boxed and unboxed arrays for monad transformers
  • type-indexed-queues

    4.4 0.0 Haskell
    Queues with verified and unverified versions.
  • safer-file-handles-bytestring

    4.2 0.0 Haskell
    Extends safer-file-handles with ByteString operations
  • safer-file-handles-text

    4.2 0.0 Haskell
    Extends safer-file-handles with Text operations
  • type-level-bst

    4.2 0.0 Haskell
    type-level binary search trees in haskell
  • btree-concurrent

    4.2 0.0 Haskell
    A backend agnostic, concurrent BTree
  • naperian

    4.2 0.0 Haskell
    Efficient representable functors
  • multi-containers

    4.2 3.8 Haskell
    A few multimap variants.
  • array-memoize

    3.9 0.0 Haskell
    Memoization combinators using arrays for finite sub-domains of functions
  • repa-fftw

    3.6 0.0 Haskell
    Perform fft with repa via FFTW
  • repa-sndfile

    3.6 0.0 Haskell
    Reading and writing sound files with repa arrays
  • pomaps

    3.6 1.4 Haskell
    Maps and sets of partial orders
  • flux-monoid

    3.6 0.0 Haskell
    A monoid for tracking changes
  • bk-tree

    3.6 0.0 Haskell
    BK-tree implementation
  • HoleyMonoid

    3.3 0.0 Haskell
    Monoids with holes.
  • agda-snippets

    3.3 0.0 Haskell
    Render just the Agda snippets of a literate Agda file to HTML
  • bookkeeper-permissions

    3.3 0.0 Haskell
    Permissions for bookkeeper records
  • Sit

    3.3 0.0 Haskell
    Prototypical type checker for Type Theory with Sized Natural Numbers
  • rbst

    3.3 4.8 Haskell
    Randomized Binary Search Trees
  • graph-wrapper

    3.3 0.0 Haskell
    A wrapper around the standard Data.Graph with a less awkward interface
  • tie-knot

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

    3.3 0.0 Haskell
    Code for the Haskell course taught at the University of Seville.
  • indexed-containers

    3.0 2.0 Haskell
    Simple, no-frills indexed lists.
  • more-containers

    2.6 0.0 Haskell
    A few more collections
  • functor-friends

    2.6 0.0 Haskell
    Friendly helpers for your recursion schemes.
  • suffix-array

    2.6 0.0 Haskell
    Simple and moderately efficient suffix array implementation
  • data-forest

    2.3 1.2 Haskell
    A simple multi-way tree data structure.

Add another 'Data Structures' Package