STL function usage is continuously updated

map mapping

map<string,string>mp;
1. Traverse 
for(auto k : mp)
k.first// key 
k.second// value 
2, Head iterator 
mp.begin()// Return to point map The iterator of the head 
3. Tail iterator 
mp.end()// Return to point map Iterator at the end 
4. eliminate 
mp.clear()// Delete all elements 
5. Count 
mp.count()// Returns the number of occurrences of the specified element , One key one value , therefore count Also used to find 
6. Sentenced to empty 
mp.empty()// If map Empty return 0, Otherwise return to 1
7. lookup 
mp.find()// Returns the iterator that finds the element , No return found mp.end();
8. Two points 
mp.lower_bound()// Return key value >= Given the first position of the element 
mp.upper_bound()// Return key value > Given the first position of the element 
9, size 
mp.size()// return map The number of elements in 
10. In exchange for 
swap()// Two exchanges map

string character string

string s1;
1. lookup s2
s1.find(s2);// Find return in s1 Subscripts appearing in , Subscript from 0 Start , No return found string::npos

vector The dynamic array

1. Compare the size 
 Two dynamic arrays can compare sizes , The comparison rule is similar to the comparison string dictionary order rule 

set aggregate

set<int>se;
1. Insert 
se.insert();
2. lookup 
se.count();// Found return 1, No return found 0