@Override
	public void findNeighbor(P target, int searchN, FastQueue<KdTreeResult> results) {
		if( searchN <= 0 )
			throw new IllegalArgumentException("I'm sorry, but I refuse to search for less than or equal to 0 neighbors.");

		if( tree.root == null )
			return;

		this.searchN = searchN;
		this.target = target;
		this.mostDistantNeighborSq = maxDistanceSq;

		stepClosest(tree.root,results);
	}
@ Override public void findNeighbor ( P target , int searchN , FastQueue < KdTreeResult > results ) { if ( searchN <= 0 ) throw new IllegalArgumentException ( "I'm sorry, but I refuse to search for less than or equal to 0 neighbors." ) ; if ( tree . root == null ) return ; this . searchN = searchN ; this . target = target ; this . mostDistantNeighborSq = maxDistanceSq ; stepClosest ( tree . root , results ) ; }
Finds the nodes which are closest to 'target' and within range of the maximum distance.

@param target A point
@param searchN Number of nearest-neighbors it will search for
@param results Storage for the found neighbors