Package org.ddogleg.nn.wrap

Class WrapExhaustiveNeighbor<P>

java.lang.Object

org.ddogleg.nn.wrap.WrapExhaustiveNeighbor<P>

All Implemented Interfaces:

NearestNeighbor<P>

public class WrapExhaustiveNeighbor<P>
extends Object
implements NearestNeighbor<P>

Wrapper around ExhaustiveNeighbor for NearestNeighbor

Nested Class Summary

Nested classes/interfaces inherited from interface org.ddogleg.nn.NearestNeighbor

NearestNeighbor.Search<P>

Constructor Summary

Constructors

Constructor	Description
WrapExhaustiveNeighbor(KdTreeDistance<P> distance)

Method Summary

Modifier and Type	Method	Description
NearestNeighbor.Search<P>	createSearch()	Creates a new search for this data structure.
void	setPoints(List<P> points, boolean trackIndicies)	Specifies the set of points which are to be searched.

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

WrapExhaustiveNeighbor

public WrapExhaustiveNeighbor(KdTreeDistance<P> distance)

Method Details

setPoints

public void setPoints(List<P> points,
 boolean trackIndicies)

Description copied from interface: NearestNeighbor

Specifies the set of points which are to be searched.

Specified by:

setPoints in interface NearestNeighbor<P>

Parameters:

points - Set of points.

trackIndicies - If true it will keep track of the index. Making it easy to associate data.

createSearch

public NearestNeighbor.Search<P> createSearch()

Description copied from interface: NearestNeighbor

Creates a new search for this data structure. This is intended to enabled concurrent searches. After NearestNeighbor.setPoints(java.util.List<P>, boolean) has been called and returned, each searched can be called independently in separate threads. Do not call NearestNeighbor.setPoints(java.util.List<P>, boolean) which a search is being performed.

Specified by:

createSearch in interface NearestNeighbor<P>

Returns:

A new search object for this instance.