C++学习记录（十一）容器deque、list、stack、set、map，I/O文件流，多线程入口

这是第十一天的学习。

#include <iostream>
#include <deque>
#include <algorithm>
#include <list>
#include <stack>
#include <queue>
#include <set>
#include <map>

using namespace std;

void Show(int& value)
{
    cout << value << endl;
}

void test()
{
    deque<int> _deque;
    _deque.push_back(10);
    _deque.push_back(30);
    _deque.push_back(50);
    _deque.push_back(70);
    _deque.push_back(90);
    for_each(_deque.begin(),_deque.end(),&Show);
    cout << "---***---" << endl;
    sort(_deque.begin(),_deque.end(),greater<int>());
    for_each(_deque.begin(),_deque.end(),&Show);
}

void test1()
{
    list<int> _list;
    _list.push_back(20);
    _list.push_back(40);
    _list.push_back(10);
    _list.push_back(90);
    _list.push_back(60);
    _list.sort();
    for_each(_list.begin(),_list.end(),&Show);
    cout << "---***---" << endl;
    _list.sort(greater<int>());
    for_each(_list.begin(),_list.end(),&Show);
    cout << "---***---" << endl;
    _list.reverse();
    for_each(_list.begin(),_list.end(),&Show);
    cout << "---***---" << endl;
    for (auto it = _list.begin(); it!=_list.end(); it++)
    {
        cout << *it << endl;
    }
    cout << "---***---" << endl;
    cout << _list.size() << endl;
}

void test2()
{
    stack<int> _stack;
    _stack.push(55);
    _stack.push(17);
    _stack.push(66);
    _stack.push(77);
    while (!_stack.empty())
    {
        cout << _stack.top() << endl;
        _stack.pop();
    }
}

void test3()
{
    queue<int> _qu;
    _qu.push(10);
    _qu.push(20);
    _qu.push(30);
    while (!_qu.empty())
    {
        cout << _qu.front() << endl;
        _qu.pop();
    }
}

class Stu
{
private:
    int id;
    string name;
    int age;
public:
    Stu(int id = 100, string name = "", int age = 0)
    {
        this->id = id;
        this->name = name;
        this->age = age;
    }
    void showInfo() const
    {
        cout << "Number: " << id << ", name: " << name << ", age: " << age << endl;
    }

    template<class T>
    friend class My_compair;
};
template<class T>
class My_compair
{
public:
    //返回值为布尔，称为谓词
    //bool operator()(T t1, T t2) { return t1.id < t2.id; }
    bool operator()(const T& t1, const T& t2) { return t1.id < t2.id; }
};

void test4()
{
    //set<int> _set;
    // 从大到小排序
    set<int, greater<int>> _set;
    _set.insert(10);
    _set.insert(90);
    _set.insert(30);
    _set.insert(70);
    _set.insert(50);
    for_each( _set.begin(), _set.end(), [=](int value){
        cout << value << endl;}
    );
    cout << "---***---" << endl;

    auto it = _set.find(50);
    if( it != _set.end()) { cout << "Finded this value! " << *it << endl; }
    else { cout << "Not find this value! " << endl; }
    cout << "---***---" << endl;

    // set中的比较器，只能为函数对象，不能为函数指针

    set<Stu, My_compair<Stu>> s1;
    s1.insert(Stu(101, "zhangsan", 18));
    s1.insert(Stu(102, "lisi", 19));
    s1.insert(Stu(105, "wangwu", 21));
    s1.insert(Stu(104, "zhaoliu", 20));
    //for_each(s1.begin(),s1.end(),[&](const Stu& stu){ stu.showInfo(); } );
    //cout << "---***---" << endl;

    pair< set<Stu, My_compair<Stu> >::iterator, bool> inst1;
    inst1 = s1.insert(Stu(103, "songqi", 22));
    if (!inst1.second) { cout << "Insert failed!" << endl; }
    else { cout << "Insert successed!" << endl; inst1.first->showInfo(); }
    cout << "---***---" << endl;

    pair<int, string> p1 = make_pair(106, "sunba");
    cout << p1.first << ", name: " << p1.second << endl;
    pair<int, string> p2(107, "zhoujiu");
    cout << p2.first << ", name: " << p2.second << endl;
}

void test5()
{
    //map<int, string> map1;
    map<int, string, greater<int>> map1;
    map1.insert(pair<int, string>(10,"xiaohong"));
    map1.insert(make_pair(11,"xiaohei"));
    map1.insert(map<int, string>::value_type(12,"xiaohuang"));
    // map中键值是只读的，需要加const
    for_each(map1.begin(),map1.end(),[=](pair<const int,string>& _map){
        cout << _map.first << "," << _map.second << endl; }
    );
}

int main()
{
    // vector:历史操作记录存储，经常查看数据
    // deque:排队购票，头尾数据快速处理
    // list:公交车乘客存储，平凡不确定位置元素插入
    // set:手机游戏个人得分记录，高低顺序排序
    // map:按ID号存储十万个用户，通过ID查找，查找效率高

    // -1- deque双端队列，允许在其首尾两端插入
    //test();

    // -2- list可以快速插入和删除数据
    //test1();

    // -3- stack栈，先进后出，queue队列,先进先出
    //test2();
    //test3();

    // -4- set对所以元素键值排序，值唯一
    //test4();

    // -5- map有序键值对容器
    test5();

    //cout << "Hello World!" << endl;
    return 0;
}

#include <iostream>
#include <fstream>
#include <sstream>

#include <thread>
#include <unistd.h>

using namespace std;

void write()
{
    ofstream file;
    file.open("./1.txt",ios_base::app);
    //ofstream file1("./2.txt",ios_base::app);
    if(!file.is_open()) { cout << "Write file failed" << endl; }
    file << "xieru" << endl;
    file.close();
}

void read()
{
    ifstream file;
    file.open("./1.txt", ios_base::in);
    if(!file.is_open()) { cout << "Open file failed" << endl; }

    // -1-
    /*
    string filetext;
    while (getline(file,filetext))
    {
        cout << filetext << endl;
    }
    */

    // -2-
    stringstream ss;
    ss << file.rdbuf();
    string str = ss.str();
    cout << str << endl;
}

void show()
{
    cout << " Thread begin running" << endl;
    for(int i = 0; i<10; i++)
    {
        cout << i << endl;
        sleep(1);
    }
    cout << " Thread end" << endl;
}

class A
{
public:
    void operator() ()
    {
        cout << " Thread begin running" << endl;
        for(int i = 0; i<10; i++)
        {
            cout << i << endl;
            sleep(1);
        }
        cout << " Thread end" << endl;
    }
    void showInfo()
    {
        cout << " Thread begin running" << endl;
        for(int i = 0; i<10; i++)
        {
            cout << i << endl;
            sleep(1);
        }
        cout << " Thread end" << endl;
    }
};

int main()
{
    // I/O 操作
    //write();
    //read();

    // 多线程
    // -1- 使用全局函数指针来实现线程入口
    //thread my_thread(&show);
    //my_thread.join();

    // -2- 使用匿名函数
    /*
    thread my_thread2( [=](){
        cout << " Thread begin running" << endl;
        for(int i = 0; i<10; i++)
        {
            cout << i << endl;
            sleep(1);
        }
        cout << " Thread end" << endl;
    } );
    my_thread2.join();
    */

    // -3- 使用仿函数
    A a;
    thread my_thread3(a);
    my_thread3.join();

    // -4- 使用成员函数
    A a1;
    thread my_thread4(&A::showInfo, &a1);
    my_thread4.join();

    //cout << "Hello World!" << endl;
    return 0;
}