linked-list-with-iterator: A pure linked list which is mutable through iterators.

[ bsd3, data-structures, library ] [ Propose Tags ]

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.


Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees


  • No Candidates
Versions [RSS],
Dependencies base (>=4.3 && <5), containers (>=0.5 && <0.6) [details]
License BSD-3-Clause
Copyright MIT
Author Cindy Wang (CindyLinz)
Category Data Structures
Home page
Source repo head: git clone
Uploaded by CindyLinz at 2016-09-29T18:42:26Z
Reverse Dependencies 1 direct, 0 indirect [details]
Downloads 1440 total (6 in the last 30 days)
Rating 2.0 (votes: 1) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2016-09-29 [all 1 reports]