Method PrintStringMatchData

avida-core/source/main/cStats.cc:3421–3533

Print information about the string matching... */

/* Print information about the string matching... */
void cStats::PrintStringMatchData(const cString& filename)
{
  Avida::Output::FilePtr df = Avida::Output::File::StaticWithPath(m_world->GetNewWorld(), (const char*)filename);
	df->WriteComment("Avida organism string donation information");
	df->WriteTimeStamp();
	df->Write(m_update,   "Update [update]");
	cOrganism* org;
  
  
	/*
	 // Interate through map of information.
	 map<cString,cDoubleSum>::iterator iter2;
	 for(iter2 = m_string_bits_matched.begin(); iter2 != m_string_bits_matched.end(); iter2++ ) {
	 df->Write(iter2->second.Average(), iter2->first);
	 }
   
   
	 // Create a map of the current tags in the population .
	 for(int i=0; i<m_world->GetPopulation().GetSize(); ++i) {
	 cPopulationCell& cell = m_world->GetPopulation().GetCell(i);
	 org = cell.GetOrganism();
   
	 if(cell.IsOccupied()) {
	 // Get tag and increment number of orgs.
	 m_tags[org->GetTagLabel()]++;
	 }
	 }
   
	 // print the tags
	 map<int, int>::iterator iter;
	 stringstream ss;
	 for(iter = m_tags.begin(); iter != m_tags.end(); iter++ ) {
	 ss << iter->first;
	 string name = ss.str();
	 df->Write(iter->second, name.c_str());
	 iter->second = 0;
	 }*/
  
  
	// Print data about strings:
	std::map <int, cDoubleSum> m_strings_stored;
	std::map <int, cDoubleSum> m_strings_produced;
	cDoubleSum total;
	int min = -1;
	int onhand = 0;
	int instant_perfect_match = 0;
	int instant_perfect_match_org = 0;
	int nothing  =0;
	int specialists = 0;
	int generalists = 0;
	int type_prod = 0;
  
	// Get the number of strings
	int num = m_world->GetEnvironment().GetNumberOfMatchStrings();
	for(int i=0; i<m_world->GetPopulation().GetSize(); ++i) {
    cPopulationCell& cell = m_world->GetPopulation().GetCell(i);
		org = cell.GetOrganism();
		min = -1;