type-aligned-0.9.6: Various type-aligned sequence data structures.

Copyright(c) Atze van der Ploeg 2014
LicenseBSD-style
Maintaineratzeus@gmail.org
Stabilityprovisional
Portabilityportable
Safe HaskellSafe
LanguageHaskell98

Data.TASequence.BinaryTree

Description

A type aligned sequence which uses a binary tree, where the leaves are elements and then nodes are ><.

Documentation

module Data.TASequence

data BinaryTree c x y #

Instances

TASequence BinaryTree # 

Methods

tempty :: BinaryTree c x x #

tsingleton :: c x y -> BinaryTree c x y #

(><) :: BinaryTree c x y -> BinaryTree c y z -> BinaryTree c x z #

tviewl :: BinaryTree c x y -> TAViewL BinaryTree c x y #

tviewr :: BinaryTree c x y -> TAViewR BinaryTree c x y #

(|>) :: BinaryTree c x y -> c y z -> BinaryTree c x z #

(<|) :: c x y -> BinaryTree c y z -> BinaryTree c x z #

tmap :: (forall x y. c x y -> d x y) -> BinaryTree c x y -> BinaryTree d x y #