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 9.10:0.1.1.0
Stackage Nightly 2017-10-22:0.1.1.0
Latest on Hackage:0.1.1.0
BSD3 licensed by Cindy Wang (CindyLinz)
Maintained by cindylinz@gmail.com

Module documentation for 0.1.1.0

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:
Used by 1 package:
comments powered byDisqus