src/Generic/names/IdFModel.cpp
/** check to make sure all tags read in are actually in _nameClassTags tag set 
 *  quickly and inefficiently implemented, so not currently called */
check to make sure all tags read in are actually in _nameClassTags tag set
quickly and inefficiently implemented, so not currently called
check to make sure all tags read in are actually in _nameClassTags tag set quickly and inefficiently implemented so not currently called
bool IdFModel::checkNameClassTagConsistency()
{
	if (!DECODE)
		return true;
	NgramScoreTable::Table::iterator iter;
	for (iter = _tagFullProbabilities->get_start(); iter != _tagFullProbabilities->get_end(); ++iter) {
		if (_nameClassTags->getIndexForTag((*iter).first[0]) < 0)
			return false;
	}
	for (iter = _wordTagProbabilities->get_start(); iter != _wordTagProbabilities->get_end(); ++iter) {
		if (_nameClassTags->getIndexForTag((*iter).first[1]) < 0)
			return false;
	}
	for (iter = _wordStartProbabilities->get_start(); iter != _wordStartProbabilities->get_end(); ++iter) {
		if (_nameClassTags->getIndexForTag((*iter).first[1]) < 0)
			return false;
	}
	for (iter = _wordContinueProbabilities->get_start(); iter != _wordContinueProbabilities->get_end(); ++iter) {
		if (_nameClassTags->getIndexForTag((*iter).first[1]) < 0)
			return false;
	}
	return true;
}
bool IdFModel :: checkNameClassTagConsistency ( ) { if ( ! DECODE ) return true ; NgramScoreTable :: Table :: iterator iter ; for ( iter = _tagFullProbabilities -> get_start ( ) ; iter != _tagFullProbabilities -> get_end ( ) ; ++ iter ) { if ( _nameClassTags -> getIndexForTag ( ( * iter ) . first [ 0 ] ) < 0 ) return false ; } for ( iter = _wordTagProbabilities -> get_start ( ) ; iter != _wordTagProbabilities -> get_end ( ) ; ++ iter ) { if ( _nameClassTags -> getIndexForTag ( ( * iter ) . first [ 1 ] ) < 0 ) return false ; } for ( iter = _wordStartProbabilities -> get_start ( ) ; iter != _wordStartProbabilities -> get_end ( ) ; ++ iter ) { if ( _nameClassTags -> getIndexForTag ( ( * iter ) . first [ 1 ] ) < 0 ) return false ; } for ( iter = _wordContinueProbabilities -> get_start ( ) ; iter != _wordContinueProbabilities -> get_end ( ) ; ++ iter ) { if ( _nameClassTags -> getIndexForTag ( ( * iter ) . first [ 1 ] ) < 0 ) return false ; } return true ; }
check to make sure all tags read in are actually in _nameClassTags tag set
  quickly and inefficiently implemented, so not currently called
check to make sure all tags read in are actually in _nameClassTags tag set quickly and inefficiently implemented so not currently called