development

Default instances for types in containers

Default instances for types in containers

Default instances for types in dlist

Default instances for types in newer versions of base package

Default instances for types in old-locale

Default instances for (lazy and strict)

Default instances for unordered-containers

Default instances for types defined in vector package

Space-efficient and privacy-preserving data dispersal algorithms

Extensible records and polymorphic variants

Isos & Lens for Data

Stick two binary words together to get a bigger one

Consistent set of utility functions for Maybe, Either, List and Monoids

A basic framework for effect systems based on effects represented by GADTs

A basic framework for effect systems based on effects represented by GADTs

Template Haskell utilities for the data-effects library

Coerce between unlifted boxed and lifted types

Executable and Linkable Format (ELF) data structures

Embed files and other binary blobs inside executables without Template Haskell

Combinator emoticons: data-aviary in the flavor of emoticons

Endian-sensitive data

Extend Haskell data or newtype like in OOP languages

None

A type safe file path data structure

Generate data-files Cabal file field from existing files

Utilities for filtering

Finite totally ordered sets

Simple integral finite set

Fixpoint data types

Common subexpression elimination for the fixploint types

A package for working with bit masks and flags in general

An efficient data type for sets of flags

Fold function applications

Specify that lifted values were forced to WHNF or NF

A simple multi-way tree data structure

Interface and functor transformers for fresh values

Map the arguments and return value of functions

Write functions in tacit (pointless) style using Applicative and De Bruijn index notation

Updatable analogue of Distributive functors

Simple extensible product

Combinators for building fast hashing functions

Provide a simple consistent hashing mechanism

Extending the concept of indices for lists and other containers

Interval datatype, interval arithmetic and interval-based containers

A simple lazy, infinite trie from integers

Write-once variables with concurrency support

Json Token datatype

Sculpt mutable recursive data with reference equality; bake it using a data kiln into an immutable…

Data layering utilities

Read/write arbitrary binary layouts to a "Data.Vector

Used to be Haskell 98 Lenses

Lenses

A Lens for IxSet

Simple lenses, minimum dependencies

Utilities for Data

Utilities for working with sequences within lists

A list but with a balanced enumeration of Cartesian product

Data

Combinators for building memo tables

A Haskell implementation of MessagePack

A Haskell implementation of MessagePack

Data types for named entities

Data Nat = Zero | Succ Nat

Represent hierachichal structures, called objects in JSON

Serialize JSON data to/from Haskell using the data-object library

Serialize data to and from Yaml files (deprecated)

A data type for non-exclusive disjunction

Set and bag operations on ordered lists

A pure disjoint set (union find) data structure

Read PDF form fields

Prettyprint and compare Data values

Reference cells that need two independent indices to be accessed

R-Tree is a spatial data structure similar to Quadtrees or B-Trees

Unify STRef and IORef in plain Haskell 98

Reify a recursive data structure into an explicit graph

Common Sub-Expression Elimination for graphs generated by Data.Reify

Alternative to Show data printing utility

Data types for returning results distinguishable by types

A typeclass for reversing order of contents

Ropes, an alternative to (Byte)Strings

Ropes, an alternative to (Byte)Strings

Recursive tuple data structure

Common API for serialization libraries

Profiling of data structures

Please see the README on GitHub at https://github.com/iand675/datasketches-haskell#readme

Please see the README on GitHub at https://github.com/iand675/datasketches-haskell#readme

Deprecated

A collection of standards representable by simple data types

ARM SVD and CubeMX XML parser and pretty printer for STM32 family

Type safe, in-memory dictionary with multidimensional keys

An efficient implementation of maps from strings to arbitrary values

Program that infers the fastest data structure available for your program

SVD (System view description) file handling

Shorter binary words

Tensor and Group typeclasses

Human-friendly textual representations

64-bit timeouts of nanosecond precision

Functions to transform data structures

Print Data instances as a nested tree

Reify a recursive data structure into an explicit graph