Uses of Class fj.data.Tree

Packages that use Tree
Package	Description
fj	Types that set the premise for the existence of Functional Java.
fj.control.parallel	Parallelization strategies.
fj.data	Common algebraic data types.

Uses of Tree in fj

Methods in fj that return Tree
Modifier and Type	Method	Description
`Tree<java.lang.reflect.Type>`	Class.`classParameters()`	Provides this class's type parameter information as a Tree of the type expression.
`Tree<java.lang.reflect.Type>`	Class.`superclassParameters()`	Provides this class's superclass type parameter information as a Tree of the type expression.
`static Tree<java.lang.reflect.Type>`	Class.`typeParameterTree(java.lang.reflect.Type t)`	Provides type parameter information as a Tree of the type expression.

Methods in fj that return types with arguments of type Tree
Modifier and Type	Method	Description
`default F<Tree<A>,B>`	F.`foldMapTree(Monoid<B> m)`	Returns a function that maps this function over a tree and folds it with the given monoid.
`List<Tree<java.lang.reflect.Type>>`	Class.`interfaceParameters()`	Provides this class's interface type parameter information as a list of trees.
`default F<Tree<A>,Tree<B>>`	F.`mapTree()`	Promotes this function to map over a Tree.
`default F<Tree<A>,Tree<B>>`	F.`mapTree()`	Promotes this function to map over a Tree.
`static <A> Equal<Tree<A>>`	Equal.`treeEqual(Equal<A> ea)`	An equal instance for the `Tree` type.
`static <A> Hash<Tree<A>>`	Hash.`treeHash(Hash<A> ha)`	A hash instance for the `Tree` type.
`default F<A,Tree<B>>`	F.`treeK()`	Promotes this function to return its value in a Tree.
`default F2<Tree<A>,Tree<B>,Tree<C>>`	F2.`treeM()`	Promotes this function to a function on Trees.
`default F2<Tree<A>,Tree<B>,Tree<C>>`	F2.`treeM()`	Promotes this function to a function on Trees.
`default F2<Tree<A>,Tree<B>,Tree<C>>`	F2.`treeM()`	Promotes this function to a function on Trees.
`static <A> Show<Tree<A>>`	Show.`treeShow(Show<A> sa)`	A show instance for the `Tree` type.
`default F2<Tree<A>,Tree<B>,Tree<C>>`	F2.`zipTreeM()`	Promotes this function to zip two trees, applying the function lock-step over both trees.
`default F2<Tree<A>,Tree<B>,Tree<C>>`	F2.`zipTreeM()`	Promotes this function to zip two trees, applying the function lock-step over both trees.
`default F2<Tree<A>,Tree<B>,Tree<C>>`	F2.`zipTreeM()`	Promotes this function to zip two trees, applying the function lock-step over both trees.

Uses of Tree in fj.control.parallel

Methods in fj.control.parallel that return types with arguments of type Tree
Modifier and Type	Method	Description
`<A,B> Promise<Tree<B>>`	ParModule.`parExtend(Tree<A> ta, F<Tree<A>,B> f)`	Maps the given function across all subtrees of the given Tree in parallel.
`<A,B> Promise<Tree<B>>`	ParModule.`parMap(Tree<A> ta, F<A,B> f)`	Maps a function across a Tree in parallel.
`<A,B> F<F<A,B>,F<Tree<A>,Promise<Tree<B>>>>`	ParModule.`parMapTree()`	A first-class function that maps across a Tree in parallel.
`<A,B> F<F<A,B>,F<Tree<A>,Promise<Tree<B>>>>`	ParModule.`parMapTree()`	A first-class function that maps across a Tree in parallel.

Methods in fj.control.parallel with parameters of type Tree
Modifier and Type	Method	Description
`<A,B> Promise<Tree<B>>`	ParModule.`parExtend(Tree<A> ta, F<Tree<A>,B> f)`	Maps the given function across all subtrees of the given Tree in parallel.
`<A,B> Promise<Tree<B>>`	ParModule.`parMap(Tree<A> ta, F<A,B> f)`	Maps a function across a Tree in parallel.

