C++ STL

STL
vector
string
set
map
queue
stack
deque

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <deque>
#include <stack>
using namespace std;

void x_vector() {
    cout << "----------------------" << endl;
    cout << "vector: " << endl;
    vector<int> v(10, 5);
    v.push_back(9);
    cout << "v.size(): " << v.size() << endl;
    cout << "v.capacity(): " << v.capacity() << endl;
    cout << "v.empty(): " << v.empty() << endl;
    
    for (vector<int>::iterator it = v.begin(); it != v.end(); it++) {
        cout << *it << " ";
    }
    cout << endl;
    v.resize(15, 6);
    for (vector<int>::iterator it = v.begin(); it != v.end(); it++) {
        cout << *it << " ";
    }
    cout << endl;
    v.pop_back();
    v.insert(v.begin(), 2);
    v.erase(v.begin() + 11);
    for (vector<int>::iterator it = v.begin(); it != v.end(); it++) {
        cout << *it << " ";
    }
    cout << endl;
    cout << "----------------------" << endl;
}

void x_queue()
{
    cout << "----------------------" << endl;
    cout << "queue: " << endl;
    queue<int> q;
    q.push(5);
    q.push(1);
    q.push(2);
    cout << "q.size(): " << q.size() << endl;
    q.pop();
    cout << "queue is empty ? " << q.empty() << endl;
    cout << "q.front(): " << q.front() << endl;
    cout << "q.back(): " << q.back() << endl;
    cout << "----------------------" << endl;
}

void x_stack()
{
    cout << "----------------------" << endl;
    cout << "stack: " << endl;
    stack<int> s;
    s.push(5);
    s.push(2);
    s.push(3);
    cout << "s.size(): " << s.size() << endl;
    s.pop();
    cout << "s.top(): " << s.top() << endl;
    cout << "s.empty(): " << s.empty() << endl;
    cout << "----------------------" << endl;
}

void x_deque()
{
    cout << "----------------------" << endl;
    cout << "deque: " << endl;
    deque<int> q;
    q.push_front(3);
    q.push_front(5);
    q.push_back(6);
    q.push_back(9);
    // q.front();
    // q.back();
    cout << "q.size(): " << q.size() << endl;
    q.pop_front();
    q.pop_back();
    cout << "queue is empty ? " << q.empty() << endl;
    cout << "q.front(): " << q.front() << endl;
    cout << "q.back(): " << q.back() << endl;
    cout << "----------------------" << endl;
}

void x_string()
{
    cout << "----------------------" << endl;
    cout << "string: " << endl;
    char *str1 = "hello world";
    const char *str2 = "hello world";
    string s("abcd");
    string s1(str1);
    string s2(str2);
    string s3(s);
    string s4(10, 'a');
    string s5 = s;
    string s6;
    s6.assign("hello c++", 5);
    cout << "s1: " << s1 << endl;
    cout << "s2: " << s2 << endl;
    cout << "s3: " << s3 << endl;
    cout << "s4: " << s4 << endl;
    cout << "s5: " << s1 << endl;
    cout << "s6: " << s6 << endl;
    s6.assign(5, 'x');
    cout << "s6: " << s6 << endl;

    s6 += "世界";
    s6.append("你好");
    s6.append(s, 2, 1); // 下标2位置开始，截取1个字符，拼接到末尾
    cout << "s6: " << s6 << endl;
    cout << ((s6.find("你") == -1) ? "未找到" : "找到：") << s6.find("你") << endl;
    cout << "找到'界': " << s6.find("界") << endl;

    s6.replace(1, 3, "b");
    cout << "s6: " << s6 << endl;

    if ( s5 < s6) {
        cout << "s5 小于 s6" << endl;
    } else {
        cout << "s5 大于等于 s6" << endl;
    }
    cout << "s6[3]: " << s6[3] << endl;
    cout << "s6.at(3): " << s6.at(3) << endl;

    s6.insert(1, "hh");
    cout << "s6: " << s6 << endl;
    s6.insert(1, 3, 'u');
    cout << "s6: " << s6 << endl;
    s6.erase(1, 3);
    cout << "s6: " << s6 << endl;

    cout << "s length: " << s.length() << endl;
    cout << "s size(): " << s.size() << endl;
    cout << "s :" << s << endl;
    string sub_s = s.substr(1, 2); //从pos处向后取n位
    cout << "sub_s: " << sub_s << endl;
    
}

void x_unordered_map()
{
    cout << "----------------------" << endl;
    cout << "unordered_map: " << endl;
    cout << "----------------------" << endl;
}

void x_set()
{
    cout << "----------------------" << endl;
    cout << "set: " << endl;
    set<string> s;
    s.insert("abc");
    s.insert("cab");
    s.insert("bca");
    // cout << *s.begin() << endl;
    cout << "s.size(): " << s.size() << endl;
    // cout << *s.begin() << endl;
    for (set<string>::iterator it = s.begin(); it != s.end(); it++) {
        cout << *it << " ";
    }
    cout << endl;
    s.erase(*s.begin()); // s.erase(s.begin()); 
    s.erase("bca");
    for (set<string>::iterator it = s.begin(); it != s.end(); it++) {
        cout << *it << " ";
    }
    cout << endl;
    cout << *s.find("cab") << endl;
    cout << s.count("cab") << endl;
    // cout << s.count("cad") << endl;
    // s.find("cad") == s.end() ? 1 : 0;
    cout << ((s.find("cad") == s.end()) ? 1 : 0) << endl;
    s.erase(s.begin(), s.end());
    s.clear();
    cout << "----------------------" << endl;
    // printf("%s\n",*s.begin()); //problem
}

void x_map()
{
    cout << "----------------------" << endl;
    cout << "map: " << endl;
    map<string, int> m;
    m.insert(pair<string, int>("hello world", 1));
    m.insert(pair<string, int>("abc", 2));
    m.insert(pair<string, int>("cab", 0));
    m.insert(pair<string, int>("bca", 6));
    cout << "m.size(): " << m.size() << endl;
    // cout << m.begin()->first << ":" << m.begin()->second << endl;
    for (map<string, int>::iterator it = m.begin(); it != m.end(); it++) {
        cout << it->first << ": " << it->second << endl;
    }
    m.erase(m.begin()); // s.erase(s.begin()); 
    m.erase("bca");
    for (map<string, int>::iterator it = m.begin(); it != m.end(); it++) {
        cout << it->first << " " << it->second << endl;
    }
    cout << m.find("cab")->first << endl;
    cout << m.count("cab") << endl;
    cout << ((m.find("cad") == m.end()) ? 1 : 0) << endl;
    cout << m.count("cad") << endl;
    cout << "----------------------" << endl;
}

int main()
{
    x_vector();
    x_queue();
    x_stack();
    x_deque();
    x_string();
    x_set();
    x_map();
    // int n;
    // cin >> n;
    // cout << "n: " << n;
    return 0;
}