linked-list-with-iterator

A pure linked list which is mutable through iterators. https://github.com/CindyLinz/Haskell-linked-list-with-iterator#readme

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]

Module documentation for 0.1.1.0

This version can be pinned in stack with:[email protected]:9941189523d2cfc5f5feb10776447c6c989e5c00f5507dc5ef087e938a1ec7c9,1637

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.

Depends on 2 packages(full list with versions):