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.

Properties

Versions 0.1.0.0, 0.1.1.0
Dependencies base (>=4.3 && <5), containers (==0.5.*) [details]
License BSD3
Copyright MIT
Author Cindy Wang (CindyLinz)
Maintainer cindylinz@gmail.com
Category Data Structures
Home page https://github.com/CindyLinz/Haskell-linked-list-with-iterator#readme
Source repository head: git clone https://github.com/CindyLinz/Haskell-linked-list-with-iterator
Uploaded Thu Sep 29 18:42:26 UTC 2016 by CindyLinz
Distributions LTSHaskell:0.1.1.0, NixOS:0.1.1.0, Stackage:0.1.1.0, Tumbleweed:0.1.1.0
Downloads 92 total (7 in the last 30 days)
Votes
0 []
Status Docs available [build log]
Last success reported on 2016-09-29 [all 1 reports]
Hackage Matrix CI

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees