Yoga.Tree.Extended

type Tree n = Tree n

leaf :: forall n. n -> Tree n

Create tree from given single value. |

node :: forall n. n -> Array (Tree n) -> Tree n

Create tree from given value and its children. |

value :: forall n. Tree n -> n

Get value of this tree node. |

children :: forall n. Tree n -> Array (Tree n)

Get children of the this tree node. |

Operator alias for Yoga.Tree.Extended.lnodeOp (right-associative / precedence 5)

lnodeOp :: forall n. n -> Array n -> Tree n

Node that only has leaves |

flatten :: forall a. Tree a -> Array a

Convert tree to a flat array structure:

break :: forall n a. (n -> Array (Tree n) -> a) -> Tree n -> a

Call this function on both the value and chidlren of this tree node. |

set :: forall n. n -> Tree n -> Tree n

Set value of the tree node. |

update :: forall n. (n -> n) -> Tree n -> Tree n

Update value of the tree node using its current value. |

catMaybes :: forall n. n -> Tree (Maybe n) -> Tree n

Leave only Just values in the tree. |

edges :: forall n. Tree n -> Array (n /\ n)

type EdgeState n = { edges :: Array (n /\ n), trees :: Array (Tree n) }

edgesAux :: forall n. EdgeState n -> EdgeState n