Method parameters in fj.control.parallel with type arguments of type Tree
Modifier and Type	Method	Description
`<A,B> Promise<Tree<B>>`	ParModule.`parExtend(Tree<A> ta, F<Tree<A>,B> f)`	Maps the given function across all subtrees of the given Tree in parallel.

Uses of Tree in fj.data

Fields in fj.data declared as Tree
Modifier and Type	Field	Description
`private Tree<A>`	TreeZipper.`tree`

Fields in fj.data with type parameters of type Tree
Modifier and Type	Field	Description
`private Stream<Tree<A>>`	TreeZipper.`lefts`
`private Stream<P3<Stream<Tree<A>>,A,Stream<Tree<A>>>>`	TreeZipper.`parents`
`private Stream<P3<Stream<Tree<A>>,A,Stream<Tree<A>>>>`	TreeZipper.`parents`
`private Stream<Tree<A>>`	TreeZipper.`rights`
`private P1<Stream<Tree<A>>>`	Tree.`subForest`

Methods in fj.data that return Tree
Modifier and Type	Method	Description
`static <A,B> Tree<B>`	Tree.`bottomUp(Tree<A> t, F<P2<A,Stream<B>>,B> f)`	Folds a Tree into a Tree by applying the function f from the bottom of the Tree to the top
`<B> Tree<B>`	Tree.`cobind(F<Tree<A>,B> f)`	Applies the given function to all subtrees of this tree, returning a tree of the results (comonad pattern).
`Tree<Tree<A>>`	Tree.`cojoin()`	Expands this tree into a tree of trees, with this tree as the root label, and subtrees as the labels of child nodes (comonad pattern).
`<B> Tree<B>`	Tree.`fmap(F<A,B> f)`	Maps the given function over this tree.
`Tree<A>`	TreeZipper.`focus()`	Returns the tree at the currently focused node.
`static <A> Tree<A>`	Tree.`leaf(A root)`	Creates a nullary tree.
`static <A> Tree<A>`	Tree.`node(A root, List<Tree<A>> forest)`	Creates a new n-ary given a root and a subforest of length n.
`static <A> Tree<A>`	Tree.`node(A root, Stream<Tree<A>> forest)`	Creates a new tree given a root and a (potentially infinite) subforest.
`static <A> Tree<A>`	Tree.`node(A root, P1<Stream<Tree<A>>> forest)`	Creates a new tree given a root and a (potentially infinite) subforest.
`Tree<A>`	TreeZipper.`toTree()`	Returns the tree containing this location.
`<B,C> Tree<C>`	Tree.`zipWith(Tree<B> bs, F<A,F<B,C>> f)`	Zips this tree with another, using the given function.
`<B,C> Tree<C>`	Tree.`zipWith(Tree<B> bs, F2<A,B,C> f)`	Zips this tree with another, using the given function.

