| Modifier and Type | Method and Description |
|---|---|
| public List | |
| public Parent | |
| public Bounds | |
| public Node | selectFirstInParent(Parent parent)
If the TraversalEngine does not want to handle traversal inside some inner child (Parent), it can use this method to apply default algorithm inside that Parent and return the first Node |
| public Node | selectInSubtree(Parent
this will be used as a root of the traversal. Should be a Node that is still handled by the current TraversalEngine,
but it's content is not. subTreeRoot, Node from, Direction dir)If the TraversalEngine does not want to handle traversal inside some inner child (Parent), it can use this method to apply default algorithm inside that Parent and return the next Node within the Parent or null if there's no successor. |
| public Node | selectLastInParent(Parent parent)
If the TraversalEngine does not want to handle traversal inside some inner child (Parent), it can use this method to apply default algorithm inside that Parent and return the last Node |
| getAllTargetNodes | back to summary |
|---|---|
| public List Returns all possible targets within the context | |
| getRoot | back to summary |
|---|---|
| public Parent getRoot() The root for this context, Traversal should be done only within the root | |
| getSceneLayoutBounds | back to summary |
|---|---|
| public Bounds getSceneLayoutBounds(Node node) Returns layout bounds of the Node in the relevant (Sub)Scene. Note that these bounds are the most important for traversal as they define the final position within the scene. | |
| selectFirstInParent | back to summary |
|---|---|
| public Node selectFirstInParent(Parent parent) If the TraversalEngine does not want to handle traversal inside some inner child (Parent), it can use this method to apply default algorithm inside that Parent and return the first Node | |
| selectInSubtree | back to summary |
|---|---|
| public Node selectInSubtree(Parent subTreeRoot, Node from, Direction dir) If the TraversalEngine does not want to handle traversal inside some inner child (Parent), it can use this method to apply default algorithm inside that Parent and return the next Node within the Parent or null if there's no successor.
| |
| selectLastInParent | back to summary |
|---|---|
| public Node selectLastInParent(Parent parent) If the TraversalEngine does not want to handle traversal inside some inner child (Parent), it can use this method to apply default algorithm inside that Parent and return the last Node | |