src/Generic/edt/LinkerTreeSearch.cpp
//clear leaves from the searcher, load as many into results[] as will fit (delete the extras)

clear leaves from the searcher, load as many into results[] as will fit (delete the extras)
clear leaves from the searcher load as many into results [] as will fit ( delete the extras )
int LinkerTreeSearch::removeLeaves(LexEntitySet *results[], int max_results) {
	int nResults = 0, i;
	while(_nCurrentLeaves > max_results) {
		delete _currentLeaves[--_nCurrentLeaves];
		_currentLeaves[_nCurrentLeaves] = NULL;
	}
	for (i=0; i<_nCurrentLeaves; i++) {
		results[i] = _currentLeaves[i];
		_currentLeaves[i] = NULL;
		nResults++;
	}
	_nCurrentLeaves = 0;
	return nResults;	
}
int LinkerTreeSearch :: removeLeaves ( LexEntitySet * results [ ] , int max_results ) { int nResults = 0 , i ; while ( _nCurrentLeaves > max_results ) { delete _currentLeaves [ -- _nCurrentLeaves ] ; _currentLeaves [ _nCurrentLeaves ] = NULL ; } for ( i = 0 ; i < _nCurrentLeaves ; i ++ ) { results [ i ] = _currentLeaves [ i ] ; _currentLeaves [ i ] = NULL ; nResults ++ ; } _nCurrentLeaves = 0 ; return nResults ; }
clear leaves from the searcher, load as many into results[] as will fit (delete the extras)
clear leaves from the searcher load as many into results [] as will fit ( delete the extras )
//delete extras
