map-exts: Extensions to Data.Map

This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.

[maintain] [Publish]

Warnings:

The 'description' field should be longer than the 'synopsis' field. It's useful to provide an informative 'description' to allow Haskell programmers who have never heard about your package to understand the purpose of your package. The 'description' field content is typically shown by tooling (e.g. 'cabal info', Haddock, Hackage) below the 'synopsis' which serves as a headline. Please refer to <https://www.haskell.org/cabal/users-guide/developing-packages.html#package-properties> for more details.

Extensions to Data.Map

[Skip to Readme]

Properties

Versions	0.1.0.0, 0.1.0.1, 0.1.1.0, 0.2.0.0, 0.2.0.0
Change log	CHANGELOG.md
Dependencies	base (>=4.7 && <5), bytestring, cassava, containers (>=0.5.8.1 && <0.6) [details]
License	BSD-3-Clause
Copyright	2016 Elsen, Inc
Author	Charles Cooper
Maintainer	cooper.charles.m@gmail.com
Category	Data Structures
Home page	http://github.com/charles-cooper/map-exts#readme
Source repo	head: git clone https://github.com/charles-cooper/map-exts
Uploaded	by coopercm at 2018-01-10T00:02:48Z

Modules

[Index]

Data
- Map
  - Data.Map.Extensions

Downloads

map-exts-0.2.0.0.tar.gz [browse] (Cabal source package)
Package description (as included in the package)

Maintainer's Corner

Package maintainers

coopercm

For package maintainers and hackage trustees

edit package information

Readme for map-exts-0.2.0.0

[back to package description]

map-extensions

This module contains some extensions to Data.Map. Some of them are convenience functions.

It also contains functions to support a split-apply-combine workflow, by representing labeled, multi-dimensional data as multiply nested Maps. For instance, a two dimensional matrix with one axis indexed by 'Name's and the other axis labeled by 'Job's, we would represent such a structure with a Lookup2 Name Job Double. Such a structure is not terribly efficient (it takes O(n log(n)) space and O(log(n)) time for insert/update/delete operations with high constant factor owing to all the pointer manipulation), but it is expressive.

Here is the rough correspondence between split-apply-combine and the verbs used in this package:

split : groupBy

apply : fmap

combine : foldr/foldMap

reshape : transpose

For more information, see the examples.