src/PredFinder/common/ElfMultiDoc.cpp
// Find the potential ID mappings with the highest count and longest URI

Find the potential ID mappings with the highest count and longest URI
Find the potential ID mappings with the highest count and longest URI
BOOST_FOREACH(PotentialXdocIdToCountAndGreatestLengthMap::value_type potential_id, potential_ids){
			SessionLogger::info("potential_id_first") << "potential_id.first: <" << potential_id.first << ">" << std::endl;
			if (max_count <= potential_id.second.first) {
				max_count = potential_id.second.first;
				max_count_size = potential_id.second.second;
				freq_uri = potential_id.first;
			}
			if (longest_size <= potential_id.second.second) {
				longest_count = potential_id.second.first;
				longest_size = potential_id.second.second;
				longest_uri = potential_id.first;
			}
		}
BOOST_FOREACH ( PotentialXdocIdToCountAndGreatestLengthMap :: value_type potential_id , potential_ids ) { SessionLogger :: info ( " " ) << " " << potential_id . first << " " << std :: endl ; if ( max_count <= potential_id . second . first ) { max_count = potential_id . second . first ; max_count_size = potential_id . second . second ; freq_uri = potential_id . first ; } if ( longest_size <= potential_id . second . second ) { longest_count = potential_id . second . first ; longest_size = potential_id . second . second ; longest_uri = potential_id . first ; } }
Find the potential ID mappings with the highest count and longest URI
Find the potential ID mappings with the highest count and longest URI
// This code is not hit for the first batch of IC or NFL dry run.
