| Package | Description |
|---|---|
| com.revolsys.collection | |
| com.revolsys.gis.algorithm.index | |
| com.revolsys.gis.algorithm.index.quadtree | |
| com.revolsys.gis.algorithm.index.visitor | |
| com.revolsys.gis.graph | |
| com.revolsys.gis.graph.linestring | |
| com.revolsys.gis.graph.visitor | |
| com.revolsys.io | |
| com.revolsys.jts.algorithm |
Contains classes and interfaces implementing fundamental computational geometry algorithms.
|
| com.revolsys.jts.algorithm.locate |
Classes to determine the topological location of points in geometries.
|
| com.revolsys.jts.index.intervalrtree |
Contains classes to implement an R-tree index for one-dimensional intervals.
|
| com.revolsys.visitor |
| Modifier and Type | Class and Description |
|---|---|
class |
InvokeMethodVisitor<T> |
| Modifier and Type | Class and Description |
|---|---|
class |
IdObjectIndexEnvelopeVisitor<T> |
class |
IdObjectIndexItemVisitor<T> |
class |
IdObjectIndexVisitor<T> |
| Modifier and Type | Method and Description |
|---|---|
void |
RecordQuadTree.query(Geometry geometry,
Visitor<Record> visitor) |
abstract boolean |
RTreeNode.visit(BoundingBox envelope,
Filter<T> filter,
Visitor<T> visitor) |
boolean |
RTreeLeaf.visit(BoundingBox envelope,
Filter<T> filter,
Visitor<T> visitor) |
boolean |
RTreeBranch.visit(BoundingBox envelope,
Filter<T> filter,
Visitor<T> visitor) |
void |
RTree.visit(BoundingBox envelope,
Filter<T> filter,
Visitor<T> visitor) |
void |
EnvelopeSpatialIndex.visit(BoundingBox envelope,
Filter<T> filter,
Visitor<T> visitor) |
abstract boolean |
RTreeNode.visit(BoundingBox envelope,
Visitor<T> visitor) |
boolean |
RTreeLeaf.visit(BoundingBox envelope,
Visitor<T> visitor) |
boolean |
RTreeBranch.visit(BoundingBox envelope,
Visitor<T> visitor) |
void |
RTree.visit(BoundingBox envelope,
Visitor<T> visitor) |
void |
PointSpatialIndex.visit(BoundingBox envelope,
Visitor<T> visitor) |
boolean |
PointQuadTreeNode.visit(BoundingBox envelope,
Visitor<T> visitor) |
void |
PointQuadTree.visit(BoundingBox envelope,
Visitor<T> visitor) |
void |
IdObjectIndex.visit(BoundingBox envelope,
Visitor<T> visitor) |
void |
EnvelopeSpatialIndex.visit(BoundingBox envelope,
Visitor<T> visitor) |
void |
AbstractIdObjectQuadTree.visit(BoundingBox envelope,
Visitor<T> visitor) |
void |
AbstractIdObjectPointQuadTree.visit(BoundingBox envelope,
Visitor<T> visitor) |
abstract boolean |
RTreeNode.visit(Visitor<T> visitor) |
boolean |
RTreeLeaf.visit(Visitor<T> visitor) |
boolean |
RTreeBranch.visit(Visitor<T> visitor) |
void |
RTree.visit(Visitor<T> visitor) |
void |
PointSpatialIndex.visit(Visitor<T> visitor) |
boolean |
PointQuadTreeNode.visit(Visitor<T> visitor) |
void |
PointQuadTree.visit(Visitor<T> visitor) |
void |
EnvelopeSpatialIndex.visit(Visitor<T> visitor) |
void |
AbstractIdObjectPointQuadTree.visit(Visitor<T> visitor) |
| Constructor and Description |
|---|
IdObjectIndexEnvelopeVisitor(IdObjectIndex<T> index,
BoundingBox envelope,
Visitor<T> visitor) |
IdObjectIndexItemVisitor(IdObjectIndex<T> index,
BoundingBox envelope,
Visitor<T> visitor) |
IdObjectIndexVisitor(IdObjectIndex<T> index,
Visitor<T> visitor) |
IndexItemVisitor(BoundingBoxDoubleGf envelope,
Visitor<Record> visitor) |
| Modifier and Type | Method and Description |
|---|---|
void |
QuadTree.visit(BoundingBox boundingBox,
Visitor<T> visitor) |
boolean |
AbstractNode.visit(QuadTree<T> tree,
double[] bounds,
Visitor<T> visitor) |
boolean |
AbstractNode.visit(QuadTree<T> tree,
Visitor<T> visitor) |
void |
QuadTree.visitAll(Visitor<T> visitor) |
| Modifier and Type | Class and Description |
|---|---|
class |
LineSegmentIntersectionVisitor |
| Modifier and Type | Class and Description |
|---|---|
class |
AbstractItemVisitor<T> |
class |
EdgeCollectionVisitor<T> |
class |
EdgeVisitor<T> |
| Modifier and Type | Method and Description |
|---|---|
void |
Graph.queryEdges(EdgeVisitor<T> visitor,
Visitor<Edge<T>> matchVisitor) |
void |
Graph.visitEdges(Comparator<Edge<T>> comparator,
Visitor<Edge<T>> visitor) |
void |
Graph.visitEdges(Filter<Edge<T>> filter,
Comparator<Edge<T>> comparator,
Visitor<Edge<T>> visitor) |
void |
Graph.visitEdges(Filter<Edge<T>> filter,
Visitor<Edge<T>> visitor) |
void |
Graph.visitEdges(Visitor<Edge<T>> visitor) |
void |
Graph.visitEdges(Visitor<Edge<T>> visitor,
BoundingBox envelope) |
void |
Graph.visitNodes(Filter<Node<T>> filter,
Comparator<Node<T>> comparator,
Visitor<Node<T>> visitor) |
void |
Graph.visitNodes(Filter<Node<T>> filter,
Visitor<Node<T>> visitor) |
void |
Graph.visitNodes(Visitor<Node<T>> visitor) |
void |
Graph.visitNodes(Visitor<Node<T>> visitor,
Comparator<Node<T>> comparator) |
| Modifier and Type | Class and Description |
|---|---|
class |
EdgeLessThanDistance |
| Constructor and Description |
|---|
EdgeLessThanDistance(LineSegment lineSegment,
double maxDistance,
Visitor<Edge<LineSegment>> matchVisitor) |
| Modifier and Type | Method and Description |
|---|---|
void |
Reader.visit(Visitor<T> visitor)
Visit each item returned from the reader until all items have been visited
or the visit method returns false.
|
void |
AbstractReader.visit(Visitor<T> visitor)
Visit each item returned from the reader until all items have been visited
or the visit method returns false.
|
| Modifier and Type | Class and Description |
|---|---|
class |
PointInArea |
class |
RayCrossingCounter
Counts the number of segments crossed by a horizontal ray extending to the right
from a given point, in an incremental fashion.
|
| Modifier and Type | Method and Description |
|---|---|
void |
IndexedPointInAreaLocator.IntervalIndexedGeometry.query(double min,
double max,
Visitor<LineSegment> visitor) |
| Modifier and Type | Method and Description |
|---|---|
void |
SortedPackedIntervalRTree.query(double min,
double max,
Visitor<V> visitor)
Search for intervals in the index which intersect the given closed interval
and apply the visitor to them.
|
abstract void |
IntervalRTreeNode.query(double queryMin,
double queryMax,
Visitor<V> visitor) |
void |
IntervalRTreeLeafNode.query(double queryMin,
double queryMax,
Visitor<V> visitor) |
void |
IntervalRTreeBranchNode.query(double queryMin,
double queryMax,
Visitor<V> visitor) |
| Modifier and Type | Class and Description |
|---|---|
class |
AbstractVisitor<T> |
class |
BaseVisitor<T> |
class |
CreateListVisitor<T>
A visitor implementation which adds all the visited items to a List.
|
class |
DelegatingVisitor<T> |
class |
SingleObjectVisitor<T> |
| Modifier and Type | Method and Description |
|---|---|
Visitor<T> |
DelegatingVisitor.getVisitor() |
| Modifier and Type | Method and Description |
|---|---|
void |
DelegatingVisitor.setVisitor(Visitor<T> visitor) |
| Constructor and Description |
|---|
DelegatingVisitor(Comparator<T> comparator,
Visitor<T> visitor) |
DelegatingVisitor(Filter<T> filter,
Comparator<T> comparator,
Visitor<T> visitor) |
DelegatingVisitor(Filter<T> filter,
Visitor<T> visitor) |
DelegatingVisitor(Visitor<T> visitor) |
Copyright © 2015 Revolution Systems Inc.. All rights reserved.