Methods in fj.data that return types with arguments of type Tree
Modifier and Type	Method	Description
`Tree<Tree<A>>`	Tree.`cojoin()`	Expands this tree into a tree of trees, with this tree as the root label, and subtrees as the labels of child nodes (comonad pattern).
`private static <A> Stream<Tree<A>>`	TreeZipper.`combChildren(Stream<Tree<A>> ls, Tree<A> t, Stream<Tree<A>> rs)`
`private Stream<P3<Stream<Tree<A>>,A,Stream<Tree<A>>>>`	TreeZipper.`downParents()`
`private Stream<P3<Stream<Tree<A>>,A,Stream<Tree<A>>>>`	TreeZipper.`downParents()`
`static <A> F2<F<Tree<A>,java.lang.Boolean>,TreeZipper<A>,Option<TreeZipper<A>>>`	TreeZipper.`findChild()`	A first-class version of the findChild function.
`static <A> F<Tree<A>,Stream<A>>`	Tree.`flatten_()`	`flatten :: Tree a -> [a] flatten t = squish t []`
`static <A,B> F<F<A,B>,F<Tree<A>,Tree<B>>>`	Tree.`fmap_()`	Provides a transformation to lift any function so that it maps over Trees.
`static <A,B> F<F<A,B>,F<Tree<A>,Tree<B>>>`	Tree.`fmap_()`	Provides a transformation to lift any function so that it maps over Trees.
`static <A,B> F<Tree<A>,B>`	Tree.`foldMap_(F<A,B> f, Monoid<B> m)`	Provides a function that folds a tree with the given monoid.
`static <A> F<Tree<A>,TreeZipper<A>>`	TreeZipper.`fromTree()`	First-class conversion of a Tree to the corresponding tree zipper.
`private static <A> F<Tree<A>,A>`	Tree.`getRoot()`
`Stream<Tree<A>>`	TreeZipper.`lefts()`	Returns the left siblings of the currently focused node.
`private static <A> Stream<P3<Stream<Tree<A>>,A,Stream<Tree<A>>>>`	TreeZipper.`lp3nil()`
`private static <A> Stream<P3<Stream<Tree<A>>,A,Stream<Tree<A>>>>`	TreeZipper.`lp3nil()`
`static <A> F<A,F<P1<Stream<Tree<A>>>,Tree<A>>>`	Tree.`node()`	First-class constructor of trees.
`static <A> F<A,F<P1<Stream<Tree<A>>>,Tree<A>>>`	Tree.`node()`	First-class constructor of trees.
`P4<Tree<A>,Stream<Tree<A>>,Stream<Tree<A>>,Stream<P3<Stream<Tree<A>>,A,Stream<Tree<A>>>>>`	TreeZipper.`p()`	Returns the product-4 representation of this zipper.
`P4<Tree<A>,Stream<Tree<A>>,Stream<Tree<A>>,Stream<P3<Stream<Tree<A>>,A,Stream<Tree<A>>>>>`	TreeZipper.`p()`	Returns the product-4 representation of this zipper.
`P4<Tree<A>,Stream<Tree<A>>,Stream<Tree<A>>,Stream<P3<Stream<Tree<A>>,A,Stream<Tree<A>>>>>`	TreeZipper.`p()`	Returns the product-4 representation of this zipper.
`P4<Tree<A>,Stream<Tree<A>>,Stream<Tree<A>>,Stream<P3<Stream<Tree<A>>,A,Stream<Tree<A>>>>>`	TreeZipper.`p()`	Returns the product-4 representation of this zipper.
`P4<Tree<A>,Stream<Tree<A>>,Stream<Tree<A>>,Stream<P3<Stream<Tree<A>>,A,Stream<Tree<A>>>>>`	TreeZipper.`p()`	Returns the product-4 representation of this zipper.
`static <A> F<TreeZipper<A>,P4<Tree<A>,Stream<Tree<A>>,Stream<Tree<A>>,Stream<P3<Stream<Tree<A>>,A,Stream<Tree<A>>>>>>`	TreeZipper.`p_()`	A first-class function that returns the product-4 representation of a given zipper.
`static <A> F<TreeZipper<A>,P4<Tree<A>,Stream<Tree<A>>,Stream<Tree<A>>,Stream<P3<Stream<Tree<A>>,A,Stream<Tree<A>>>>>>`	TreeZipper.`p_()`	A first-class function that returns the product-4 representation of a given zipper.
`static <A> F<TreeZipper<A>,P4<Tree<A>,Stream<Tree<A>>,Stream<Tree<A>>,Stream<P3<Stream<Tree<A>>,A,Stream<Tree<A>>>>>>`	TreeZipper.`p_()`	A first-class function that returns the product-4 representation of a given zipper.
`static <A> F<TreeZipper<A>,P4<Tree<A>,Stream<Tree<A>>,Stream<Tree<A>>,Stream<P3<Stream<Tree<A>>,A,Stream<Tree<A>>>>>>`	TreeZipper.`p_()`	A first-class function that returns the product-4 representation of a given zipper.
`static <A> F<TreeZipper<A>,P4<Tree<A>,Stream<Tree<A>>,Stream<Tree<A>>,Stream<P3<Stream<Tree<A>>,A,Stream<Tree<A>>>>>>`	TreeZipper.`p_()`	A first-class function that returns the product-4 representation of a given zipper.
`Stream<P3<Stream<Tree<A>>,A,Stream<Tree<A>>>>`	TreeZipper.`parents()`	Returns the parents of the currently focused node.
`Stream<P3<Stream<Tree<A>>,A,Stream<Tree<A>>>>`	TreeZipper.`parents()`	Returns the parents of the currently focused node.
`Stream<Tree<A>>`	TreeZipper.`rights()`	Returns the right siblings of the currently focused node.
`static <A> F<Tree<A>,A>`	Tree.`root_()`	Provides a transformation from a tree to its root.
`static <A> Show<Tree<A>>`	Tree.`show2D(Show<A> s)`	Provides a show instance that draws a 2-dimensional representation of a tree.
`P1<Stream<Tree<A>>>`	Tree.`subForest()`	Returns a stream of the tree's subtrees.
`static <A> F<Tree<A>,P1<Stream<Tree<A>>>>`	Tree.`subForest_()`	Provides a transformation from a tree to its subforest.
`static <A> F<Tree<A>,P1<Stream<Tree<A>>>>`	Tree.`subForest_()`	Provides a transformation from a tree to its subforest.
`Stream<Tree<A>>`	TreeZipper.`toForest()`	Returns the forest containing this location.
`static <A> F<Tree<A>,F<Stream<Tree<A>>,F<Stream<Tree<A>>,F<Stream<P3<Stream<Tree<A>>,A,Stream<Tree<A>>>>,TreeZipper<A>>>>>`	TreeZipper.`treeZipper()`	First-class constructor for tree zippers.
`static <A> F<Tree<A>,F<Stream<Tree<A>>,F<Stream<Tree<A>>,F<Stream<P3<Stream<Tree<A>>,A,Stream<Tree<A>>>>,TreeZipper<A>>>>>`	TreeZipper.`treeZipper()`	First-class constructor for tree zippers.
`static <A> F<Tree<A>,F<Stream<Tree<A>>,F<Stream<Tree<A>>,F<Stream<P3<Stream<Tree<A>>,A,Stream<Tree<A>>>>,TreeZipper<A>>>>>`	TreeZipper.`treeZipper()`	First-class constructor for tree zippers.
`static <A> F<Tree<A>,F<Stream<Tree<A>>,F<Stream<Tree<A>>,F<Stream<P3<Stream<Tree<A>>,A,Stream<Tree<A>>>>,TreeZipper<A>>>>>`	TreeZipper.`treeZipper()`	First-class constructor for tree zippers.
`static <A> F<Tree<A>,F<Stream<Tree<A>>,F<Stream<Tree<A>>,F<Stream<P3<Stream<Tree<A>>,A,Stream<Tree<A>>>>,TreeZipper<A>>>>>`	TreeZipper.`treeZipper()`	First-class constructor for tree zippers.
`private Stream<Tree<TreeZipper<A>>>`	TreeZipper.`uf(F<TreeZipper<A>,Option<TreeZipper<A>>> f)`
`static <A,B> F<B,Tree<A>>`	Tree.`unfoldTree(F<B,P2<A,P1<Stream<B>>>> f)`	Builds a tree from a seed value.

