Package Info

ghc-linked-list-with-iterator


A pure linked list which is mutable through iterators


Development/Libraries/Haskell

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: BSD-3-Clause
URL: https://hackage.haskell.org/package/linked-list-with-iterator

Categories

Releases

Package Version Update ID Released Package Hub Version Platforms Subpackages
0.1.1.0-bp150.2.5 info GA Release 2018-08-01 15
  • AArch64
  • ghc-linked-list-with-iterator
  • ghc-linked-list-with-iterator-devel
0.1.1.0-bp150.2.6 info GA Release 2018-07-30 15
  • x86-64
  • ghc-linked-list-with-iterator
  • ghc-linked-list-with-iterator-devel
0.1.1.0-bp150.2.7 info GA Release 2018-07-31 15
  • ppc64le
  • ghc-linked-list-with-iterator
  • ghc-linked-list-with-iterator-devel