Uses of Class
fj.data.TreeZipper
Packages that use TreeZipper
Package
Description
Types that set the premise for the existence of Functional Java.
Parallelization strategies.
Common algebraic data types.
-
Uses of TreeZipper in fj
Methods in fj that return types with arguments of type TreeZipperModifier and TypeMethodDescriptiondefault F
<TreeZipper<A>, TreeZipper<B>> F.mapTreeZipper()
Promotes this function to map over a TreeZipper.default F
<TreeZipper<A>, TreeZipper<B>> F.mapTreeZipper()
Promotes this function to map over a TreeZipper.static <A> Equal
<TreeZipper<A>> Equal.treeZipperEqual
(Equal<A> ea) An equal instance for theTreeZipper
type.static <A> Hash
<TreeZipper<A>> Hash.treeZipperHash
(Hash<A> ha) A hash instance for theTreeZipper
type.default F
<A, TreeZipper<B>> F.treeZipperK()
Promotes this function to return its value in a TreeZipper.default F2
<TreeZipper<A>, TreeZipper<B>, TreeZipper<C>> F2.zipTreeZipperM()
Promotes this function to zip two TreeZippers, applying the function lock-step over both zippers in all directions.default F2
<TreeZipper<A>, TreeZipper<B>, TreeZipper<C>> F2.zipTreeZipperM()
Promotes this function to zip two TreeZippers, applying the function lock-step over both zippers in all directions.default F2
<TreeZipper<A>, TreeZipper<B>, TreeZipper<C>> F2.zipTreeZipperM()
Promotes this function to zip two TreeZippers, applying the function lock-step over both zippers in all directions. -
Uses of TreeZipper in fj.control.parallel
Methods in fj.control.parallel that return types with arguments of type TreeZipperModifier and TypeMethodDescription<A,
B> Promise <TreeZipper<B>> ParModule.parExtend
(TreeZipper<A> za, F<TreeZipper<A>, B> f) Maps the given function across all positions of the given TreeZipper in parallel.<A,
B> Promise <TreeZipper<B>> ParModule.parMap
(TreeZipper<A> za, F<A, B> f) Maps a function across a TreeZipper in parallel.Methods in fj.control.parallel with parameters of type TreeZipperModifier and TypeMethodDescription<A,
B> Promise <TreeZipper<B>> ParModule.parExtend
(TreeZipper<A> za, F<TreeZipper<A>, B> f) Maps the given function across all positions of the given TreeZipper in parallel.<A,
B> Promise <TreeZipper<B>> ParModule.parMap
(TreeZipper<A> za, F<A, B> f) Maps a function across a TreeZipper in parallel.Method parameters in fj.control.parallel with type arguments of type TreeZipperModifier and TypeMethodDescription<A,
B> Promise <TreeZipper<B>> ParModule.parExtend
(TreeZipper<A> za, F<TreeZipper<A>, B> f) Maps the given function across all positions of the given TreeZipper in parallel. -
Uses of TreeZipper in fj.data
Methods in fj.data that return TreeZipperModifier and TypeMethodDescription<B> TreeZipper
<B> TreeZipper.cobind
(F<TreeZipper<A>, B> f) Maps the given function over the tree of all positions for this zipper (comonad pattern).static <A> TreeZipper
<A> Creates a new tree zipper focused on the root of the given tree.TreeZipper.insertDownFirst
(Tree<A> t) Inserts a tree as the first child of the current node.TreeZipper.insertDownLast
(Tree<A> t) Inserts a tree as the last child of the current node.TreeZipper.insertLeft
(Tree<A> t) Inserts a tree to the left of the current position.TreeZipper.insertRight
(Tree<A> t) Inserts a tree to the right of the current position.<B> TreeZipper
<B> Maps the given function across this zipper (covariant functor pattern).TreeZipper.modifyLabel
(F<A, A> f) Modifies the label at the current node with the given function.Modifies the current node with the given function.TreeZipper.positions()
Returns a zipper over the tree of all possible permutations of this tree zipper (comonad pattern).TreeZipper.root()
Navigates to the top-most parent of the current location.Replaces the label of the current node with the given value.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> TreeZipper <C> TreeZipper.zipWith
(TreeZipper<B> bs, F<A, F<B, C>> f) Zips this TreeZipper with another, applying the given function lock-step over both zippers in all directions.<B,
C> TreeZipper <C> TreeZipper.zipWith
(TreeZipper<B> bs, F2<A, B, C> f) Zips this TreeZipper with another, applying the given function lock-step over both zippers in all directions.TreeZipper
<P2<A, Boolean>> TreeZipper.zipWithFocus()
Zips the nodes in this zipper with a boolean that indicates whether that node has focus.Methods in fj.data that return types with arguments of type TreeZipperModifier and TypeMethodDescriptionTreeZipper.delete()
Removes the current node from the tree.private static <A> F
<TreeZipper<A>, P2<TreeZipper<A>, P1<Stream<TreeZipper<A>>>>> TreeZipper.dwn()
private static <A> F
<TreeZipper<A>, P2<TreeZipper<A>, P1<Stream<TreeZipper<A>>>>> TreeZipper.dwn()
private static <A> F
<TreeZipper<A>, P2<TreeZipper<A>, P1<Stream<TreeZipper<A>>>>> TreeZipper.dwn()
static <A> Equal
<TreeZipper<A>> An Equal instance for tree zippers.static <A> F2
<F<Tree<A>, Boolean>, TreeZipper<A>, Option<TreeZipper<A>>> TreeZipper.findChild()
A first-class version of the findChild function.static <A> F2
<F<Tree<A>, Boolean>, TreeZipper<A>, Option<TreeZipper<A>>> TreeZipper.findChild()
A first-class version of the findChild function.Navigates to the first child of the current location, that satisfies the given predicate.TreeZipper.firstChild()
Navigtes to the first child of the current location.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.static <A> F
<Tree<A>, TreeZipper<A>> TreeZipper.fromTree()
First-class conversion of a Tree to the corresponding tree zipper.TreeZipper.getChild
(int n) Navigates to the given child of the current location, starting at index 0.TreeZipper.insertDownAt
(int n, Tree<A> t) Inserts a tree at the specified location in the current node's stream of children.TreeZipper.iterator()
Returns an iterator of all the positions of this TreeZipper.TreeZipper.lastChild()
Navigtes to the last child of the current location.TreeZipper.left()
Navigates to the left sibling of the current location.static <A> F
<TreeZipper<A>, Option<TreeZipper<A>>> TreeZipper.left_()
A first-class version of the left() function.static <A> F
<TreeZipper<A>, Option<TreeZipper<A>>> TreeZipper.left_()
A first-class version of the left() function.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.TreeZipper.parent()
Navigates to the parent of the current location.TreeZipper.positions()
Returns a zipper over the tree of all possible permutations of this tree zipper (comonad pattern).TreeZipper.right()
Navigates to the right sibling of the current location.static <A> F
<TreeZipper<A>, Option<TreeZipper<A>>> TreeZipper.right_()
A first-class version of the right() function.static <A> F
<TreeZipper<A>, Option<TreeZipper<A>>> TreeZipper.right_()
A first-class version of the right() function.static <A> F
<TreeZipper<A>, TreeZipper<A>> TreeZipper.root_()
A first-class version of the root function.static <A> F
<TreeZipper<A>, TreeZipper<A>> TreeZipper.root_()
A first-class version of the root function.static <A> Show
<TreeZipper<A>> A Show instance 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) Methods in fj.data with parameters of type TreeZipperModifier and TypeMethodDescription<B,
C> TreeZipper <C> TreeZipper.zipWith
(TreeZipper<B> bs, F<A, F<B, C>> f) Zips this TreeZipper with another, applying the given function lock-step over both zippers in all directions.<B,
C> TreeZipper <C> TreeZipper.zipWith
(TreeZipper<B> bs, F2<A, B, C> f) Zips this TreeZipper with another, applying the given function lock-step over both zippers in all directions.Method parameters in fj.data with type arguments of type TreeZipperModifier and TypeMethodDescription<B> TreeZipper
<B> TreeZipper.cobind
(F<TreeZipper<A>, B> f) Maps the given function over the tree of all positions for this zipper (comonad pattern).private Stream
<Tree<TreeZipper<A>>> TreeZipper.uf
(F<TreeZipper<A>, Option<TreeZipper<A>>> f) private Stream
<Tree<TreeZipper<A>>> TreeZipper.uf
(F<TreeZipper<A>, Option<TreeZipper<A>>> f)