객체지향프로그래밍2 - 부실한 기초6

*STL

#include <iostream>
#include <list>
#include <vector>
#include <map>
#include <algorithm>
#include <functional>
using namespace std;
 
int main()
{
    list <int> List;
    vector <int> Vector;
    map <int, char, greater<int>> Map;//기본값은 less<int>
    //key값을 내림차순으로
    for (int i = 0; i < 10; i++) {
        int r = rand() % 10;
        List.push_back(r);
        Vector.push_back(r);
        Map.insert({ r, 'A' + i }); // Map[r] = 'A' + i;
    }
 
    List.remove(2);
    List.reverse();
    List.push_front(2);
    for (vector<int>::iterator it = Vector.begin(); it != Vector.end(); it++) {
        if (*it == 2) it = Vector.erase(it); //중요
    }
    Map.erase(2);
 
    list<int>::iterator List_it = List.begin();
    List_it++;
    List.insert(List_it, 10);
    vector<int>::iterator Vector_it = Vector.begin();
    Vector_it = Vector_it + 5;
    Vector.insert(Vector_it, 10);
 
    for (map<int, char>::iterator it = Map.begin(); it != Map.end(); it++) {
        cout << (*it).first << ','<<(*it).second << endl;
    }
 
    //sort(List.begin(), List.end()); //에러발생
    sort(Vector.begin(), Vector.end());
    //sort(Map.begin(), Map.end()); //에러발생
}

List.remove(2);
 
for (vector<int>::iterator it = Vector.begin(); it != Vector.end(); it++) {
        if (*it == 2) it = Vector.erase(it); //중요
}

*find

List_it = find(List.begin(), List.end(), 2);
if (List_it == List.end()) {
    cout << boolalpha << false << endl;
}
else {
    cout << boolalpha << true << endl;
}
 
Vector_it = find(Vector.begin(), Vector.end(), 12);
if (Vector_it == Vector.end()) {
    cout << boolalpha << false << endl;
}
else {
    cout << boolalpha << true << endl;
}

Map은 List나 Vector와는 다르게 find함수가 있습니다.
Map_it = Map.find(4);
if (Map_it == Map.end()) {
    cout << boolalpha << false << endl;
}
else {
    cout << boolalpha << true << endl;
}