geos::index::strtree::SimpleSTRdistance Class Reference

#include <SimpleSTRdistance.h>

Collaboration diagram for geos::index::strtree::SimpleSTRdistance:

Classes
struct	STRpairQueueCompare

Public Types
typedef std::priority_queue< SimpleSTRpair *, std::vector< SimpleSTRpair * >, STRpairQueueCompare >	STRpairQueue

Public Member Functions
	SimpleSTRdistance (SimpleSTRnode *root1, SimpleSTRnode *root2, ItemDistance *p_itemDistance)
std::pair< const void *, const void * >	nearestNeighbour ()
bool	isWithinDistance (double maxDistance)

Private Member Functions
SimpleSTRpair *	createPair (SimpleSTRnode *p_node1, SimpleSTRnode *p_node2, ItemDistance *p_itemDistance)
std::pair< const void *, const void * >	nearestNeighbour (SimpleSTRpair *p_initPair)
std::pair< const void *, const void * >	nearestNeighbour (SimpleSTRpair *p_initPair, double maxDistance)
bool	isWithinDistance (SimpleSTRpair *p_initPair, double maxDistance)
void	expandToQueue (SimpleSTRpair *pair, STRpairQueue &, double minDistance)
void	expand (SimpleSTRnode *nodeComposite, SimpleSTRnode *nodeOther, bool isFlipped, STRpairQueue &priQ, double minDistance)

Private Attributes
std::deque< SimpleSTRpair >	pairStore
SimpleSTRpair *	initPair
ItemDistance *	itemDistance

Detailed Description

Definition at line 108 of file SimpleSTRdistance.h.

Member Typedef Documentation

typedef std::priority_queue<SimpleSTRpair*, std::vector<SimpleSTRpair*>, STRpairQueueCompare> geos::index::strtree::SimpleSTRdistance::STRpairQueue

Definition at line 123 of file SimpleSTRdistance.h.

Constructor & Destructor Documentation

geos::index::strtree::SimpleSTRdistance::SimpleSTRdistance	(	SimpleSTRnode *	root1,
		SimpleSTRnode *	root2,
		ItemDistance *	p_itemDistance
	)

Member Function Documentation

SimpleSTRpair* geos::index::strtree::SimpleSTRdistance::createPair ( SimpleSTRnode *  p_node1, SimpleSTRnode *  p_node2, ItemDistance *  p_itemDistance  )

private

void geos::index::strtree::SimpleSTRdistance::expand ( SimpleSTRnode *  nodeComposite, SimpleSTRnode *  nodeOther, bool  isFlipped, STRpairQueue &  priQ, double  minDistance  )

private

void geos::index::strtree::SimpleSTRdistance::expandToQueue ( SimpleSTRpair *  pair, STRpairQueue &  , double  minDistance  )

private

bool geos::index::strtree::SimpleSTRdistance::isWithinDistance

(

double

maxDistance

)

bool geos::index::strtree::SimpleSTRdistance::isWithinDistance ( SimpleSTRpair *  p_initPair, double  maxDistance  )

private

std::pair<const void*, const void*> geos::index::strtree::SimpleSTRdistance::nearestNeighbour

(

)

std::pair<const void*, const void*> geos::index::strtree::SimpleSTRdistance::nearestNeighbour ( SimpleSTRpair *  p_initPair )

private

std::pair<const void*, const void*> geos::index::strtree::SimpleSTRdistance::nearestNeighbour ( SimpleSTRpair *  p_initPair, double  maxDistance  )

private

Member Data Documentation

SimpleSTRpair* geos::index::strtree::SimpleSTRdistance::initPair

private

Definition at line 137 of file SimpleSTRdistance.h.

ItemDistance* geos::index::strtree::SimpleSTRdistance::itemDistance

private

Definition at line 138 of file SimpleSTRdistance.h.

std::deque<SimpleSTRpair> geos::index::strtree::SimpleSTRdistance::pairStore

private

Definition at line 136 of file SimpleSTRdistance.h.

---

The documentation for this class was generated from the following file:

• SimpleSTRdistance.h