| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Generics.MRSOP.Examples.RoseTreeTH
Description
Usage example with template haskell support.
- data Rose a
- value1 :: Rose Int
- value2 :: Rose Int
- value3 :: Rose Int
- value4 :: Rose Int
- type FamRoseInt = '[Rose Int, [Rose Int]]
- type CodesRoseInt = '['['[K KInt, I (S Z)], '[K KInt]], '['[], '[I Z, I (S Z)]]]
- pattern Pat0586258 :: PoA Singl (El FamRoseInt) '[K KInt, I (S Z)] -> NS (PoA Singl (El FamRoseInt)) '['[K KInt, I (S Z)], '[K KInt]]
- pattern Pat0Leaf :: PoA Singl (El FamRoseInt) '[K KInt] -> NS (PoA Singl (El FamRoseInt)) '['[K KInt, I (S Z)], '[K KInt]]
- pattern Pat19193 :: PoA Singl (El FamRoseInt) '[] -> NS (PoA Singl (El FamRoseInt)) '['[], '[I Z, I (S Z)]]
- pattern Pat158 :: PoA Singl (El FamRoseInt) '[I Z, I (S Z)] -> NS (PoA Singl (El FamRoseInt)) '['[], '[I Z, I (S Z)]]
- pattern IdxListRoseInt :: forall (a :: Nat). () => forall (n :: Nat). ((~#) Nat Nat a (S n), (~#) Nat Nat n Z) => SNat a
- pattern IdxRoseInt :: forall (a :: Nat). () => (~#) Nat Nat a Z => SNat a
- tyInfo_1 :: [Char]
- tyInfo_0 :: [Char]
- testEq :: Bool
- normalize :: Rose Int -> Rose Int
- sumTree :: Rose Int -> Int
- testSum :: Bool
Defining the datatype
First, we will start off defining a variant of your standard Rose trees.
The Leaf constructor adds some redundancy on purpose, so we can
later use the combinators in the library to remove that redundancy.
Rose trees with redundancy.
Instances
| HasDatatypeInfo Kon Singl FamRoseInt CodesRoseInt Z Source # | |
| HasDatatypeInfo Kon Singl FamRoseInt CodesRoseInt (S Z) Source # | |
| Eq (Rose Int) Source # | Equality is defined using |
| Show a => Show (Rose a) Source # | |
pattern Pat0586258 :: PoA Singl (El FamRoseInt) '[K KInt, I (S Z)] -> NS (PoA Singl (El FamRoseInt)) '['[K KInt, I (S Z)], '[K KInt]] Source #
pattern Pat0Leaf :: PoA Singl (El FamRoseInt) '[K KInt] -> NS (PoA Singl (El FamRoseInt)) '['[K KInt, I (S Z)], '[K KInt]] Source #
pattern Pat19193 :: PoA Singl (El FamRoseInt) '[] -> NS (PoA Singl (El FamRoseInt)) '['[], '[I Z, I (S Z)]] Source #
pattern Pat158 :: PoA Singl (El FamRoseInt) '[I Z, I (S Z)] -> NS (PoA Singl (El FamRoseInt)) '['[], '[I Z, I (S Z)]] Source #
pattern IdxListRoseInt :: forall (a :: Nat). () => forall (n :: Nat). ((~#) Nat Nat a (S n), (~#) Nat Nat n Z) => SNat a Source #
Eq Instance
Compos test
Crush test
The sum of a tree should be the same as the sum of a normalized tree;
This should return True.