Methods in fj.data with parameters of type Tree
Modifier and Type	Method	Description
`static <A,B> Tree<B>`	Tree.`bottomUp(Tree<A> t, F<P2<A,Stream<B>>,B> f)`	Folds a Tree into a Tree by applying the function f from the bottom of the Tree to the top
`private static <A> Stream<Tree<A>>`	TreeZipper.`combChildren(Stream<Tree<A>> ls, Tree<A> t, Stream<Tree<A>> rs)`
`static <A> TreeZipper<A>`	TreeZipper.`fromTree(Tree<A> t)`	Creates a new tree zipper focused on the root of the given tree.
`Option<TreeZipper<A>>`	TreeZipper.`insertDownAt(int n, Tree<A> t)`	Inserts a tree at the specified location in the current node's stream of children.
`TreeZipper<A>`	TreeZipper.`insertDownFirst(Tree<A> t)`	Inserts a tree as the first child of the current node.
`TreeZipper<A>`	TreeZipper.`insertDownLast(Tree<A> t)`	Inserts a tree as the last child of the current node.
`TreeZipper<A>`	TreeZipper.`insertLeft(Tree<A> t)`	Inserts a tree to the left of the current position.
`TreeZipper<A>`	TreeZipper.`insertRight(Tree<A> t)`	Inserts a tree to the right of the current position.
`TreeZipper<A>`	TreeZipper.`setTree(Tree<A> t)`	Replaces the current node with the given tree.
`static <A> TreeZipper<A>`	TreeZipper.`treeZipper(Tree<A> tree, Stream<Tree<A>> lefts, Stream<Tree<A>> rights, Stream<P3<Stream<Tree<A>>,A,Stream<Tree<A>>>> parents)`	Creates a new tree zipper given a currently selected tree, a forest on the left, a forest on the right, and a stream of parent contexts.
`<B,C> Tree<C>`	Tree.`zipWith(Tree<B> bs, F<A,F<B,C>> f)`	Zips this tree with another, using the given function.
`<B,C> Tree<C>`	Tree.`zipWith(Tree<B> bs, F2<A,B,C> f)`	Zips this tree with another, using the given function.

