Package0.4.4.4Data
deque
Double-ended queues
- Version0.4.4.4
- CategoryData
- LicenceMIT
- AuthorNikita Volkov <nikita.
y. volkov@ mail. ru> - MaintainerNikita Volkov <nikita.
y. volkov@ mail. ru> - Homepagegithub.
com/ nikita-volkov/ deque - Pinned byhackage deque 0.
4. 4. 4 - Sourcedeque-0.
4. 4. 4 on Hackage
Modules
- Deque.LazyDefinitions of lazy Deque. The typical toList and fromList conversions are provided by means of
- Deque.Lazy.ReaderLazy Deque API lifted to a Reader monad, "mtl"-style.
- Deque.Lazy.StateLazy Deque API lifted to a State monad, "mtl"-style.
- Deque.StrictDefinitions of strict Deque. The typical toList and fromList conversions are provided by means of
- Deque.Strict.ReaderStrict Deque API lifted to a Reader monad, "mtl"-style.
- Deque.Strict.StateStrict Deque API lifted to a State monad, "mtl"-style.
Description
Strict and lazy implementations of Double-Ended Queue (aka Dequeue or Deque) based on head-tail linked list.
Depends on
5 packages- base-4.22.0.0with GHC
- deepseq-1.5.1.0with GHC
- hashable-1.5.1.0in this set
- mtl-2.3.1with GHC
- strict-list-1.0.0.1in this set
Used by in this set · 0
Nothing in this set depends on it.