#include <SimpleSTRdistance.h>
Definition at line 40 of file SimpleSTRdistance.h.
double geos::index::strtree::SimpleSTRpair::distance |
( |
| ) |
|
|
private |
Computes the distance between the SimpleSTRnodes in this pair. The nodes are either composites or leaves.
If either is composite, the distance is computed as the minimum distance between the bounds. If both are leaves, the distance is computed by ItemDistance::distance(const void* item1, const void* item2).
- Returns
- the distance between the items
double geos::index::strtree::SimpleSTRpair::getDistance |
( |
| ) |
const |
SimpleSTRnode* geos::index::strtree::SimpleSTRpair::getNode |
( |
int |
i | ) |
const |
bool geos::index::strtree::SimpleSTRpair::isLeaves |
( |
| ) |
const |
Tests if both elements of the pair are leaf nodes
- Returns
- true if both pair elements are leaf nodes
double geos::index::strtree::SimpleSTRpair::maximumDistance |
( |
| ) |
|
Computes the maximum distance between any two items in the pair of nodes.
- Returns
- the maximum distance between items in the pair
std::ostream& operator<< |
( |
std::ostream & |
os, |
|
|
SimpleSTRpair & |
pair |
|
) |
| |
|
friend |
ItemDistance* geos::index::strtree::SimpleSTRpair::itemDistance |
|
private |
double geos::index::strtree::SimpleSTRpair::m_distance |
|
private |
The documentation for this class was generated from the following file: