The linked-list-with-iterator package

[Tags:bsd3, library, test]

It's iternally implemented by Data.IntMap.Strict.IntMap or Data.Map.Strict.Map Integer, using Int or Integer as the iterator type respectly. Most of the operations cost O(lg N).

Each newly inserted element will consume a unique number and never reuse old numbers. Choose Int one if you're sure that there're no more than Int space times of insertions, or choose Integer one otherwise.


Dependencies base (>=4.3 && <5), containers (==0.5.*) [details]
License BSD3
Copyright MIT
Author Cindy Wang (CindyLinz)
Category Data Structures
Home page
Source repository head: git clone
Uploaded Thu Sep 29 18:42:26 UTC 2016 by CindyLinz
Distributions LTSHaskell:, NixOS:, Stackage:, Tumbleweed:
Downloads 75 total (6 in the last 30 days)
0 []
Status Docs available [build log]
Last success reported on 2016-09-29 [all 1 reports]




Maintainer's Corner

For package maintainers and hackage trustees