com.sun.javafx.scene.traversal

Class WeightedClosestCorner

java.lang.Object

com.sun.javafx.scene.traversal.WeightedClosestCorner

All Implemented Interfaces:

Algorithm

public class WeightedClosestCorner
extends Object
implements Algorithm

First search for on-axis nodes. A node is on-axis if any part of its closest edge lies between the pair of rays cast in the traversal direction from the corners of the originating node. If there are multiple on-axis nodes, the closest is chosen. If there is a tie for the closest on-axis node, the tie is broken by choosing the one whose center is closest to the center of the originating node. TODO: investigate alternative tiebreaker algorithms (filed as RT-19470). If there are no on-axis nodes, compute the distance OUT (in the traversal direction) and the distance to the SIDE (perpendicular to the traversal direction) and compute a distance metric OUT + WEIGHT * SIDE. Choose the node with the smallest distance metric. TODO: presumably WEIGHT is greater than one, so that nodes farther OUT but close (and not on) axis are chosen in preference to nodes that are physically closer but are farther off to the side. Determine WEIGHT somehow, possibly empirically (filed as RT-19471).

Method Summary

Modifier and Type	Method and Description
Node	select(Node node, Direction dir, TraversalContext context) Traverse from owner, in direction dir.
Node	selectFirst(TraversalContext context) Return the first traversable node for the specified context (root).
Node	selectLast(TraversalContext context) Return the last traversable node for the specified context (root).
int	traverse(Bounds origin, Direction dir, List<Node> targets, TraversalContext context)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Method Detail

select

public Node select(Node node,
                   Direction dir,
                   TraversalContext context)

Description copied from interface: Algorithm

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

Specified by:

select in interface Algorithm

selectFirst

public Node selectFirst(TraversalContext context)

Description copied from interface: Algorithm

Return the first traversable node for the specified context (root).

Specified by:

selectFirst in interface Algorithm

Parameters:

context - the context that contains the root

Returns:

the first node

selectLast

public Node selectLast(TraversalContext context)

Description copied from interface: Algorithm

Return the last traversable node for the specified context (root).

Specified by:

selectLast in interface Algorithm

Parameters:

context - the context that contains the root

Returns:

the last node

traverse

public int traverse(Bounds origin,
                    Direction dir,
                    List<Node> targets,
                    TraversalContext context)