homepage: https://github.com/CindyLinz/Haskell-linked-list-with-iterator#readme
changelog-type: ''
hash: c4743c1e6031a7967862860126f1720ac520260c9f480e045a52d471dade67c2
test-bench-deps:
  base: -any
  linked-list-with-iterator: -any
maintainer: cindylinz@gmail.com
synopsis: A pure linked list which is mutable through iterators.
changelog: ''
basic-deps:
  base: ! '>=4.3 && <5'
  containers: ==0.5.*
all-versions:
- '0.1.0.0'
author: Cindy Wang (CindyLinz)
latest: '0.1.0.0'
description-type: haddock
description: ! '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.'
license-name: BSD3

Update from Hackage at 2016-09-28T11:29:07+00:00
Update from Hackage at 2016-09-28T11:29:07+00:00
