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]

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.1.0.0, 0.1.1.0, 0.2.0.0, 0.3.0.0, 0.4.0.0
Dependencies base (>=4.7 && <4.8), containers (>=0.5 && <0.6), deepseq (>=1.1), hashable (>=1.2 && <1.3), unordered-containers (>=0.2 && <0.3) [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 2014-10-19T22:49:07Z
Distributions
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 3969 total (19 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-06-04 [all 1 reports]

Readme for linkedhashmap-0.3.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