Method parameters in fj.data with type arguments of type Tree
Modifier and Type	Method	Description
`<B> Tree<B>`	Tree.`cobind(F<Tree<A>,B> f)`	Applies the given function to all subtrees of this tree, returning a tree of the results (comonad pattern).
`private static <A> Stream<Tree<A>>`	TreeZipper.`combChildren(Stream<Tree<A>> ls, Tree<A> t, Stream<Tree<A>> rs)`
`private static <A> Stream<java.lang.String>`	Tree.`drawSubTrees(Show<A> s, Stream<Tree<A>> ts)`
`Option<TreeZipper<A>>`	TreeZipper.`findChild(F<Tree<A>,java.lang.Boolean> p)`	Navigates to the first child of the current location, that satisfies the given predicate.
`static <A> Option<TreeZipper<A>>`	TreeZipper.`fromForest(Stream<Tree<A>> ts)`	Creates a new tree zipper focused on the first element of the given forest.
`TreeZipper<A>`	TreeZipper.`modifyTree(F<Tree<A>,Tree<A>> f)`	Modifies the current node with the given function.
`TreeZipper<A>`	TreeZipper.`modifyTree(F<Tree<A>,Tree<A>> f)`	Modifies the current node with the given function.
`static <A> Tree<A>`	Tree.`node(A root, List<Tree<A>> forest)`	Creates a new n-ary given a root and a subforest of length n.
`static <A> Tree<A>`	Tree.`node(A root, Stream<Tree<A>> forest)`	Creates a new tree given a root and a (potentially infinite) subforest.
`static <A> Tree<A>`	Tree.`node(A root, P1<Stream<Tree<A>>> forest)`	Creates a new tree given a root and a (potentially infinite) subforest.
`static <A> TreeZipper<A>`	TreeZipper.`treeZipper(Tree<A> tree, Stream<Tree<A>> lefts, Stream<Tree<A>> rights, Stream<P3<Stream<Tree<A>>,A,Stream<Tree<A>>>> parents)`	Creates a new tree zipper given a currently selected tree, a forest on the left, a forest on the right, and a stream of parent contexts.

Constructors in fj.data with parameters of type Tree
Constructor	Description
`TreeZipper(Tree<A> tree, Stream<Tree<A>> lefts, Stream<Tree<A>> rights, Stream<P3<Stream<Tree<A>>,A,Stream<Tree<A>>>> parents)`

Constructor parameters in fj.data with type arguments of type Tree
Constructor	Description
`Tree(A root, P1<Stream<Tree<A>>> subForest)`
`TreeZipper(Tree<A> tree, Stream<Tree<A>> lefts, Stream<Tree<A>> rights, Stream<P3<Stream<Tree<A>>,A,Stream<Tree<A>>>> parents)`

Uses of Classfj.data.Tree

Uses of Tree in fj

Uses of Tree in fj.control.parallel

Uses of Tree in fj.data

Uses of Class
fj.data.Tree