Packages that use Interval

• Uses of Interval in com.vividsolutions.jts.index.bintree

  Methods in that return

  Modifier and Type	Method and Description
  static Interval	Bintree.ensureExtent(Interval itemInterval, double minExtent) Ensure that the Interval for the inserted item has non-zero extents.
  Interval	Node.getInterval()
  Interval	Key.getInterval()

  Methods in with parameters of type

  Modifier and Type	Method and Description
  void	NodeBase.addAllItemsFromOverlapping(Interval interval, Collection resultItems) Adds items in the tree which potentially overlap the query interval to the given collection.
  void	Key.computeKey(Interval itemInterval) return a square envelope containing the argument envelope, whose extent is a power of two and which is based at a power of 2
  static int	Key.computeLevel(Interval interval)
  boolean	Interval.contains(Interval interval)
  static Node	Node.createExpanded(Node node, Interval addInterval)
  static Node	Node.createNode(Interval itemInterval)
  static Interval	Bintree.ensureExtent(Interval itemInterval, double minExtent) Ensure that the Interval for the inserted item has non-zero extents.
  void	Interval.expandToInclude(Interval interval)
  NodeBase	Node.find(Interval searchInterval) Returns the smallest existing node containing the envelope.
  Node	Node.getNode(Interval searchInterval) Returns the subnode containing the envelope.
  static int	NodeBase.getSubnodeIndex(Interval interval, double centre) Returns the index of the subnode that wholely contains the given interval.
  void	Root.insert(Interval itemInterval, Object item) Insert an item into the tree this is the root of.
  void	Bintree.insert(Interval itemInterval, Object item)
  protected boolean	Node.isSearchMatch(Interval itemInterval)
  protected boolean	Root.isSearchMatch(Interval interval) The root node matches all searches
  protected abstract boolean	NodeBase.isSearchMatch(Interval interval)
  boolean	Interval.overlaps(Interval interval)
  List	Bintree.query(Interval interval) Queries the tree to find all candidate items which may overlap the query interval.
  void	Bintree.query(Interval interval, Collection foundItems) Adds items in the tree which potentially overlap the query interval to the given collection.
  boolean	NodeBase.remove(Interval itemInterval, Object item) Removes a single item from this subtree.
  boolean	Bintree.remove(Interval itemInterval, Object item) Removes a single item from the tree.

  Constructors in com.vividsolutions.jts.index.bintree with parameters of type Interval

  Constructor and Description
  	Interval(Interval interval)
  	Key(Interval interval)
  	Node(Interval interval, int level)