10

8

6

4

2


10.0

9.8

10.0
0.0

9.8

9.6

9.8

4.7

9.7

5.0

9.7

4.2

100 Data Structures packages and projects

  • Agda

    10.0 9.8 Haskell
    Agda is a dependently typed programming language / interactive theorem prover.
  • miso

    10.0 0.0 Haskell
    :ramen: A tasty Haskell front-end framework
  • 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.
    Sponsored scoutapm.com
  • hevm

    9.8 9.6 Haskell
    Dapp, Seth, Hevm, and more
  • containers

    9.8 4.7 Haskell
    Assorted concrete container types
  • vinyl

    9.7 5.0 Haskell
    Extensible Records for Haskell. Pull requests welcome! Come visit us on #vinyl on freenode.
  • singletons

    9.7 4.2 Haskell
    Fake dependent types in Haskell using singletons
  • fgl

    9.6 0.3 Haskell
    A Functional Graph Library for Haskell
  • repa-array

    9.5 0.0 Haskell
    High performance, regular, shape polymorphic parallel arrays.
  • repa-eval

    9.5 0.0 Haskell
    High performance, regular, shape polymorphic parallel arrays.
  • repa-scalar

    9.5 0.0 Haskell
    High performance, regular, shape polymorphic parallel arrays.
  • repa-convert

    9.5 0.0 Haskell
    High performance, regular, shape polymorphic parallel arrays.
  • cubical

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

    9.3 7.3 Haskell
    A set of utilities for using indexed types including containers, equality, and comparison.
  • hoq

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

    9.1 0.0 Haskell
    Priority Search Queues in three different flavors for Haskell
  • distributive

    9.0 2.5 Haskell
    Dual Traversable
  • adjunctions

    9.0 0.7 Haskell
    Simple adjunctions
  • ethereum-client-haskell

    9.0 0.0 Haskell
    A Haskell version of an Ethereum client
  • bookkeeper

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

    8.7 0.0 Haskell
    Type-level sets for Haskell (with value-level counterparts and various operations)
  • clafer

    8.7 0.0 Haskell
    Clafer is a lightweight modeling language
  • EdisonAPI

    8.6 0.0 Haskell
    Edison: A Library of Efficient Data Structures
  • justified-containers

    8.6 0.0 Haskell
    Standard containers, with keys that carry type-level proofs of their own presence.
  • slist

    8.3 1.1 Haskell
    ♾️ Sized list
  • void

    8.2 0.0 Haskell
    Provides Data.Void, which is in base since ghc 7.8 or so
  • bytestring-trie

    8.0 0.0 Haskell
    An efficient finite map from (byte)strings to values.
  • ixset-typed

    8.0 0.0 Haskell
    More strongly typed variant of the ixset Haskell package
  • multiset

    8.0 0.0 Haskell
    multiset haskell package
  • knit

    7.9 0.3 Haskell
    Ties the knot on data structures that reference each other by unique keys
  • hamtmap

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

    7.9 0.0 Haskell
    A compact functional set data structure
  • heaps

    7.9 0.2 Haskell
    Asymptotically optimal Brodal/Okasaki heaps
  • graphite

    7.7 3.0 Haskell
    Haskell graphs and networks library
  • algebra-checkers

    7.5 1.9 Haskell
    checkers for algebra driven design
  • haggle

    7.5 0.0 Haskell
    An efficient graph library for Haskell
  • data-r-tree

    7.4 0.0 Haskell
    Haskell implementatio of R-Trees
  • rawr

    7.4 0.0 Haskell
    Anonymous extensible records and variant types
  • map-exts

    7.3 0.0 Haskell
    Extensions to Data.Map
  • claferIG

    7.3 0.0 Haskell
    Support for reasoning on Clafer models by instantiation and counter example generation.
  • nonempty-containers

    7.2 1.2 Haskell
    Efficient non-empty variants of containers data types, with full API
  • eliminators

    7.2 0.0 Haskell
    Dependently typed elimination functions using singletons
  • helf

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

    6.9 0.0 Haskell
    representable functors
  • ixset

    6.8 0.0 Haskell
    A Set type which supports multiple indexes
  • mtl-c

    6.8 0.0 Haskell
    Monad transformers in CPS
  • map-syntax

    6.8 0.0 Haskell
    Syntax sugar and explicit semantics for statically defined maps
  • igraph

    6.6 0.0 Haskell
    Incomplete Haskell bindings to the igraph library (which is written in C)
  • supermonad

    6.6 0.0 Haskell
    A plugin for GHC to support super monads.
  • regional-pointers

    6.5 0.0 Haskell
    Regional memory pointers
  • hw-fingertree-strict

    6.5 1.6 Haskell
    Generic strict finger-tree structure
  • ethereum-analyzer

    6.4 0.0 Haskell
    An Ethereum contract analyzer.
  • heap

    6.4 0.0 Haskell
    A flexible Haskell implementation of minimum, maximum, minimum-priority, maximum-priority and custom-ordered heaps.
  • selections

    6.4 0.5 Haskell
    Haskell Package for operating with selections over an underlying functor
  • DrIFT

    6.3 0.0 Haskell
    A mirror of DrIFT.
  • DrIFT-cabalized

    6.3 0.0 Haskell
    A mirror of DrIFT.
  • data-clist

    6.2 0.0 Haskell
    A purely functional ring data structure for Haskell.
  • safer-file-handles

    6.0 0.0 Haskell
    Type-safe file handling
  • composition-tree

    5.9 0.0 Haskell
    Composition trees for arbitrary monoids.
  • TypeCompose

    5.9 0.0 Haskell
    Type composition classes & instances & misc
  • permutation

    5.9 0.0 Haskell
    git import of patrick perry permutations lib from darcs
  • loc

    5.5 1.1 Haskell
    Types representing line and column positions and ranges in text files.
  • usb-safe

    5.4 0.0 Haskell
    Type-safe communication with USB devices
  • repa-devil

    5.4 0.0 Haskell
    Image library based on the DevIL open source image library for the repa array library.
  • colorful-monoids

    5.3 0.4 Haskell
    colorful-monoids: Styled console text output using ANSI escape sequences
  • composition

    5.3 0.0 Haskell
    Combinators for unorthodox function composition in Haskell
  • ethereum-merkle-patricia-db

    5.0 0.0 Haskell
    A modified Merkle Patricia DB
  • extended-containers

    5.0 0.3 Haskell
    A Haskell library for containers to extend the containers and unordered-containers packages.
  • ilist

    5.0 0.6 Haskell
    ℹ️ Index-related functions for lists
  • ethereum-rlp

    4.8 0.0 Haskell
    Ethereum Recursive Length Prefix Encoding
  • composition-extra

    4.8 0.0 Haskell
    Combinators for unorthodox structure composition in Haskell
  • data-stringmap

    4.8 0.0 Haskell
    Haskell Project to convert the PrefixTree of the Holumbus into it's own Hackage Packet
  • open-typerep

    4.8 0.0 Haskell
    Open type representations and dynamic types
  • hw-fingertree

    4.5 1.5 Haskell
    Generic finger-tree structure, with example instances
  • type-indexed-queues

    4.3 0.0 Haskell
    Queues with verified and unverified versions
  • monadic-arrays

    4.3 0.0 Haskell
    MArray instances for monad transformers
  • repa-fftw

    4.3 0.0 Haskell
    Performs fft on repa array with FFTW
  • repa-sndfile

    4.3 0.0 Haskell
    Reading and writing audio data with repa
  • btree-concurrent

    4.1 0.0 Haskell
    A backend agnostic, concurrent BTree written in Haskell
  • naperian

    4.1 0.0 Haskell
    Efficient representable functors
  • type-level-bst

    4.1 0.0 Haskell
    Type-Level Binary Search Tree in Haskell
  • safer-file-handles-bytestring

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

    4.1 0.0 Haskell
    Extends safer-file-handles with Text operations
  • multi-containers

    4.0 0.0 Haskell
    A few variants of multimaps.
  • array-memoize

    3.8 0.0 Haskell
    Memoize discrete functions (restricted to a finite domain) using arrays
  • Sit

    3.7 0.0 Haskell
    Prototypical type checker for Type Theory with Sized Natural Numbers
  • more-containers

    3.5 0.0 Haskell
    A few more container types
  • bk-tree

    3.5 0.0 Haskell
    Haskell library meant to be a set of tools to correct spelling mistakes, homophones, and OCR errors
  • pomaps

    3.5 0.0 Haskell
    Haskell data structure for maps and sets with partially ordered keys
  • graph-wrapper

    3.5 0.0 Haskell
    A wrapper around the standard Data.Graph with a less awkward interface
  • flux-monoid

    3.5 0.0 Haskell
    A monoid which counts changing values in a sequence
  • data-forest

    3.2 0.1 Haskell
    A simple multi-way tree data structure.
  • bookkeeper-permissions

    3.2 0.0 Haskell
    Permissions for bookkeeper records
  • agda-snippets

    3.2 0.0 Haskell
    Library and tool to render the snippets in literate Agda files to hyperlinked HTML, leaving the rest of the text untouched.
  • HoleyMonoid

    3.2 0.0 Haskell
    Automatically exported from code.google.com/p/monoid-cont
  • I1M

    3.2 0.0 Haskell
    Código Haskell usado en el curso de I1M (Informática de 1º de Matemática)
  • tie-knot

    3.2 0.0 Haskell
    "Ties the knot" on a given set of structures that reference each other by keys - replaces the keys with their respective values.
  • rbst

    3.2 0.4 Haskell
    Randomized Binary Search Trees (Martinez, and Roura, 1997)
  • indexed-containers

    2.8 0.4 Haskell
    Simple, no-frills indexed lists.
  • functor-friends

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

    2.5 0.0 Haskell
    Simple and efficient suffix array implementation in haskell

Add another 'Data Structures' Package