Copyright	(c) 2016 Allele Dev; 2017 Ixperta Solutions s.r.o.; 2017 Alexis King
License	BSD3
Maintainer	Alexis King <lexi.lambda@gmail.com>
Stability	experimental
Portability	GHC specific language extensions.
Safe Haskell	Safe-Inferred
Language	Haskell2010

Data.FTCQueue

Description

A minimal version of FTCQueue from "Reflection w/o Remorse":

Synopsis

data FTCQueue m a b
tsingleton :: (a -> m b) -> FTCQueue m a b
(|>) :: FTCQueue m a x -> (x -> m b) -> FTCQueue m a b
snoc :: FTCQueue m a x -> (x -> m b) -> FTCQueue m a b
(><) :: FTCQueue m a x -> FTCQueue m x b -> FTCQueue m a b
append :: FTCQueue m a x -> FTCQueue m x b -> FTCQueue m a b
data ViewL m a b where
- TOne :: (a -> m b) -> ViewL m a b
- (:|) :: (a -> m x) -> FTCQueue m x b -> ViewL m a b
tviewl :: FTCQueue m a b -> ViewL m a b

Documentation

Non-empty tree. Deconstruction operations make it more and more left-leaning

tsingleton :: (a -> m b) -> FTCQueue m a b Source #

Build a leaf from a single operation. [O(1)]

(|>) :: FTCQueue m a x -> (x -> m b) -> FTCQueue m a b Source #

Append an operation to the right of the tree. [O(1)]

snoc :: FTCQueue m a x -> (x -> m b) -> FTCQueue m a b Source #

An alias for (|>)

Append two trees of operations. [O(1)]

An alias for (><)

data ViewL m a b where Source #

Left view deconstruction data structure.

Constructors

TOne :: (a -> m b) -> ViewL m a b
(:\|) :: (a -> m x) -> FTCQueue m x b -> ViewL m a b

Left view deconstruction. [average O(1)]