Results for “Std.Tree.Tree”

Use module:Std.List, kind:fn, or is:exact. Put a Pudu type after ::.

• Std.Tree.Tree

  A value with a sequence of trees beneath it.

  type · Std.Tree
• Std.Tree.at&Std.Tree.Tree[T] -> &Array[Int] -> Option[Std.Tree.Tree[T]]

  The subtree at a path, or None when the path leads nowhere.

  fn · Std.Tree
• Std.Tree.breadthFirst&Std.Tree.Tree[T] -> Array[T]

  Every value, nearest the root first, level by level.

  fn · Std.Tree
• Std.Tree.childrenOf&Std.Tree.Tree[T] -> Array[Std.Tree.Tree[T]]

  The children of a node, in order.

  fn · Std.Tree
• Std.Tree.contains&Std.Tree.Tree[T] -> T -> Bool where T: Eq

  Whether any node carries this value.

  fn · Std.Tree
• Std.Tree.count&Std.Tree.Tree[T] -> fn(T) -> Bool -> Int

  How many nodes the test accepts.

  fn · Std.Tree
• Std.Tree.degree&Std.Tree.Tree[T] -> Int

  How many children a node has directly.

  fn · Std.Tree
• Std.Tree.find&Std.Tree.Tree[T] -> fn(T) -> Bool -> Option[T]

  The first value the test accepts, in preorder, or None.

  fn · Std.Tree
• Std.Tree.flatMap&Std.Tree.Tree[A] -> fn(A) -> Std.Tree.Tree[B] -> Std.Tree.Tree[B]

  Each value replaced by a whole tree, grafted where the value stood.

  fn · Std.Tree
• Std.Tree.fold&Std.Tree.Tree[T] -> fn(A, T) -> A -> A -> A

  Every value combined into one, each node before its children.

  fn · Std.Tree
• Std.Tree.foldTree&Std.Tree.Tree[A] -> fn(A, Array[B]) -> B -> B

  Each node combined with what its children answered.

  fn · Std.Tree
• Std.Tree.height&Std.Tree.Tree[T] -> Int

  How many nodes lie on the longest path from the root, the root included.

  fn · Std.Tree
• Std.Tree.isLeaf&Std.Tree.Tree[T] -> Bool

  Whether a node has nothing beneath it.

  fn · Std.Tree
• Std.Tree.leafT -> Std.Tree.Tree[T]

  A node with nothing beneath it.

  fn · Std.Tree
• Std.Tree.leaves&Std.Tree.Tree[T] -> Array[T]

  Every value that has nothing beneath it, in preorder.

  fn · Std.Tree
• Std.Tree.levels&Std.Tree.Tree[T] -> Array[Array[T]]

  The values at each depth, nearest the root first.

  fn · Std.Tree
• Std.Tree.map&Std.Tree.Tree[A] -> fn(A) -> B -> Std.Tree.Tree[B]

  Every value transformed, keeping the shape and the order.

  fn · Std.Tree
• Std.Tree.mapOption&Std.Tree.Tree[A] -> fn(A) -> Option[B] -> Option[Std.Tree.Tree[B]]

  Every value transformed, keeping the shape, where transforming may answer

  fn · Std.Tree
• Std.Tree.mapResult&Std.Tree.Tree[A] -> fn(A) -> Result[B, E] -> Result[Std.Tree.Tree[B], E]

  Every value transformed, keeping the shape, where transforming may fail.

  fn · Std.Tree
• Std.Tree.mapWithPath&Std.Tree.Tree[A] -> fn(Array[Int], A) -> B -> Std.Tree.Tree[B]

  Every value transformed, told where in the tree it sits.

  fn · Std.Tree
• Std.Tree.nodeT -> &Array[Std.Tree.Tree[T]] -> Std.Tree.Tree[T]

  A node with the given children, in the order given.

  fn · Std.Tree
• Std.Tree.outline&Std.Tree.Tree[T] -> Array[Str]

  The tree drawn as indented lines, each value shown as the session shows it.

  fn · Std.Tree
• Std.Tree.pathTo&Std.Tree.Tree[T] -> fn(T) -> Bool -> Option[Array[Int]]

  The path to the first node the test accepts, in preorder, or None.

  fn · Std.Tree
• Std.Tree.postorder&Std.Tree.Tree[T] -> Array[T]

  Every value, each node after its children, children in order.

  fn · Std.Tree
• Std.Tree.preorder&Std.Tree.Tree[T] -> Array[T]

  Every value, each node before its children, children in order.

  fn · Std.Tree
• Std.Tree.prune&Std.Tree.Tree[T] -> fn(T) -> Bool -> Option[Std.Tree.Tree[T]]

  The tree with every node the test rejects removed, along with everything

  fn · Std.Tree
• Std.Tree.reversed&Std.Tree.Tree[T] -> Std.Tree.Tree[T]

  The tree with its children in the reverse of their order, at every depth.

  fn · Std.Tree
• Std.Tree.sameShape&Std.Tree.Tree[A] -> &Std.Tree.Tree[B] -> Bool

  Whether two trees hold the same values in the same shape and order.

  fn · Std.Tree
• Std.Tree.sequenceOption&Std.Tree.Tree[Option[T]] -> Option[Std.Tree.Tree[T]]

  A tree of options turned into an option holding a tree.

  fn · Std.Tree
• Std.Tree.sequenceResult&Std.Tree.Tree[Result[T, E]] -> Result[Std.Tree.Tree[T], E]

  A tree of results turned into a result holding a tree.

  fn · Std.Tree
• Std.Tree.size&Std.Tree.Tree[T] -> Int

  How many nodes the tree holds, the root included.

  fn · Std.Tree
• Std.Tree.trailTo&Std.Tree.Tree[T] -> fn(T) -> Bool -> Option[Array[T]]

  The values from the root down to the first node the test accepts.

  fn · Std.Tree
• Std.Tree.unfoldS -> fn(S) -> (T, Array[S]) -> Std.Tree.Tree[T]

  A tree grown from a starting value.

  fn · Std.Tree
• Std.Tree.unfoldForest&Array[S] -> fn(S) -> (T, Array[S]) -> Array[Std.Tree.Tree[T]]

  A forest grown from several starting values.

  fn · Std.Tree
• Std.Tree.unfoldResultS -> fn(S) -> Result[(T, Array[S]), E] -> Result[Std.Tree.Tree[T], E]

  A tree grown from a starting value, where growing may fail.

  fn · Std.Tree
• Std.Tree.unfoldToS -> fn(S) -> (T, Array[S]) -> Int -> Std.Tree.Tree[T]

  A tree grown from a starting value, stopping at a given depth.

  fn · Std.Tree
• Std.Tree.valueOf&Std.Tree.Tree[T] -> T

  The value a node carries.

  fn · Std.Tree
• Std.Tree.withChild&Std.Tree.Tree[T] -> &Std.Tree.Tree[T] -> Std.Tree.Tree[T]

  The tree with a child added after the ones already there.

  fn · Std.Tree
• Std.Tree.zipWith&Std.Tree.Tree[A] -> &Std.Tree.Tree[B] -> fn(A, B) -> C -> Std.Tree.Tree[C]

  Two trees combined node by node, as far as both go.

  fn · Std.Tree