| Modifier and Type | Class and Description |
|---|---|
| pack-priv static class |
| Modifier and Type | Field and Description |
|---|---|
| private static final Function | |
| private static final Function | |
| private static final Function | |
| private static final Function | |
| protected Node | |
| protected Direction | |
| protected Node | |
| protected boolean | |
| protected Stack |
| Access | Constructor and Description |
|---|---|
| pack-priv |
| Modifier and Type | Method and Description |
|---|---|
| private void | |
| private double | centerSideDistance(Direction dir, Bounds cur, Bounds tgt)
Computes the side distance from current center to target center. |
| private double | cornerSideDistance(Direction dir, Bounds cur, Bounds tgt)
Computes the side distance between the closest corners of the current and target. |
| public static double | |
| protected Node | |
| protected Node | |
| private boolean | |
| private double | outDistance(Direction dir, Bounds cur, Bounds tgt)
Compute the out-distance to the near edge of the target in the traversal direction. |
| public Node | select(Node node, Direction dir, TraversalContext context)
Implements com. Traverse from owner, in direction dir. |
| public Node | selectFirst(TraversalContext context)
Implements com. Return the first traversable node for the specified context (root). |
| public Node | selectLast(TraversalContext context)
Implements com. Return the last traversable node for the specified context (root). |
| BOUNDS_BOTTOM_SIDE | back to summary |
|---|---|
| private static final Function<Bounds, Double> BOUNDS_BOTTOM_SIDE | |
| BOUNDS_LEFT_SIDE | back to summary |
|---|---|
| private static final Function<Bounds, Double> BOUNDS_LEFT_SIDE | |
| BOUNDS_RIGHT_SIDE | back to summary |
|---|---|
| private static final Function<Bounds, Double> BOUNDS_RIGHT_SIDE | |
| BOUNDS_TOP_SIDE | back to summary |
|---|---|
| private static final Function<Bounds, Double> BOUNDS_TOP_SIDE | |
| cacheLastTraversalNode | back to summary |
|---|---|
| protected Node cacheLastTraversalNode | |
| cacheStartTraversalDirection | back to summary |
|---|---|
| protected Direction cacheStartTraversalDirection | |
| cacheStartTraversalNode | back to summary |
|---|---|
| protected Node cacheStartTraversalNode | |
| reverseDirection | back to summary |
|---|---|
| protected boolean reverseDirection | |
| traversalNodeStack | back to summary |
|---|---|
| protected Stack<Node> traversalNodeStack | |
| Heuristic2D | back to summary |
|---|---|
| pack-priv Heuristic2D() | |
| cacheTraversal | back to summary |
|---|---|
| private void cacheTraversal(Node node, Direction dir) | |
| centerSideDistance | back to summary |
|---|---|
| private double centerSideDistance(Direction dir, Bounds cur, Bounds tgt) Computes the side distance from current center to target center. Always positive. This is only used for on-axis nodes. | |
| cornerSideDistance | back to summary |
|---|---|
| private double cornerSideDistance(Direction dir, Bounds cur, Bounds tgt) Computes the side distance between the closest corners of the current and target. Always positive. This is only used for off-axis nodes. | |
| findMin | back to summary |
|---|---|
| public static double findMin(double... values) | |
| getNearestNodeLeftOrRight | back to summary |
|---|---|
| protected Node getNearestNodeLeftOrRight(Bounds currentB, Bounds originB, TraversalContext context, Direction dir) | |
| getNearestNodeUpOrDown | back to summary |
|---|---|
| protected Node getNearestNodeUpOrDown(Bounds currentB, Bounds originB, TraversalContext context, Direction dir) | |
| isOnAxis | back to summary |
|---|---|
| private boolean isOnAxis(Direction dir, Bounds cur, Bounds tgt) | |
| outDistance | back to summary |
|---|---|
| private double outDistance(Direction dir, Bounds cur, Bounds tgt) Compute the out-distance to the near edge of the target in the traversal direction. Negative means the near edge is "behind". | |
| select | back to summary |
|---|---|
| public Node select(Node node, Direction dir, TraversalContext context) Implements com. Doc from com. 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) Implements com. Doc from com. Return the first traversable node for the specified context (root).
| |
| selectLast | back to summary |
|---|---|
| public Node selectLast(TraversalContext context) Implements com. Doc from com. Return the last traversable node for the specified context (root).
| |
| Modifier and Type | Field and Description |
|---|---|
| pack-priv double | |
| pack-priv double | |
| pack-priv double | |
| pack-priv double | |
| pack-priv Bounds | |
| pack-priv double | |
| pack-priv double | |
| pack-priv Node | |
| pack-priv double | |
| pack-priv double | |
| pack-priv double | |
| pack-priv double | |
| pack-priv double |
| Access | Constructor and Description |
|---|---|
| pack-priv |
| Modifier and Type | Method and Description |
|---|---|
| pack-priv void |
| averageDistance | back to summary |
|---|---|
| pack-priv double averageDistance | |
| biased2DMetric | back to summary |
|---|---|
| pack-priv double biased2DMetric | |
| biasShortestDistance | back to summary |
|---|---|
| pack-priv double biasShortestDistance | |
| bottomCornerDistance | back to summary |
|---|---|
| pack-priv double bottomCornerDistance | |
| bounds | back to summary |
|---|---|
| pack-priv Bounds bounds | |
| current2DMetric | back to summary |
|---|---|
| pack-priv double current2DMetric | |
| leftCornerDistance | back to summary |
|---|---|
| pack-priv double leftCornerDistance | |
| node | back to summary |
|---|---|
| pack-priv Node node | |
| originLeftCornerDistance | back to summary |
|---|---|
| pack-priv double originLeftCornerDistance | |
| originTopCornerDistance | back to summary |
|---|---|
| pack-priv double originTopCornerDistance | |
| rightCornerDistance | back to summary |
|---|---|
| pack-priv double rightCornerDistance | |
| shortestDistance | back to summary |
|---|---|
| pack-priv double shortestDistance | |
| topCornerDistance | back to summary |
|---|---|
| pack-priv double topCornerDistance | |
| TargetNode | back to summary |
|---|---|
| pack-priv TargetNode() | |
| copy | back to summary |
|---|---|
| pack-priv void copy(Heuristic2D. | |