Hackage :: [Package]

keyed: Generic indexing for many data structures

[ bsd3, data, library ] [ Propose Tags ]

This library provides generic indexing for a number of data structures, so that we can overload (!) in the same way we overload length with Foldable or (f)map with Functor.

[Skip to Readme]

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.1.0.0, 0.2.0.0, 0.3.0.0
Dependencies base (>=4.7 && <4.9), containers (>=0.5 && <=0.5.6.3), vector (>=0.8 && <=0.11.0.0) [details]
License BSD-3-Clause
Author Will Yager
Maintainer will.yager@gmail.com
Category Data
Home page https://github.com/wyager/keyed
Source repo head: git clone https://github.com/wyager/keyed.git
Uploaded by wyager at 2015-08-13T04:46:55Z
Distributions
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 2056 total (12 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2015-08-13 [all 1 reports]

Readme for keyed-0.3.0.0

[back to package description]

This library is simple enough: it provides overloaded functions for indexing data structures.

In Data.Keyed, we provide functions for pure data structures that return the contained values unwrapped.

For example, you can do [1,2,3] ! 2 or Map.fromList [(1,'a'),(2,'b')] ! 1.

In Data.MKeyed, we provide functions for data structures that return the contained values wrapped in a Monad (like IO, ST, or STM) or other container. This module is highly experimental, and it may change to improve interoperability with certain libraries.