src/Generic/descriptors/ClassifierTreeSearch.cpp
// assuming we start with a single mention set, use that as the 
// foothold to start the process

assuming we start with a single mention set, use that as the
foothold to start the process
assuming we start with a single mention set use that as the foothold to start the process
void ClassifierTreeSearch::resetSearch(MentionSet *newRoot, int max_leaves) {
	initializeCurrentLeavesIfNeeded(max_leaves);
	if (_is_branching) {
		int i;
		for (i=0; i<max_leaves; i++) {
			if (_currentLeaves[i] != NULL) {
				delete _currentLeaves[i];
				_currentLeaves[i] = NULL;
			}
		}
	}
	_currentLeaves[0] = newRoot;
	_nCurrentLeaves = 1;
}
void ClassifierTreeSearch :: resetSearch ( MentionSet * newRoot , int max_leaves ) { initializeCurrentLeavesIfNeeded ( max_leaves ) ; if ( _is_branching ) { int i ; for ( i = 0 ; i < max_leaves ; i ++ ) { if ( _currentLeaves [ i ] != NULL ) { delete _currentLeaves [ i ] ; _currentLeaves [ i ] = NULL ; } } } _currentLeaves [ 0 ] = newRoot ; _nCurrentLeaves = 1 ; }
assuming we start with a single mention set, use that as the
foothold to start the process
assuming we start with a single mention set use that as the foothold to start the process