|
||||||||||
PREV NEXT | FRAMES NO FRAMES |
Packages that use Shape | |
---|---|
org.geotools.caching.grid.spatialindex | |
org.geotools.caching.spatialindex |
Uses of Shape in org.geotools.caching.grid.spatialindex |
---|
Methods in org.geotools.caching.grid.spatialindex that return Shape | |
---|---|
Shape |
GridNode.getShape()
|
Shape |
GridData.getShape()
|
Methods in org.geotools.caching.grid.spatialindex with parameters of type Shape | |
---|---|
java.util.List<java.lang.Integer> |
GridRootNode.getChildren(Shape shape)
|
protected void |
GridSpatialIndex.insertData(NodeIdentifier n,
java.lang.Object data,
Shape shape)
|
void |
GridSpatialIndex.insertData(java.lang.Object data,
Shape shape)
This function assumes that you have a lock on the necessary nodes. |
protected void |
GridSpatialIndex.insertDataOutOfBounds(java.lang.Object data,
Shape shape)
|
protected void |
GridSpatialIndex.rangeQuery(int type,
Shape query,
Visitor v)
Common algorithm used by both intersection and containment queries. |
protected void |
GridSpatialIndex.visitData(Node n,
Visitor v,
Shape query,
int type)
|
Constructors in org.geotools.caching.grid.spatialindex with parameters of type Shape | |
---|---|
GridData(Shape shape,
java.lang.Object data)
|
|
NodeCursor(GridRootNode root,
Shape s)
|
Uses of Shape in org.geotools.caching.spatialindex |
---|
Classes in org.geotools.caching.spatialindex that implement Shape | |
---|---|
class |
Point
|
class |
Region
|
Methods in org.geotools.caching.spatialindex that return Shape | |
---|---|
Shape |
Entry.getShape()
|
abstract Shape |
NodeIdentifier.getShape()
|
Shape |
RegionNodeIdentifier.getShape()
Returns a copy of the nodes shape |
Methods in org.geotools.caching.spatialindex with parameters of type Shape | |
---|---|
void |
SpatialIndex.containmentQuery(Shape query,
Visitor v)
Traverse index to match data such as : query.contains(Data.getShape()) |
void |
AbstractSpatialIndex.containmentQuery(Shape query,
Visitor v)
|
boolean |
Shape.contains(Shape s)
|
boolean |
Region.contains(Shape s)
|
boolean |
Point.contains(Shape s)
|
double |
Shape.getMinimumDistance(Shape s)
|
double |
Region.getMinimumDistance(Shape s)
|
double |
Point.getMinimumDistance(Shape s)
|
double |
NearestNeighborComparator.getMinimumDistance(Shape query,
Entry e)
|
protected abstract void |
AbstractSpatialIndex.insertData(NodeIdentifier n,
java.lang.Object data,
Shape shape)
Insert new data into target node. |
void |
SpatialIndex.insertData(java.lang.Object data,
Shape shape)
Insert new data in the index. |
void |
AbstractSpatialIndex.insertData(java.lang.Object data,
Shape shape)
Inserts data into the spatial index. |
protected abstract void |
AbstractSpatialIndex.insertDataOutOfBounds(java.lang.Object data,
Shape shape)
Insert new data with shape not contained in the current index. |
void |
SpatialIndex.intersectionQuery(Shape query,
Visitor v)
Traverse index to match data such as : query.intersects(Data.getShape()) |
void |
AbstractSpatialIndex.intersectionQuery(Shape query,
Visitor v)
|
boolean |
Shape.intersects(Shape s)
|
boolean |
Region.intersects(Shape s)
|
boolean |
Point.intersects(Shape s)
|
void |
SpatialIndex.nearestNeighborQuery(int k,
Shape query,
Visitor v)
|
void |
AbstractSpatialIndex.nearestNeighborQuery(int k,
Shape query,
Visitor v)
|
void |
SpatialIndex.nearestNeighborQuery(int k,
Shape query,
Visitor v,
NearestNeighborComparator nnc)
|
void |
AbstractSpatialIndex.nearestNeighborQuery(int k,
Shape query,
Visitor v,
NearestNeighborComparator nnc)
|
protected void |
AbstractSpatialIndex.rangeQuery(int type,
Shape query,
Visitor v)
Common algorithm used by both intersection and containment queries. |
boolean |
Shape.touches(Shape s)
|
boolean |
Region.touches(Shape s)
|
boolean |
Point.touches(Shape s)
|
protected abstract void |
AbstractSpatialIndex.visitData(Node n,
Visitor v,
Shape query,
int type)
Visit data associated with a node using given visitor. |
|
||||||||||
PREV NEXT | FRAMES NO FRAMES |