src/Generic/descriptors/ClassifierTreeSearch.cpp
// put the newLeaves set in place, as the ancestors from which
// the classifier will fork and update
// the leaves that were here before are not referenced by anyone now

put the newLeaves set in place, as the ancestors from which
the classifier will fork and update
the leaves that were here before are not referenced by anyone now
put the newLeaves set in place as the ancestors from which the classifier will fork and update the leaves that were here before are not referenced by anyone now
void ClassifierTreeSearch::resetSearch(MentionSet *newLeaves[], int max_leaves) {
	initializeCurrentLeavesIfNeeded(max_leaves);
	int i;
	_nCurrentLeaves = 0;
	for (i=0; i<max_leaves; i++) {
		if (_is_branching) {
			if (_currentLeaves[i] != NULL)
				delete _currentLeaves[i];
		}
		_currentLeaves[i] = newLeaves[i];
		if (newLeaves[i]!= NULL)
			_nCurrentLeaves++;
	}
}
void ClassifierTreeSearch :: resetSearch ( MentionSet * newLeaves [ ] , int max_leaves ) { initializeCurrentLeavesIfNeeded ( max_leaves ) ; int i ; _nCurrentLeaves = 0 ; for ( i = 0 ; i < max_leaves ; i ++ ) { if ( _is_branching ) { if ( _currentLeaves [ i ] != NULL ) delete _currentLeaves [ i ] ; } _currentLeaves [ i ] = newLeaves [ i ] ; if ( newLeaves [ i ] != NULL ) _nCurrentLeaves ++ ; } }
put the newLeaves set in place, as the ancestors from which
the classifier will fork and update
the leaves that were here before are not referenced by anyone now
put the newLeaves set in place as the ancestors from which the classifier will fork and update the leaves that were here before are not referenced by anyone now