linked-list-with-iterator

A pure linked list which is mutable through iterators.

https://github.com/CindyLinz/Haskell-linked-list-with-iterator#readme

LTS Haskell 12.26:	0.1.1.0
Stackage Nightly 2018-09-28:	0.1.1.0
Latest on Hackage:	0.1.1.0

See all snapshots linked-list-with-iterator appears in

BSD-3-Clause licensed by Cindy Wang (CindyLinz)

Maintained by [email protected]

This version can be pinned in stack with:linked-list-with-iterator-0.1.1.0@sha256:9941189523d2cfc5f5feb10776447c6c989e5c00f5507dc5ef087e938a1ec7c9,1637

Module documentation for 0.1.1.0

Data
- Data.IterLinkedList
  - Data.IterLinkedList.Internal

Depends on 2 packages(full list with versions):

base, containers

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.