10

8

6

4

2


10.0

2.4

10.0

9.9

10.0

9.7

9.8

8.7

9.7

7.0

9.7
0.0

100 Data Structures packages and projects

  • hevm

    10.0 2.4 Haskell
    Dapp, Seth, Hevm, and more
  • Agda

    10.0 9.9 Haskell
    Agda is a dependently typed programming language / interactive theorem prover.
  • InfluxDB 3 OSS is now GA. Transform, enrich, and act on time series data directly in the database. Automate critical tasks and eliminate the need to move data externally. Download now.
    Promo www.influxdata.com
    InfluxDB Logo
  • miso

    10.0 9.7 Haskell
    :ramen: A tasty Haskell front-end framework
  • containers

    9.8 8.7 Haskell
    Assorted concrete container types
  • singletons

    9.7 7.0 Haskell
    Fake dependent types in Haskell using singletons
  • vinyl

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

    9.6 4.7 Haskell
    A Functional Graph Library for Haskell
  • repa-convert

    9.5 6.3 Haskell
    High performance, regular, shape polymorphic parallel arrays.
  • repa-array

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

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

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

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

    9.2 8.3 Haskell
    A set of utilities for using indexed types including containers, equality, and comparison.
  • adjunctions

    9.0 5.0 Haskell
    Simple adjunctions
  • hoq

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

    9.0 5.4 Haskell
    Priority Search Queues in three different flavors for Haskell
  • ethereum-client-haskell

    8.9 0.0 Haskell
    A Haskell version of an Ethereum client
  • distributive

    8.9 2.7 Haskell
    Dual Traversable
  • type-level-sets

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

    8.7 0.0 Haskell
    Anonymous records and overloaded labels
  • justified-containers

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

    8.5 2.4 Haskell
    Clafer is a lightweight modeling language
  • EdisonAPI

    8.4 4.6 Haskell
    Edison: A Library of Efficient Data Structures
  • ixset-typed

    8.3 0.0 Haskell
    More strongly typed variant of the ixset Haskell package
  • bytestring-trie

    8.2 5.1 Haskell
    An efficient finite map from (byte)strings to values.
  • slist

    8.1 2.3 Haskell
    ♾️ Sized list
  • heaps

    8.0 4.3 Haskell
    Asymptotically optimal Brodal/Okasaki heaps
  • haggle

    8.0 1.4 Haskell
    An efficient graph library for Haskell
  • void

    8.0 0.0 Haskell
    Provides Data.Void, which is in base since ghc 7.8 or so
  • hamtmap

    7.9 0.0 Haskell
    DISCONTINUED. A purely functional and persistent hash map
  • knit

    7.9 2.2 Haskell
    Ties the knot on data structures that reference each other by unique keys
  • nonempty-containers

    7.8 6.0 Haskell
    Efficient non-empty variants of containers data types, with full API
  • multiset

    7.6 0.0 Haskell
    multiset haskell package
  • bitset

    7.6 0.0 Haskell
    A compact functional set data structure
  • graphite

    7.5 0.0 Haskell
    Haskell graphs and networks library
  • helf

    7.5 2.8 Haskell
    Haskell implementation of the Edinburgh Logical Framework
  • algebra-checkers

    7.4 0.0 Haskell
    checkers for algebra driven design
  • rawr

    7.1 0.0 Haskell
    Anonymous extensible records and variant types
  • data-r-tree

    7.1 4.3 Haskell
    Haskell implementatio of R-Trees
  • eliminators

    7.1 4.6 Haskell
    Dependently typed elimination functions using singletons
  • map-exts

    7.1 0.0 Haskell
    Extensions to Data.Map
  • claferIG

    6.7 3.9 Haskell
    Support for reasoning on Clafer models by instantiation and counter example generation.
  • ethereum-analyzer

    6.7 6.9 Haskell
    An Ethereum contract analyzer.
  • map-syntax

    6.7 0.0 Haskell
    Syntax sugar and explicit semantics for statically defined maps
  • ixset

    6.7 0.0 Haskell
    A Set type which supports multiple indexes
  • TypeCompose

    6.6 0.0 Haskell
    Type composition classes & instances & misc
  • mtl-c

    6.5 0.0 Haskell
    Monad transformers in CPS
  • selections

    6.5 0.0 Haskell
    Haskell Package for operating with selections over an underlying functor
  • supermonad

    6.5 0.0 Haskell
    A plugin for GHC to support super monads.
  • representable-functors

    6.4 0.0 Haskell
    representable functors
  • data-clist

    6.4 3.9 Haskell
    A purely functional ring data structure for Haskell.
  • igraph

    6.4 0.0 Haskell
    Incomplete Haskell bindings to the igraph library (which is written in C)
  • hw-fingertree-strict

    6.4 0.0 Haskell
    Generic strict finger-tree structure
  • composition-tree

    5.8 0.0 Haskell
    Composition trees for arbitrary monoids.
  • permutation

    5.8 0.0 Haskell
    git import of patrick perry permutations lib from darcs
  • heap

    5.7 0.0 Haskell
    A flexible Haskell implementation of minimum, maximum, minimum-priority, maximum-priority and custom-ordered heaps.
  • DrIFT-cabalized

    5.6 0.0 Haskell
    A mirror of DrIFT.
  • DrIFT

    5.6 0.0 Haskell
    A mirror of DrIFT.
  • regional-pointers

    5.5 0.0 Haskell
    Regional memory pointers
  • ilist

    5.4 0.0 Haskell
    ℹ️ Index-related functions for lists
  • hw-fingertree

    5.3 2.7 Haskell
    Generic finger-tree structure, with example instances
  • composition-extra

    5.1 5.2 Haskell
    Combinators for unorthodox structure composition in Haskell
  • repa-devil

    5.1 0.0 Haskell
    Image library based on the DevIL open source image library for the repa array library.
  • data-stringmap

    5.0 0.0 Haskell
    Haskell Project to convert the PrefixTree of the Holumbus into it's own Hackage Packet
  • radix-tree

    5.0 5.2 Haskell
    Haskell implementation of the radix tree data structure
  • composition

    5.0 0.0 Haskell
    Combinators for unorthodox function composition in Haskell
  • safer-file-handles

    4.9 0.0 Haskell
    Type-safe file handling
  • loc

    4.8 4.5 Haskell
    Types representing line and column positions and ranges in text files
  • multi-containers

    4.6 3.6 Haskell
    A few variants of multimaps.
  • colorful-monoids

    4.6 0.0 Haskell
    colorful-monoids: Styled console text output using ANSI escape sequences
  • agda-snippets

    4.6 0.0 Haskell
    Library and tool to render the snippets in literate Agda files to hyperlinked HTML, leaving the rest of the text untouched.
  • type-indexed-queues

    4.4 0.0 Haskell
    Queues with verified and unverified versions
  • extended-containers

    4.3 3.4 Haskell
    A Haskell library for containers to extend the containers and unordered-containers packages.
  • pomaps

    4.3 0.0 Haskell
    Haskell data structure for maps and sets with partially ordered keys
  • ethereum-merkle-patricia-db

    4.1 0.0 Haskell
    A modified Merkle Patricia DB
  • flux-monoid

    4.1 0.0 Haskell
    A monoid which counts changing values in a sequence
  • type-level-bst

    4.0 0.0 Haskell
    Type-Level Binary Search Tree in Haskell
  • Sit

    3.9 3.0 Haskell
    Prototypical type checker for Type Theory with Sized Natural Numbers
  • ethereum-rlp

    3.9 0.0 Haskell
    Ethereum Recursive Length Prefix Encoding
  • usb-safe

    3.8 0.0 Haskell
    Type-safe communication with USB devices
  • open-typerep

    3.8 0.0 Haskell
    Open type representations and dynamic types
  • more-containers

    3.7 0.0 Haskell
    A few more container types
  • graph-wrapper

    3.7 1.8 Haskell
    A wrapper around the standard Data.Graph with a less awkward interface
  • array-memoize

    3.7 4.1 HTML
    Memoize discrete functions (restricted to a finite domain) using arrays
  • I1M

    3.4 3.7 HTML
    Código Haskell usado en el curso de I1M (Informática de 1º de Matemática)
  • monadic-arrays

    3.2 0.0 Haskell
    MArray instances for monad transformers
  • bk-tree

    3.2 0.0 Haskell
    Haskell library meant to be a set of tools to correct spelling mistakes, homophones, and OCR errors
  • functor-friends

    3.1 0.0 Haskell
    Friendly helpers for your recursion schemes.
  • naperian

    3.1 0.0 Haskell
    Efficient representable functors
  • bookkeeper-permissions

    2.9 0.0 Haskell
    Permissions for bookkeeper records
  • btree-concurrent

    2.9 0.0 Haskell
    A backend agnostic, concurrent BTree written in Haskell
  • invertible

    2.9 1.8 Haskell
    Haskell bidirectional arrows, bijective functions, and invariant functors
  • min-max-pqueue

    2.9 2.5 Haskell
    Min-max priority queue, also known as double-ended priority queue.
  • tie-knot

    2.9 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

    2.5 0.0 Haskell
    Randomized Binary Search Trees (Martinez, and Roura, 1997)
  • HoleyMonoid

    2.5 0.0 Haskell
    Automatically exported from code.google.com/p/monoid-cont
  • repa-sndfile

    2.4 0.0 Haskell
    Reading and writing audio data with repa
  • repa-fftw

    2.3 0.0 Haskell
    Performs fft on repa array with FFTW
  • indexed-containers

    2.1 0.0 Haskell
    Simple, no-frills indexed lists.
  • safer-file-handles-text

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

Add another 'Data Structures' Package