10

8

6

4

2


10.0

9.8
Agda

10.0

7.7
hevm

10.0

3.1
miso

9.8
0.0
containers

9.7
0.0
vinyl

9.7

5.5
singletons

100 Data Structures packages and projects

  • Agda

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

  • hevm

    10.0 7.7 Haskell
    Dapp, Seth, Hevm, and more

    • Get non-trivial tests (and trivial, too!) suggested right inside your IDE, so you can code smart, create more value, and stay confident when you push.
    Promo

  • miso

    10.0 3.1 Haskell
    :ramen: A tasty Haskell front-end framework

  • containers

    9.8 0.0 Haskell
    Assorted concrete container types

  • vinyl

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

  • singletons

    9.7 5.5 Haskell
    Fake dependent types in Haskell using singletons

  • fgl

    9.6 0.0 Haskell
    A Functional Graph Library for Haskell

  • repa-convert

    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-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.

  • cubical

    9.4 0.0 Haskell
    Implementation of Univalence in Cubical Sets

  • parameterized-utils

    9.1 3.1 Haskell
    A set of utilities for using indexed types including containers, equality, and comparison.

  • psqueues

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

  • ethereum-client-haskell

    9.0 0.0 Haskell
    A Haskell version of an Ethereum client

  • adjunctions

    9.0 0.0 Haskell
    Simple adjunctions

  • hoq

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

  • distributive

    8.9 0.0 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.8 0.0 Haskell
    Anonymous records and overloaded labels

  • clafer

    8.6 0.0 Haskell
    Clafer is a lightweight modeling language

  • justified-containers

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

  • EdisonAPI

    8.5 0.0 Haskell
    Edison: A Library of Efficient Data Structures

  • bytestring-trie

    8.2 0.0 Haskell
    An efficient finite map from (byte)strings to values.

  • ixset-typed

    8.2 2.4 Haskell
    More strongly typed variant of the ixset Haskell package

  • slist

    8.2 0.0 Haskell
    ♾️ Sized list

  • void

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

  • heaps

    8.0 0.0 Haskell
    Asymptotically optimal Brodal/Okasaki heaps

  • hamtmap

    7.9 0.0 Haskell
    A purely functional and persistent hash map

  • haggle

    7.9 0.0 Haskell
    An efficient graph library for Haskell

  • knit

    7.9 0.0 Haskell
    Ties the knot on data structures that reference each other by unique keys

  • bitset

    7.8 0.0 Haskell
    A compact functional set data structure

  • multiset

    7.7 0.0 Haskell
    multiset haskell package

  • algebra-checkers

    7.5 0.0 Haskell
    checkers for algebra driven design

  • graphite

    7.5 0.0 Haskell
    Haskell graphs and networks library

  • nonempty-containers

    7.5 0.0 Haskell
    Efficient non-empty variants of containers data types, with full API

  • helf

    7.3 0.0 Haskell
    Haskell implementation of the Edinburgh Logical Framework

  • map-exts

    7.3 0.0 Haskell
    Extensions to Data.Map

  • data-r-tree

    7.3 0.0 Haskell
    Haskell implementatio of R-Trees

  • eliminators

    7.2 3.1 Haskell
    Dependently typed elimination functions using singletons

  • rawr

    7.1 0.0 Haskell
    Anonymous extensible records and variant types

  • claferIG

    7.0 0.0 Haskell
    Support for reasoning on Clafer models by instantiation and counter example generation.

  • ixset

    6.7 0.0 Haskell
    A Set type which supports multiple indexes

  • supermonad

    6.7 0.0 Haskell
    A plugin for GHC to support super monads.

  • mtl-c

    6.7 0.0 Haskell
    Monad transformers in CPS

  • TypeCompose

    6.7 0.0 Haskell
    Type composition classes & instances & misc

  • representable-functors

    6.7 0.0 Haskell
    representable functors

  • map-syntax

    6.6 0.0 Haskell
    Syntax sugar and explicit semantics for statically defined maps

  • selections

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

  • igraph

    6.5 0.0 Haskell
    Incomplete Haskell bindings to the igraph library (which is written in C)

  • ethereum-analyzer

    6.4 0.0 Haskell
    An Ethereum contract analyzer.

  • hw-fingertree-strict

    6.4 0.0 Haskell
    Generic strict finger-tree structure

  • data-clist

    6.2 0.0 Haskell
    A purely functional ring data structure for Haskell.

  • regional-pointers

    6.1 0.0 Haskell
    Regional memory pointers

  • permutation

    6.0 0.0 Haskell
    git import of patrick perry permutations lib from darcs

  • composition-tree

    5.8 0.0 Haskell
    Composition trees for arbitrary monoids.

  • heap

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

  • extended-containers

    5.7 0.0 Haskell
    A Haskell library for containers to extend the containers and unordered-containers packages.

  • safer-file-handles

    5.6 0.0 Haskell
    Type-safe file handling

  • loc

    5.6 0.0 Haskell
    Types representing line and column positions and ranges in text files

  • DrIFT

    5.5 0.0 Haskell
    A mirror of DrIFT.

  • DrIFT-cabalized

    5.5 0.0 Haskell
    A mirror of DrIFT.

  • repa-devil

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

  • hw-fingertree

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

  • ilist

    5.2 2.5 Haskell
    ℹ️ Index-related functions for lists

  • data-stringmap

    5.2 0.0 Haskell
    Haskell Project to convert the PrefixTree of the Holumbus into it's own Hackage Packet

  • ethereum-merkle-patricia-db

    5.0 0.0 Haskell
    A modified Merkle Patricia DB

  • composition

    4.9 0.0 Haskell
    Combinators for unorthodox function composition in Haskell

  • usb-safe

    4.9 0.0 Haskell
    Type-safe communication with USB devices

  • composition-extra

    4.9 0.0 Haskell
    Combinators for unorthodox structure composition in Haskell

  • ethereum-rlp

    4.9 0.0 Haskell
    Ethereum Recursive Length Prefix Encoding

  • multi-containers

    4.7 0.0 Haskell
    A few variants of multimaps.

  • colorful-monoids

    4.7 0.0 Haskell
    colorful-monoids: Styled console text output using ANSI escape sequences

  • monadic-arrays

    4.4 0.0 Haskell
    MArray instances for monad transformers

  • type-indexed-queues

    4.4 0.0 Haskell
    Queues with verified and unverified versions

  • open-typerep

    4.2 0.0 Haskell
    Open type representations and dynamic types

  • agda-snippets

    4.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.

  • type-level-bst

    4.2 0.0 Haskell
    Type-Level Binary Search Tree in Haskell

  • flux-monoid

    4.1 0.0 Haskell
    A monoid which counts changing values in a sequence

  • Sit

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

  • repa-sndfile

    3.7 0.0 Haskell
    Reading and writing audio data with repa

  • more-containers

    3.7 0.0 Haskell
    A few more container types

  • HoleyMonoid

    3.7 0.0 Haskell
    Automatically exported from code.google.com/p/monoid-cont

  • repa-fftw

    3.7 0.0 Haskell
    Performs fft on repa array with FFTW

  • graph-wrapper

    3.7 0.0 Haskell
    A wrapper around the standard Data.Graph with a less awkward interface

  • bk-tree

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

  • pomaps

    3.6 0.0 Haskell
    Haskell data structure for maps and sets with partially ordered keys

  • safer-file-handles-bytestring

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

  • btree-concurrent

    3.4 0.0 Haskell
    A backend agnostic, concurrent BTree written in Haskell

  • tie-knot

    3.4 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.

  • bookkeeper-permissions

    3.4 0.0 Haskell
    Permissions for bookkeeper records

  • safer-file-handles-text

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

  • array-memoize

    3.1 0.0 Haskell
    Memoize discrete functions (restricted to a finite domain) using arrays

  • naperian

    3.1 0.0 Haskell
    Efficient representable functors

  • functor-friends

    2.8 0.0 Haskell
    Friendly helpers for your recursion schemes.

  • min-max-pqueue

    2.8 0.0 Haskell
    Min-max priority queue, also known as double-ended priority queue.

  • extended-containers-lens

    2.5 0.0 Haskell
    Lens instances for extended-containers.

  • invertible

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

  • bytestring-to-vector

    2.5 0.0 Haskell
    Convert between ByteString and Vector.Storable without copying

  • suffix-array

    2.5 0.0 Haskell
    Simple and efficient suffix array implementation in haskell
ONLYOFFICE Docs — document collaboration in your environment
sponsored www.onlyoffice.com

Popular Comparisons

Access the most powerful time series database as a service
sponsored www.influxdata.com

Add another 'Data Structures' Package