code: public void process( FastQueue<AssociatedIndex> matches, int sizeDst ) {
  		// initialize data structures
  		if( bestScores.length < sizeDst )
  			bestScores = new AssociatedIndex[sizeDst];
  
  		for( int i = 0; i < matches.size; i++ ) {
  			AssociatedIndex match = matches.data[i];
  
  			if( bestScores[match.dst] == null || match.fitScore < bestScores[match.dst].fitScore) {
  				bestScores[match.dst] = match;
  			}
  		}
  
  		// add the best unambiguous pairs back
  		unambiguous.reset();
  		for( int i = 0; i < sizeDst; i++ ) {
  			if( bestScores[i] != null ) {
  				unambiguous.add(bestScores[i]);
  				// clean up so that you don't have a dangling reference
  				bestScores[i] = null;
  			}
  		}
  	}
docs: Removes ambiguous associations.  Call {@link #getMatches()} to get the list of unambiguous
  matches.
  
  @param matches List of candidate associations
  @param sizeDst Number of 'dst' features