Safe Haskell | Safe |
---|---|

Language | Haskell2010 |

`AUTHOR`

- Dr. Alistair Ward
`DESCRIPTION`

- Defines a specific type of tree-structure, which is composed from either a datum, or a list of Tree-lists; https://en.wikipedia.org/wiki/Rose_Tree.
- This more general tree-structure has the shape of a regular-expression match.
- This contrasts with the typical binary-tree, which is either empty, or contains a (left Tree, datum, right Tree).

# Types

## Type-synonyms

## Data-types

A general purpose tree-type structure.

Leaf a | The payload. |

Node [TreeList a] | Recurse. N.B.: a list of lists is required to contain the |

## Instances

Functor Tree Source # | |

Foldable Tree Source # | |

Defined in RegExDot.Tree fold :: Monoid m => Tree m -> m # foldMap :: Monoid m => (a -> m) -> Tree a -> m # foldr :: (a -> b -> b) -> b -> Tree a -> b # foldr' :: (a -> b -> b) -> b -> Tree a -> b # foldl :: (b -> a -> b) -> b -> Tree a -> b # foldl' :: (b -> a -> b) -> b -> Tree a -> b # foldr1 :: (a -> a -> a) -> Tree a -> a # foldl1 :: (a -> a -> a) -> Tree a -> a # elem :: Eq a => a -> Tree a -> Bool # maximum :: Ord a => Tree a -> a # | |

Eq a => Eq (Tree a) Source # | |

Read a => Read (Tree a) Source # | |

Show a => Show (Tree a) Source # | |

NFData a => NFData (Tree a) Source # | |

Defined in RegExDot.Tree |