dev.roanh.convexmerger.util

Interface SegmentPartitionTree.VisitingFunction<T extends PartitionTree<SegmentPartitionTree.LineSegment,T>>

Type Parameters:

T - The partition tree type.

Enclosing class:

SegmentPartitionTree<T extends PartitionTree<SegmentPartitionTree.LineSegment,T>>

Functional Interface:

This is a functional interface and can therefore be used as the assignment target for a lambda expression or method reference.

@FunctionalInterface
private static interface SegmentPartitionTree.VisitingFunction<T extends PartitionTree<SegmentPartitionTree.LineSegment,T>>

Interface for a function that can be used to search a partition tree.

Method Summary

Modifier and Type	Method and Description
default boolean	visitTree(T tree, SegmentPartitionTree.LineSegment line, boolean ignoreInnerTerminals, SegmentPartitionTree.PartitionTreeVisitor<T> visitor) Visitor function for partition tree traversal.
boolean	visitTree(T tree, SegmentPartitionTree.LineSegment line, int maxDepth, boolean ignoreInnerTerminals, SegmentPartitionTree.PartitionTreeVisitor<T> visitor) Visitor function for partition tree traversal.

Method Detail

visitTree

boolean visitTree(T tree,
                  SegmentPartitionTree.LineSegment line,
                  int maxDepth,
                  boolean ignoreInnerTerminals,
                  SegmentPartitionTree.PartitionTreeVisitor<T> visitor)

Visitor function for partition tree traversal. This function will search a partition tree with a given query line and report any traversed inner and terminal nodes. Two nodes are treated as terminal nodes: leaf cells and cells fully intersected by the query line.

Parameters:

tree - The partition tree to traverse.

line - The query line to search with.

maxDepth - The maximum search depth in the tree.

ignoreInnerTerminals - Whether to ignore inner terminals or not. When ignored the search treats inner terminals as regular inner nodes and the search continues to the child nodes of these inner terminal nodes.

visitor - The visitor to report traversed terminal and inner nodes to.

Returns:

True if the search concluded uninterrupted.

See Also:

SegmentPartitionTree.VisitingFunction, SegmentPartitionTree.PartitionTreeVisitor, #visitTree(PartitionTree, LineSegment, boolean, PartitionTreeVisitor)

visitTree

default boolean visitTree(T tree,
                          SegmentPartitionTree.LineSegment line,
                          boolean ignoreInnerTerminals,
                          SegmentPartitionTree.PartitionTreeVisitor<T> visitor)

Visitor function for partition tree traversal. This function will search a partition tree with a given query line and report any traversed inner and terminal nodes. Two nodes are treated as terminal nodes: leaf cells and cells fully intersected by the query line.

Parameters:

tree - The partition tree to traverse.

line - The query line to search with.

ignoreInnerTerminals - Whether to ignore inner terminals or not. When ignored the search treats inner terminals as regular inner nodes and the search continues to the child nodes of these inner terminal nodes.

visitor - The visitor to report traversed terminal and inner nodes to.

Returns:

True if the search concluded uninterrupted.

See Also:

SegmentPartitionTree.VisitingFunction, SegmentPartitionTree.PartitionTreeVisitor, #visitTree(PartitionTree, LineSegment, int, boolean, PartitionTreeVisitor)