Safe Haskell | None |
---|---|
Language | Haskell2010 |
This module exists to showcase some uses for indexed non-priority queues.
- data List n a where
- newtype DiffList n a = DiffList {
- runDiffList :: forall m. List m a -> List (n + m) a
- reverseTraversable :: Traversable t => t a -> t a
- reverseTraversal :: ((a -> Parts DiffList List a a a) -> t -> Parts DiffList List a a t) -> t -> t
Documentation
A simple length-indexed list.
A list with efficient concatenation.
DiffList | |
|
MeldableIndexedQueue DiffList a Source # | Performs merging in reverse order. |
IndexedQueue DiffList a Source # | |
reverseTraversable :: Traversable t => t a -> t a Source #
Efficiently reverse any traversable, safely and totally.
>>>
reverseTraversable [1,2,3]
[3,2,1]
reverseTraversable xs == reverse (xs :: [Int])