Data.ProxN.Tree2N

Documentation

data Tree2N n a

Constructors

Tree2NBranch !a !(Treed n (Tree2N n a))

Tree2NLeaf

Instances

Tree2NClass n => Functor (Tree2N n)

Tree2NClass n => Applicative (Tree2N n)

Tree2NClass n => Pretty1 (Tree2N n)

(Show a, Tree2NClass n) => Show (Tree2N n a)

(Tree2NClass n, Pretty a) => Pretty (Tree2N n a)

class (Functor (Treed n), Applicative (Treed n), Show1 (Treed n), Pretty1 (Treed n)) => Tree2NClass n where

Associated Types

data Treed n :: * -> *

Methods

swapNode :: Ord a => (b -> b) -> VecN n a -> VecN n a -> Treed n b -> Treed n b

foldTree :: (a -> b) -> VecN n (b -> b -> b) -> Treed n a -> b

chooseNode :: Ord a => VecN n a -> VecN n a -> Treed n b -> b

Instances

Tree2NClass Zero

Tree2NClass n => Tree2NClass (Succ n)

type VecTree n a = Tree2N n (VecN n a)

fold2NTree :: Tree2NClass n => b -> VecN n (b -> b -> b) -> (a -> b -> b) -> Tree2N n a -> b

fromList :: (Ord a, Tree2NClass n) => [VecN n a] -> VecTree n a

depth :: (Tree2NClass n, VecNClass n) => Tree2N n a -> Int

size :: (Tree2NClass n, VecNClass n) => Tree2N n a -> Int

tree0 :: Tree2N Zero Int

tree1 :: Tree2N One Int

tree2 :: Tree2N Two Int

tree3 :: Tree2N Three Int