UNIX for Dummies Questions & Answers

for(iter = dist.begin(); iter != dist.end(); ++iter)//{
                cout << "Distance: " << iter->first << " , Value: " << iter->second << endl;
                cout.flush();
}

        
for(iter = dist.begin(); iter != dist.end(); ++iter)//{
       cout << "Distance: " << iter->first << " , Value: " << iter->second << endl;
       //cout.flush();
//}

//actorList is a vector which holds pointers of actor classes
//in an actor class there is an integer (dist) which represents the distance of
// current actor to another one. this function is supposed to generate new
// distances in map and if distance already exists in the map, dist map
// increases the value part of key. for instance, all actors whose distance 
//is 5 count on map dist[5][n], n shows the total number of actors. if there
// is no key=5 in the map, it simply creates one and adds it to the map (using make_pair(_,_)). 


void printDist(){
        typedef map<int, int> mapType;
        mapType dist;
        dist.insert (make_pair(0 ,0));
                                 
        mapType::iterator iter = dist.begin();
                
        cout << "Size of actor list: " << (*actorList).size() << endl;

        timer1.restart();
        for(int i=0;i<(*actorList).size();i++){
                iter = dist.find((*actorList)[i]->dist);
                
                if(iter == dist.end()){
                        if(iter->first == (*actorList)[i]->dist){
                                dist.insert (make_pair((*actorList)[i]->dist ,1)); //add new distance to map
                                cout << "Element was inserted. Size of dist:" << dist.size() << endl;
                        }
                }else{  
                        iter->second += 1; //if distance already exists in map, simply increase the value by 1.
                }
        }
        
        timer1.stop();
        timer1.check("Actor list travel: ");
                     
        for(iter = dist.begin(); iter != dist.end(); ++iter)
                cout << "Distance: " << iter->first << " , Value: " << iter->second << " Out of: " << dist.size() << endl;
}