Class SIRtree

java.lang.Object
org.locationtech.jts.index.strtree.AbstractSTRtree
org.locationtech.jts.index.strtree.SIRtree
All Implemented Interfaces:
Serializable

public class SIRtree extends AbstractSTRtree
One-dimensional version of an STR-packed R-tree. SIR stands for "Sort-Interval-Recursive". STR-packed R-trees are described in: P. Rigaux, Michel Scholl and Agnes Voisard. Spatial Databases With Application To GIS. Morgan Kaufmann, San Francisco, 2002.

This class is thread-safe. Building the tree is synchronized, and querying is stateless.

Version:
1.7
See Also:
  • Field Details

  • Constructor Details

    • SIRtree

      public SIRtree()
      Constructs an SIRtree with the default node capacity.
    • SIRtree

      public SIRtree(int nodeCapacity)
      Constructs an SIRtree with the given maximum number of child nodes that a node may have
  • Method Details

    • createNode

      protected AbstractNode createNode(int level)
      Specified by:
      createNode in class AbstractSTRtree
    • insert

      public void insert(double x1, double x2, Object item)
      Inserts an item having the given bounds into the tree.
    • query

      public List query(double x)
      Returns items whose bounds intersect the given value.
    • query

      public List query(double x1, double x2)
      Returns items whose bounds intersect the given bounds.
      Parameters:
      x1 - possibly equal to x2
    • getIntersectsOp

      protected AbstractSTRtree.IntersectsOp getIntersectsOp()
      Specified by:
      getIntersectsOp in class AbstractSTRtree
      Returns:
      a test for intersection between two bounds, necessary because subclasses of AbstractSTRtree have different implementations of bounds.
      See Also:
    • getComparator

      protected Comparator getComparator()
      Specified by:
      getComparator in class AbstractSTRtree