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.

Downloads

Maintainer's Corner

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.1.0.0, 0.1.1.0
Dependencies base (>=4.3 && <5), containers (>=0.5 && <0.6) [details]
License BSD-3-Clause
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 repo head: git clone https://github.com/CindyLinz/Haskell-linked-list-with-iterator
Uploaded by CindyLinz at 2016-09-29T18:42:26Z
Distributions NixOS:0.1.1.0
Downloads 1319 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]