for loop cpp map

來源:互聯網
上載者:User
map<char,int> first;    first['a']=1;    first['b']=2;    first['c']=3;    first['d']=4;    first['e']=5;    first['a']=11;      //overrite 1    map<char,int>::iterator it;    for(it=first.begin();it!=first.end();++it){        cout<<it->first<<"="<<it->second<<endl;    }    typedef map<string,float> SFMap;    SFMap second;    second["abcdefg"]=3.1215926;    second["sdfsdf"]=234234;    second["sdfsdfdfdf"]=3219462;    for(SFMap::iterator it=second.begin();it!=second.end();++it){        cout<<it->first<<"="<<it->second<<endl;    }/*****************************************/// constructing maps#include <iostream>#include <map>using namespace std;bool fncomp (char lhs, char rhs) {return lhs<rhs;}struct classcomp {  bool operator() (const char& lhs, const char& rhs) const  {return lhs<rhs;}};int main (){  map<char,int> first;  first['a']=10;  first['b']=30;  first['c']=50;  first['d']=70;  map<char,int> second (first.begin(),first.end());  map<char,int> third (second);  map<char,int,classcomp> fourth;                 // class as Compare  bool(*fn_pt)(char,char) = fncomp;  map<char,int,bool(*)(char,char)> fifth (fn_pt); // function pointer as Compare  return 0;}

  

聯繫我們

該頁面正文內容均來源於網絡整理,並不代表阿里雲官方的觀點,該頁面所提到的產品和服務也與阿里云無關,如果該頁面內容對您造成了困擾,歡迎寫郵件給我們,收到郵件我們將在5個工作日內處理。

如果您發現本社區中有涉嫌抄襲的內容,歡迎發送郵件至: info-contact@alibabacloud.com 進行舉報並提供相關證據,工作人員會在 5 個工作天內聯絡您,一經查實,本站將立刻刪除涉嫌侵權內容。

A Free Trial That Lets You Build Big!

Start building with 50+ products and up to 12 months usage for Elastic Compute Service

  • Sales Support

    1 on 1 presale consultation

  • After-Sales Support

    24/7 Technical Support 6 Free Tickets per Quarter Faster Response

  • Alibaba Cloud offers highly flexible support services tailored to meet your exact needs.