Uses of Interface
org.codefx.libfx.collection.tree.navigate.TreeNavigator

Packages that use TreeNavigator

Package	Description
org.codefx.libfx.collection.tree.navigate	Provides an abstraction to navigate tree-like data structures without requiring them to implement a specific interface.
org.codefx.libfx.collection.tree.stream	Provides the possibility to stream the elements of tree-like data structures.

Uses of TreeNavigator in org.codefx.libfx.collection.tree.navigate

Classes in org.codefx.libfx.collection.tree.navigate that implement TreeNavigator

Modifier and Type	Class and Description
class	ComponentHierarchyNavigator A TreeNavigator for an AWT component hierarchy.
class	JComponentHierarchyNavigator A TreeNavigator for a Swing component hierarchy.
class	SceneGraphNavigator A TreeNavigator for a JavaFX scene graph.

Uses of TreeNavigator in org.codefx.libfx.collection.tree.stream

Methods in org.codefx.libfx.collection.tree.stream with parameters of type TreeNavigator

Modifier and Type	Method and Description
static <N> Stream<N>	TreeStreams.backwardDfs(TreeNavigator<N> navigator, N startNode) Returns a stream which enumerates nodes in a tree in the order of a backwards depth-first search which starts in the specified node.
static <N> Stream<N>	TreeStreams.backwardDfsToRoot(TreeNavigator<N> navigator, N root, N startNode) Returns a stream which enumerates nodes in the (sub-)tree rooted in the specified root in the order of a backwards depth-first search which starts in the specified node.
static <N> Stream<N>	TreeStreams.dfsFromRoot(TreeNavigator<N> navigator, N root) Returns a stream which enumerates nodes in the (sub-)tree rooted in the specified root in the order of a depth-first search.
static <N> Stream<N>	TreeStreams.dfsFromWithin(TreeNavigator<N> navigator, N startNode) Returns a stream which enumerates nodes in a tree in the order of a depth-first search which starts in the specified node.
static <N> Stream<N>	TreeStreams.dfsFromWithin(TreeNavigator<N> navigator, N root, N startNode) Returns a stream which enumerates nodes in the (sub-)tree rooted in the specified root in the order of a depth-first search which starts in the specified start node.