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:
  • Constructor Summary

    Constructors
    Constructor
    Description
    Constructs an SIRtree with the default node capacity.
    SIRtree(int nodeCapacity)
    Constructs an SIRtree with the given maximum number of child nodes that a node may have
  • Method Summary

    Modifier and Type
    Method
    Description
    void
    insert(double x1, double x2, Object item)
    Inserts an item having the given bounds into the tree.
    query(double x)
    Returns items whose bounds intersect the given value.
    query(double x1, double x2)
    Returns items whose bounds intersect the given bounds.

    Methods inherited from class org.locationtech.jts.index.strtree.AbstractSTRtree

    build, getNodeCapacity, getRoot, isEmpty, itemsTree

    Methods inherited from class java.lang.Object

    equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait
  • 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

    • 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