linkedhashmap: Persistent LinkedHashMap data structure

[ bsd3, data, library ] [ Propose Tags ]

Haskell implementation of Java LinkedHashMap.

Underlying HashMap is based on Data.HashMap.Strict.

Two different implementations are based on Data.Sequence and Data.IntMap.Strict to keep keys in the order of insertion.

Criterion report: https://cdn.rawgit.com/abasko/linkedhashmap/68de7332e80db673e024906321ad2e14c2baa4d1/benchmarks/report.html


[Skip to Readme]
Versions 0.1.0.0, 0.1.1.0, 0.2.0.0, 0.3.0.0, 0.4.0.0
Dependencies base (>=4.6 && <5), containers (==0.5.*), deepseq (>=1.1 && <2), hashable (>=1.2 && <2), unordered-containers (==0.2.*) [details]
License BSD-3-Clause
Copyright Copyright (C) 2014 Andrey Basko
Author Andrey Basko
Maintainer Andrey Basko <andrey_basko@yahoo.com>
Category Data
Home page https://github.com/abasko/linkedhashmap
Bug tracker https://github.com/abasko/linkedhashmap/issues
Source repo head: git clone git://github.com/abasko/linkedhashmap.git
Uploaded by abasko at Sat Feb 7 02:07:24 UTC 2015
Distributions NixOS:0.4.0.0
Downloads 1695 total (17 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees


Readme for linkedhashmap-0.4.0.0

[back to package description]

Persistent LinkedHashMap

Haskell implementation of Java LinkedHashMap.

Underlying HashMap is based on Data.HashMap.Strict.

Two different implementations are based on Data.Sequence and Data.IntMap.Strict to keep keys in the order of insertion.

Criterion report: https://cdn.rawgit.com/abasko/linkedhashmap/68de7332e80db673e024906321ad2e14c2baa4d1/benchmarks/report.html