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|
It's iternally implemented by
Integer as the iterator type respectly.
Most of the operations cost
Each newly inserted element will consume a unique number and never reuse old numbers.
Int one if you're sure that there're no more than
Int space times of insertions,
Integer one otherwise.