Data.Queue.Indexed.List

This module exists to showcase some uses for indexed non-priority queues.

Documentation

data List n a where

A simple length-indexed list.

Constructors

Nil :: List 0 a

(:-) :: a -> List n a -> List (1 + n) a infixr 5

Instances

MeldableIndexedQueue List a

Methods

merge :: List n a -> List m a -> List (n + m) a

IndexedQueue List a

Methods

empty :: List 0 a

minView :: List (1 + n) a -> (a, List n a)

singleton :: a -> List 1 a

insert :: a -> List n a -> List (1 + n) a

minViewMay :: List n a -> ((Nat ~ n) 0 -> b) -> (forall m. (Nat ~ (1 + m)) n => a -> List m a -> b) -> b

newtype DiffList n a

A list with efficient concatenation.

Constructors

DiffList

Fields

• runDiffList :: forall m. List m a -> List (n + m) a

Instances

MeldableIndexedQueue DiffList a

Performs merging in reverse order.

Methods

merge :: DiffList n a -> DiffList m a -> DiffList (n + m) a

IndexedQueue DiffList a

Methods

empty :: DiffList 0 a

minView :: DiffList (1 + n) a -> (a, DiffList n a)

singleton :: a -> DiffList 1 a

insert :: a -> DiffList n a -> DiffList (1 + n) a

minViewMay :: DiffList n a -> ((Nat ~ n) 0 -> b) -> (forall m. (Nat ~ (1 + m)) n => a -> DiffList m a -> b) -> b

reverseTraversable :: Traversable t => t a -> t a

Efficiently reverse any traversable, safely and totally.

>>> reverseTraversable [1,2,3]
[3,2,1]

reverseTraversable xs == reverse (xs :: [Int])

reverseTraversal :: ((a -> Parts DiffList List a a a) -> t -> Parts DiffList List a a t) -> t -> t

Efficiently reverse any traversable, safely and totally.

>>> reverseTraversal (traverse.traverse) ('a',[1,2,3])
('a',[3,2,1])