Data.RAVec.Tree · ral-0.2.2

datadata Tree (n :: Nat) a where

#

Perfectly balanced binary tree of depth n, with 2 ^ n elements.

Constructors

Leaf :: a -> Tree 'Z a
Node :: Tree n1 a -> Tree n1 a -> Tree ('S n1) a

Instances23Functor, Applicative, Foldable, Traversable, Foldable1, Arbitrary1, …

Functor (Tree n)Defined in ral-0.2.2 · Data.RAVec.Tree
SNatI n => Applicative (Tree n)Defined in ral-0.2.2 · Data.RAVec.Tree
Foldable (Tree n)Defined in ral-0.2.2 · Data.RAVec.Tree
Traversable (Tree n)Defined in ral-0.2.2 · Data.RAVec.Tree
Foldable1 (Tree n)Defined in ral-0.2.2 · Data.RAVec.Tree
SNatI n => Arbitrary1 (Tree n)Defined in ral-0.2.2 · Data.RAVec.Tree
SNatI n => Distributive (Tree n)Defined in ral-0.2.2 · Data.RAVec.Tree
Apply (Tree n)Defined in ral-0.2.2 · Data.RAVec.Tree
Traversable1 (Tree n)Defined in ral-0.2.2 · Data.RAVec.Tree
SNatI n => Representable (Tree n)Defined in ral-0.2.2 · Data.RAVec.Tree
FoldableWithIndex (Wrd n) (Tree n)Defined in ral-0.2.2 · Data.RAVec.Tree
FunctorWithIndex (Wrd n) (Tree n)Defined in ral-0.2.2 · Data.RAVec.Tree
TraversableWithIndex (Wrd n) (Tree n)Defined in ral-0.2.2 · Data.RAVec.Tree
Eq a => Eq (Tree n a)Defined in ral-0.2.2 · Data.RAVec.Tree
Ord a => Ord (Tree n a)Defined in ral-0.2.2 · Data.RAVec.Tree
Show a => Show (Tree n a)Defined in ral-0.2.2 · Data.RAVec.Tree
Semigroup a => Semigroup (Tree n a)Defined in ral-0.2.2 · Data.RAVec.Tree
NFData a => NFData (Tree n a)Defined in ral-0.2.2 · Data.RAVec.Tree
(SNatI n, Arbitrary a) => Arbitrary (Tree n a)Defined in ral-0.2.2 · Data.RAVec.Tree
CoArbitrary a => CoArbitrary (Tree n a)Defined in ral-0.2.2 · Data.RAVec.Tree
(SNatI n, Function a) => Function (Tree n a)Defined in ral-0.2.2 · Data.RAVec.Tree
Hashable a => Hashable (Tree n a)Defined in ral-0.2.2 · Data.RAVec.Tree
type Rep (Tree n) = Wrd nDefined in ral-0.2.2 · Data.RAVec.Tree

Construction

1 declaration

valuesingleton :: a -> Tree 'Z a

#

Tree of zero depth, with single element.

Example1 expression

>>> singleton TrueLeaf True

Conversions

2 declarations

valuetoList :: Tree n a -> [a]

#

Convert Tree to list.

Example1 expression

>>> toList $ Node (Node (Leaf 'a') (Leaf 'b')) (Node (Leaf 'c') (Leaf 'd'))"abcd"

valuereverse :: Tree n a -> Tree n a

#

Reverse Tree.

Example2 expressions

>>> let t = Node (Node (Leaf 'a') (Leaf 'b')) (Node (Leaf 'c') (Leaf 'd'))>>> reverse tNode (Node (Leaf 'd') (Leaf 'c')) (Node (Leaf 'b') (Leaf 'a'))

Indexing

4 declarations

value(!) :: Tree n a -> Wrd n -> a

#

Indexing.

valuetabulate :: SNatI n => (Wrd n -> a) -> Tree n a

#

valueleftmost :: Tree n a -> a

#

valuerightmost :: Tree n a -> a

#

Folds

10 declarations

valuefoldMap :: Monoid m => (a -> m) -> Tree n a -> m

#

valuefoldMap1 :: Semigroup s => (a -> s) -> Tree n a -> s

#

valueifoldMap :: Monoid m => (Wrd n -> a -> m) -> Tree n a -> m

#

valueifoldMap1 :: Semigroup s => (Wrd n -> a -> s) -> Tree n a -> s

#

valuefoldr :: (a -> b -> b) -> b -> Tree n a -> b

#

Example1 expression

>>> foldr (:) [] $ Node (Leaf True) (Leaf False)[True,False]

valueifoldr :: (Wrd n -> a -> b -> b) -> b -> Tree n a -> b

#

valuefoldr1Map :: (a -> b -> b) -> (a -> b) -> Tree n a -> b

#

valueifoldr1Map :: (Wrd n -> a -> b -> b) -> (Wrd n -> a -> b) -> Tree n a -> b

#

valuefoldl :: (b -> a -> b) -> b -> Tree n a -> b

#

Example1 expression

>>> foldl (flip (:)) [] $ Node (Leaf True) (Leaf False)[False,True]

valueifoldl :: (Wrd n -> b -> a -> b) -> b -> Tree n a -> b

#

Special folds

4 declarations

valuelength :: Tree n a -> Int

#

Example1 expression

>>> length (universe :: Tree N.Nat3 (Wrd N.Nat3))8

valuenull :: Tree n a -> Bool

#

valuesum :: Num a => Tree n a -> a

#

Non-strict sum.

valueproduct :: Num a => Tree n a -> a

#

Non-strict product.

Mapping

7 declarations

valuemap :: (a -> b) -> Tree n a -> Tree n b

#

Example1 expression

>>> map not $ Node (Leaf True) (Leaf False)Node (Leaf False) (Leaf True)

valueimap :: (Wrd n -> a -> b) -> Tree n a -> Tree n b

#

Example1 expression

>>> imap (,) $ Node (Leaf True) (Leaf False)Node (Leaf (0b0,True)) (Leaf (0b1,False))

valuetraverse :: Applicative f => (a -> f b) -> Tree n a -> f (Tree n b)

#

valueitraverse

:: Applicative f
=> Wrd n -> a -> f b
-> Tree n a
-> f (Tree n b)

#

valuetraverse1 :: Apply f => (a -> f b) -> Tree n a -> f (Tree n b)

#

valueitraverse1 :: Apply f => (Wrd n -> a -> f b) -> Tree n a -> f (Tree n b)

#

valueitraverse_ :: Applicative f => (Wrd n -> a -> f b) -> Tree n a -> f ()

#

Zipping

3 declarations

valuezipWith :: (a -> b -> c) -> Tree n a -> Tree n b -> Tree n c

#

Zip two Vecs with a function.

valueizipWith :: (Wrd n -> a -> b -> c) -> Tree n a -> Tree n b -> Tree n c

#

Zip two Trees. with a function that also takes the elements' indices.

valuerepeat :: SNatI n => a -> Tree n a

#

Repeat a value.

Example1 expression

>>> repeat 'x' :: Tree N.Nat2 CharNode (Node (Leaf 'x') (Leaf 'x')) (Node (Leaf 'x') (Leaf 'x'))

Universe

1 declaration

valueuniverse :: SNatI n => Tree n (Wrd n)

#

Get all Vec n Bool indices in Tree n.

Example1 expression

>>> universe :: Tree N.Nat2 (Wrd N.Nat2)Node (Node (Leaf 0b00) (Leaf 0b01)) (Node (Leaf 0b10) (Leaf 0b11))

QuickCheck

2 declarations

valueliftArbitrary :: SNatI n => Gen a -> Gen (Tree n a)

#

valueliftShrink :: (a -> [a]) -> Tree n a -> [Tree n a]

#