10

8

6

4

2


9.8

9.8

9.7

8.1

9.6

3.8

9.5
0.0

9.3

3.4

74 Data Structures packages and projects

  • Agda

    9.8 9.8 Haskell
    A dependently typed functional programming language and proof assistant
  • containers

    9.7 8.1 Haskell
    Assorted concrete container types
  • vinyl

    9.6 3.8 Haskell
    Extensible Records
  • cubical

    9.5 0.0 Haskell
    Implementation of Univalence in Cubical Sets
  • exposed-containers

    9.5 0.0 Haskell
    A distribution of the 'containers' package, with all modules exposed.
  • repa-scalar

    9.3 3.4 Haskell
    Scalar data types and conversions.
  • singletons

    9.3 5.9 Haskell
    A framework for generating singleton types
  • repa-convert

    9.3 3.4 Haskell
    Packing and unpacking flat tables.
  • repa-eval

    9.3 3.4 Haskell
    Low-level parallel operators on bulk random-accessble arrays.
  • repa-array

    9.3 3.4 Haskell
    Bulk array representations and operators.
  • ethereum-client-haskell

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

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

    8.8 1.1 Haskell
    Pure priority search queues
  • clafer

    8.6 4.6 Haskell
    Compiles Clafer models to other formats
  • bookkeeper

    8.4 5.5 Haskell
    Anonymous records and overloaded labels
  • distributive

    8.2 6.1 Haskell
    Distributive functors -- Dual to Traversable
  • hamtmap

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

    7.8 2.3 Haskell
    A Haskell 98 logically uninhabited data type
  • bitset

    7.7 0.4 Haskell
    A space-efficient set data structure.
  • EdisonAPI

    7.5 0.1 Haskell
    A library of efficient, purely-functional data structures (API)
  • type-level-sets

    7.3 1.3 Haskell
    Type-level sets and finite maps (with value-level counterparts)
  • claferIG

    7.2 2.6 Haskell
    claferIG is an interactive tool that generates instances of Clafer models.
  • rawr

    6.8 4.7 Haskell
    Anonymous extensible records
  • map-exts

    6.6 0.1 Haskell
    Extensions to Data.Map
  • heaps

    6.6 0.1 Haskell
    Asymptotically optimal Brodal/Okasaki heaps.
  • ixset-typed

    6.6 1.2 Haskell
    Efficient relational queries on Haskell sets.
  • mtl-c

    6.5 1.8 Haskell
    Very strict CPS'd transformers
  • ethereum-merkle-patricia-db

    6.5 0.0 Haskell
    A modified Merkle Patricia DB
  • igraph

    6.5 0.0 Haskell
    Bindings to the igraph C library.
  • data-r-tree

    6.3 0.0 Haskell
    R-Tree is a spatial data structure similar to Quadtrees or B-Trees.
  • map-syntax

    6.2 3.3 Haskell
    Syntax sugar for defining maps
  • multiset

    5.9 0.6 Haskell
    The Data.MultiSet container type
  • data-clist

    5.9 1.6 Haskell
    Simple functional ring type.
  • repa-devil

    5.7 0.0 Haskell
    Support for image reading and writing of Repa arrays using in-place FFI calls
  • composition-tree

    5.6 0.8 Haskell
    Composition trees for arbitrary monoids.
  • ethereum-rlp

    5.2 0.0 Haskell
    Ethereum Recursive Length Prefix Encoding
  • regional-pointers

    5.2 0.0 Haskell
    Regional memory pointers
  • DrIFT-cabalized

    5.2 0.0 Haskell
    Program to derive type class instances
  • DrIFT

    5.2 0.0 Haskell
    Program to derive type class instances
  • data-stringmap

    5.2 0.0 Haskell
    An efficient implementation of maps from strings to arbitrary values
  • btree-concurrent

    5.2 0.0 Haskell
    A backend agnostic, concurrent BTree
  • ixset

    5.0 0.6 Haskell
    Efficient relational queries on Haskell sets.
  • supermonad

    5.0 5.8 Haskell
    Plugin and base library to support supermonads in Haskell
  • composition-extra

    5.0 0.0 Haskell
    Combinators for unorthodox structure composition
  • open-typerep

    4.5 0.6 Haskell
    Open type representations and dynamic types
  • bytestring-trie

    4.5 0.0 Haskell
    An efficient finite map from (byte)strings to values.
  • safer-file-handles

    4.5 0.0 Haskell
    Type-safe file handling
  • TypeCompose

    4.2 0.2 Haskell
    Type composition classes & instances
  • composition

    3.6 0.0 Haskell
    Combinators for unorthodox function composition
  • bk-tree

    3.6 0.0 Haskell
    BK-tree implementation
  • type-level-bst

    3.1 0.0 Haskell
    type-level binary search trees in haskell
  • heap

    3.1 0.0 Haskell
    Heaps in Haskell
  • permutation

    3.1 0.0 Haskell
    A library for permutations and combinations.
  • invertible

    3.1 7.1 Haskell
    bidirectional arrows, bijective functions, and invariant functors
  • ilist

    2.6 3.8 Haskell
    Optimised list functions for doing index-related things
  • bookkeeper-permissions

    2.6 4.8 Haskell
    Permissions for bookkeeper records
  • colorful-monoids

    2.6 6.8 Haskell
    Styled console text output using ANSI escape sequences.
  • agda-snippets

    2.6 0.0 Haskell
    Render just the Agda snippets of a literate Agda file to HTML
  • HoleyMonoid

    2.1 2.2 Haskell
    Monoids with holes.
  • tie-knot

    2.1 0.0 Haskell
    "Ties the knot" on a given set of structures that reference each other by keys.
  • repa-sndfile

    2.1 0.0 Haskell
    Reading and writing sound files with repa arrays
  • repa-fftw

    2.1 0.0 Haskell
    Perform fft with repa via FFTW
  • array-memoize

    2.1 0.0 Haskell
    Memoization combinators using arrays for finite sub-domains of functions
  • monadic-arrays

    2.1 0.0 Haskell
    Boxed and unboxed arrays for monad transformers
  • usb-safe

    2.1 0.0 Haskell
    Type-safe communication with USB devices.
  • safer-file-handles-bytestring

    1.5 0.0 Haskell
    Extends safer-file-handles with ByteString operations
  • subwordgraph

    1.5 0.5 Haskell
    Subword graph implementation
  • safer-file-handles-text

    1.5 0.0 Haskell
    Extends safer-file-handles with Text operations
  • ethereum-analyzer

    0.8 8.7 Haskell
    A Ethereum contract analyzer.
  • stack-type

    0.8 3.1 Haskell
    The basic stack type
  • suffix-array

    0.7 7.4 Haskell
    Simple and moderately efficient suffix array implementation
  • type-indexed-queues

    0.7 8.3 Haskell
    Queues with verified and unverified versions.
  • nibblestring

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

    0.4 5.0 Haskell
    Typechecking terms of the Edinburgh Logical Framework (LF).

Add another 'Data Structures' Package