10

8

6

4

2


10.0

9.6
Agda

10.0

5.7
hevm

7.5
0.0
algebra-checkers

10.0
0.0
miso

9.8

7.8
containers
1.5
0.0
circular

100 Data Structures packages and projects

  • Agda

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

  • hevm

    10.0 5.7 Haskell
    Dapp, Seth, Hevm, and more

    • Your projects are multi-language. So is SonarQube analysis. Find Bugs, Vulnerabilities, Security Hotspots, and Code Smells so you can release quality code every time. Get started analyzing your projects today for free.
    Promo

  • algebra-checkers

    7.5 0.0 Haskell
    checkers for algebra driven design

  • miso

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

  • containers

    9.8 7.8 Haskell
    Assorted concrete container types

  • circular

    1.5 0.0 Haskell
    Circular fixed-sized stacks

  • singletons

    9.7 0.0 Haskell
    Fake dependent types in Haskell using singletons

  • parameterized-utils

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

  • hw-fingertree-strict

    6.5 0.0 Haskell
    Generic strict finger-tree structure

  • rbst

    2.1 0.0 Haskell
    Randomized Binary Search Trees (Martinez, and Roura, 1997)

  • hw-fingertree

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

  • graphite

    7.6 0.0 Haskell
    Haskell graphs and networks library

  • vinyl

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

  • extended-containers

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

  • min-max-pqueue

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

  • multi-containers

    4.7 0.0 Haskell
    A few variants of multimaps.

  • knit

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

  • slist

    8.2 0.0 Haskell
    ♾️ Sized list

  • distributive

    8.9 0.0 Haskell
    Dual Traversable

  • extended-containers-lens

    2.2 0.0 Haskell
    Lens instances for extended-containers.

  • nonempty-containers

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

  • adjunctions

    9.0 0.0 Haskell
    Simple adjunctions

  • invertible

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

  • indexed-containers

    1.9 0.0 Haskell
    Simple, no-frills indexed lists.

  • pomaps

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

  • eliminators

    7.0 0.0 Haskell
    Dependently typed elimination functions using singletons

  • Aoide

    1.5 0.0 Haskell
    A simple music library with the capability of generating .ly and .mid files.

  • ixset-typed

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

  • data-r-tree

    7.2 0.0 Haskell
    Haskell implementatio of R-Trees

  • heaps

    8.0 0.0 Haskell
    Asymptotically optimal Brodal/Okasaki heaps

  • loc

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

  • colorful-monoids

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

  • fgl

    9.6 0.0 Haskell
    A Functional Graph Library for Haskell

  • ilist

    5.0 3.5 Haskell
    ℹ️ Index-related functions for lists

  • haggle

    7.9 0.0 Haskell
    An efficient graph library for Haskell

  • selections

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

  • map-syntax

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

  • void

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

  • data-forest

    2.1 0.0 Haskell
    A simple multi-way tree data structure

  • multiset

    7.7 0.0 Haskell
    multiset haskell package

  • data-clist

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

  • justified-containers

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

  • repa-array

    9.4 0.0 Haskell
    High performance, regular, shape polymorphic parallel arrays.

  • repa-eval

    9.4 0.0 Haskell
    High performance, regular, shape polymorphic parallel arrays.

  • repa-scalar

    9.4 0.0 Haskell
    High performance, regular, shape polymorphic parallel arrays.

  • array-memoize

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

  • ethereum-client-haskell

    9.0 0.0 Haskell
    A Haskell version of an Ethereum client

  • ethereum-merkle-patricia-db

    4.9 0.0 Haskell
    A modified Merkle Patricia DB

  • ethereum-rlp

    4.7 0.0 Haskell
    Ethereum Recursive Length Prefix Encoding

  • nibblestring

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

  • TypeCompose

    7.0 0.0 Haskell
    Type composition classes & instances & misc

  • helf

    7.2 0.0 Haskell
    Haskell implementation of the Edinburgh Logical Framework

  • agda-snippets

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

  • open-typerep

    4.7 0.0 Haskell
    Open type representations and dynamic types

  • hoq

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

  • cubical

    9.4 0.0 Haskell
    Implementation of Univalence in Cubical Sets

  • ethereum-analyzer

    6.3 0.0 Haskell
    An Ethereum contract analyzer.

  • type-indexed-queues

    4.2 0.0 Haskell
    Queues with verified and unverified versions

  • hCM

    2.3 0.0 Haskell
    Conceptual modeling support library for Haskell

  • Sit

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

  • naperian

    2.9 0.0 Haskell
    Efficient representable functors

  • functor-friends

    3.6 0.0 Haskell
    Friendly helpers for your recursion schemes.

  • perfect-hash-generator

    1.5 0.0 C
    Perfect minimal hashing implementation in native Haskell

  • subzero

    0.7 0.0 Haskell
    Types to support turning structured collections of seed values into the same structures with alternatives along with some functions for regular uses

  • q4c12-twofinger

    1.4 0.0 Haskell
    Efficient alternating finger trees

  • more-containers

    4.1 0.0 Haskell
    A few more container types

  • appendmap

    0.8 0.0 Haskell
    A Data.Map wrapper with a Monoid instance that delegates to the individual keys

  • bytestring-to-vector

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

  • flux-monoid

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

  • function-builder

    1.2 0.0 Haskell
    Poly Variadic Functions in Haskell

  • I1M

    2.1 0.0 HTML
    Código Haskell usado en el curso de I1M (Informática de 1º de Matemática)

  • nonemptymap

    2.1 0.0 Haskell
    NonEmpty Map Libary

  • radix-tree

    1.4 0.0 Haskell
    Haskell implementation of the radix tree data structure

  • representable-functors

    6.7 0.0 Haskell
    representable functors

  • claferIG

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

  • clafer

    8.6 0.0 Haskell
    Clafer is a lightweight modeling language

  • supermonad

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

  • usb-safe

    4.7 0.0 Haskell
    Type-safe communication with USB devices

  • safer-file-handles-text

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

  • safer-file-handles-bytestring

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

  • safer-file-handles

    5.5 0.0 Haskell
    Type-safe file handling

  • regional-pointers

    6.0 0.0 Haskell
    Regional memory pointers

  • mtl-c

    6.8 0.0 Haskell
    Monad transformers in CPS

  • bitset

    7.8 0.0 Haskell
    A compact functional set data structure

  • bk-tree

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

  • bookkeeper

    8.8 0.0 Haskell
    Anonymous records and overloaded labels

  • bookkeeper-permissions

    4.1 0.0 Haskell
    Permissions for bookkeeper records

  • btree-concurrent

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

  • data-stringmap

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

  • DrIFT

    5.7 0.0 Haskell
    A mirror of DrIFT.

  • EdisonAPI

    8.5 0.0 Haskell
    Edison: A Library of Efficient Data Structures

  • exposed-containers

    1.2 0.0 Haskell
    A redistribution of 'containers', with all hidden modules exposed.

  • hamtmap

    7.9 0.0 Haskell
    A purely functional and persistent hash map

  • heap

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

  • HoleyMonoid

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

  • igraph

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

  • ixset

    6.7 0.0 Haskell
    A Set type which supports multiple indexes

  • map-exts

    7.4 0.0 Haskell
    Extensions to Data.Map

  • monadic-arrays

    4.3 0.0 Haskell
    MArray instances for monad transformers

  • permutation

    5.9 0.0 Haskell
    git import of patrick perry permutations lib from darcs
Collect and Analyze Billions of Data Points in Real Time
sponsored www.influxdata.com

Popular Comparisons

Free Global Payroll designed for tech teams
sponsored try.revelo.com

Add another 'Data Structures' Package