Class WrapExhaustiveNeighbor<P>
java.lang.Object
org.ddogleg.nn.wrap.WrapExhaustiveNeighbor<P>
- All Implemented Interfaces:
NearestNeighbor<P>
Wrapper around
ExhaustiveNeighbor for NearestNeighbor-
Nested Class Summary
Nested classes/interfaces inherited from interface NearestNeighbor
NearestNeighbor.Search<P> -
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionCreates a new search for this data structure.voidSpecifies the set of points which are to be searched.
-
Constructor Details
-
WrapExhaustiveNeighbor
-
-
Method Details
-
setPoints
Description copied from interface:NearestNeighborSpecifies the set of points which are to be searched.- Specified by:
setPointsin interfaceNearestNeighbor<P>- Parameters:
points- Set of points.trackIndicies- If true it will keep track of the index. Making it easy to associate data.
-
createSearch
Description copied from interface:NearestNeighborCreates a new search for this data structure. This is intended to enabled concurrent searches. AfterNearestNeighbor.setPoints(List, boolean)has been called and returned, each searched can be called independently in separate threads. Do not callNearestNeighbor.setPoints(List, boolean)which a search is being performed.- Specified by:
createSearchin interfaceNearestNeighbor<P>- Returns:
- A new search object for this instance.
-