STL例子

map count、find搜索

#include <iostream>
#include <map>
#include <string>
#include <algorithm>
using namespace std;

int main()
{
map<string,int> test;
test.insert(make_pair("test1",1));
test.insert(make_pair("test2",2));

//如果map中存在所要查找的主键，就返回一
int count = test.count("test2");
cout<<"the value of count:"<<count<<endl;

//如果map中没有索要查找的主键，就返回map.end();
map<string,int>::iterator it = test.find("test2");
if(it != test.end())
cout<<"has find the string"<<endl;
return 0;
}

string查找、提取字段

#include <iostream>
#include <map>
#include <string>
#include <algorithm>
using namespace std;

int main()
{
    string str_dell = "DELL TX*45";
    if(str_dell.find("*") != std::string::npos)
    {
        cout << "find *" << endl;
        string basic_model;
        string last_model;
        size_t pos = str_dell.find(" ");
        if(pos != string::npos)
        {
            basic_model = str_dell.substr(0, pos); // 提取空格之前的数据
            last_model = str_dell.substr(pos+1); // 提取空格之后的数据
            cout << "b:" <<  basic_model << ", l:" << last_model << endl; 
        }else
        {
            cout << "error" << endl; 
        }
    }
    return 0;
    }

sort 降序升序排序实例

#include <iostream>
#include <map>
#include <string>
#include <list>
#include <vector>
#include <tr1/memory>
#include<windows.h>
#include<sstream>
#include <algorithm>
#include <functional>

using namespace std;
using std::tr1::shared_ptr;

// 降序比较函数
bool desc_cmp(const string & str_one, const string & str_two) 
{
    return str_one > str_two;
}

int main()
{
    vector<string> vec_strs;
    vec_strs.push_back("Long Long*");
    vec_strs.push_back("Long *");
    vec_strs.push_back("Long Lo*");
    vec_strs.push_back("Long L*ng");
    vec_strs.push_back("Long Lon*");
    // 排序 升序排序（ 默认使用该方式 ） 
    vector<string> vec_strs_asc = vec_strs;
    cout<< "ascending order:" << endl;
    sort(vec_strs_asc.begin(), vec_strs_asc.end());
    for(unsigned int i = 0; i < vec_strs_asc.size(); i++)
    {
        cout<< i << ", data:" << vec_strs_asc[i] << endl;
    }
    // 降序 
    vector<string> vec_strs_desc = vec_strs;
    cout << "descending order:" << endl;
    sort(vec_strs_desc.begin(), vec_strs_desc.end(),desc_cmp);
    for(unsigned int i = 0; i < vec_strs_desc.size(); i++)
    {
        cout<< i << ", data:" << vec_strs_desc[i] << endl;
    }
    return 0;
}