| Modifier and Type | Method and Description |
|---|---|
| public Node | |
| public Node | Returns: the first nodethe context that contains the root context)Return the first traversable node for the specified context (root). |
| public Node | Returns: the last nodethe context that contains the root context)Return the last traversable node for the specified context (root). |
| select | back to summary |
|---|---|
| public Node select(Node owner, Direction dir, TraversalContext context) Traverse from owner, in direction dir. Return a the new target Node or null if no suitable target is found. Typically, the implementation of override algorithm handles only parent's direct children and looks like this: 1) Find the nearest parent of the "owner" that is handled by this algorithm (i.e. it's a direct child of the root). 2) select the next node within this direct child using the context.selectInSubtree() and return it 2a) if no such node exists, move to the next direct child in the direction (this is where the different order of direct children is defined) or if direct children are not traversable, the select the first node in the next direct child | |
| selectFirst | back to summary |
|---|---|
| public Node selectFirst(TraversalContext context) Return the first traversable node for the specified context (root).
| |
| selectLast | back to summary |
|---|---|
| public Node selectLast(TraversalContext context) Return the last traversable node for the specified context (root).
| |