c++_primer_exercise_1120

最新推荐文章于 2018-11-28 15:03:25 发布

头像是我的偶像

最新推荐文章于 2018-11-28 15:03:25 发布

阅读量456

点赞数

分类专栏： C++Primer6thExe

本文链接：https://blog.csdn.net/u013547361/article/details/42652729

版权

C++Primer6thExe 专栏收录该内容

50 篇文章 0 订阅

订阅专栏

For the containers that have unique keys, the versions of insert and emplace that add a single element return a pair that lets us know whether the insertion happed. The first member of the pair is an iterator to the element with the given key; the second is a bool indicating whether that element was inserted, or was already there. If the key is already in the container, then insert does nothing, and bool portion of the return value is false. If the key isn't present, then the element is inserted and the bool is true.

As the code rewrited, it implements word-counting.

Look! How Crazy!!!

/**********************************************
*	IDE: vs2013
**********************************************/
#include 
#include 
    
    
     
     
#include 
     
     
      
      
#include 
      
      
       
       	// for pair

int main(void)
{
	std::map
       
       
         word_count; std::string word; // version1 /* while (std::cin >> word) { ++word_count[word]; }*/ // version2, it works, but creazy!!! while (std::cin >> word) { std::pair 
         
         
           ::iterator, bool> ret = word_count.insert(std::make_pair(word, 1)); if (!ret.second) // word already in word_count { ++ret.first->second; } } std::map 
          
            ::iterator map_iter = word_count.begin(); while (map_iter != word_count.cend()) { std::cout << map_iter->first << " occurs " << map_iter->second << " times" << std::endl; ++map_iter; } return 0; }