c++编程之标准库和STL

 1#include <iostream>
 2#include <cstdlib>
 3#include <ctime>
 4#include <vector>
 5
 6using namespace std;
 7
 8
 9void print(const vector<int> &v) {
10	for (int i = 0; i < v.size(); ++i) {
11		cout << v[i] << " ";
12	}
13	cout << endl;
14}
15
16int main(int argc, char *argv[]) {
17	const int SIZE = 10;
18	vector<int> numbers(SIZE);
19
20	cout << "size = " << numbers.size() << endl;
21	cout << "capacity = " << numbers.capacity() << endl;
22	print(numbers);
23
24	srand(time(0));
25
26	for (size_t i = 0; i < numbers.size(); ++i) {
27		numbers.at(i) = rand() % 100;
28	}
29
30	print(numbers);
31
32	// no error compile and run
33	cout << "First element is " << numbers.front() << endl;
34	// runtime out_of_range exception
35	cout << "Last element is " << numbers.back() << endl;
36
37	cout << numbers[55] << endl;
38	// cout << numbers.at(55) << endl;
39
40	return 0;
41}

 1#include <iostream>
 2#include <cstdlib>
 3#include <ctime>
 4#include <vector>
 5
 6using namespace std;
 7
 8void print(const vector<int> &v) {
 9	for (int i = 0; i < v.size(); ++i) {
10		cout << v[i] << " ";
11	}
12	cout << endl;
13}
14
15int main(int argc, char *argv[]) {
16	vector<int> numbers;
17	cout << "size = " << numbers.size() << endl;
18	cout << "capacity = " << numbers.capacity() << endl;
19
20	srand(time(0));
21	for (int i = 0; i < 5; ++i) {
22		numbers.push_back(rand() % 100);
23	}
24	print(numbers);
25	cout << "size = " << numbers.size() << endl;
26	cout << "capacity = " << numbers.capacity() << endl;
27
28	numbers.pop_back();
29	numbers.pop_back();
30	print(numbers);
31	cout << "size = " << numbers.size() << endl;
32	cout << "capacity = " << numbers.capacity() << endl;
33	numbers.clear();
34	cout << "size = " << numbers.size() << endl;
35	cout << "capacity = " << numbers.capacity() << endl;
36	return 0;
37}

 1#include <iostream>
 2#include <string>
 3#include <cstdlib>
 4#include <vector>
 5
 6using namespace std;
 7
 8void print(vector<string> &v) {
 9	for (vector<string>::iterator iter = v.begin(); iter != v.end(); ++iter) {
10		cout << *iter << " ";
11	}
12	cout << endl;
13}
14
15int main(int argc, char *argv[]) {
16	vector<string> strs;
17	strs.push_back("apple");
18	strs.push_back("orange");
19	strs.push_back("banana");
20	print(strs);
21	cout << "size = " << strs.size() << endl;
22
23	// Test insert()
24	strs.insert(strs.begin() + 2, "b4-banana");
25	strs.insert(strs.begin() + 1, 2, "b4-orange");
26	print(strs);
27
28	// Test arase()
29	strs.erase(strs.begin() + 1, strs.begin() + 4);
30	print(strs);
31	cout << "size + " << strs.size() << endl;
32
33	// insert() from another vector
34	vector<string> newStrs;
35	newStrs.push_back("1");
36	newStrs.push_back("2");
37	newStrs.push_back("3");
38	strs.insert(strs.begin() + 1, newStrs.begin(), newStrs.end());
39	print(strs);
40	cout << "size = " << strs.size() << endl;
41	return 0;
42}

1for (auto iter = strs.begin(); iter != strs.end(); ++iter) {
2	cout << *iter << " ";
3}

1for (auto item:strs) {
2	cout << item << " ";
3}

 1vector (const allocator_type & alloc = allocator_type());
 2   // Default Constructor: construct a vector object
 3vector (size_type n, const value_type & val = value_type(),
 4        const allocator_type & alloc = allocator_type());
 5   // Fill Constructor: construct a vector object with n-element filled with val
 6vector (const vector & v);
 7   // Copy Constructor
 8template <class InputIterator>
 9vector (InputIterator first, InputIterator last,
10        const allocator_type & alloc = allocator_type());
11   // Range Copy Constructor

1size_type size () const;      // Return the size (number of elements)
2size_type capacity () const;  // Return the storage allocated (in term of element)
3bool empty () const;          // Return true if size is 0
4void reserve (size_type n);   // Request for storage to hold n elements
5void resize (size_type n, value_type val = value_type());
6      // resize to n, remove extra element or fill with val
7size_type max_size () const;  // Return the maximum number of element
8void shrink_to_fit ();        // (C++11) Request to shrink storage

1value_type & operator[] (size_type n);  // [n] operator (without index-bound check)
2value_type & at (size_type n);          // Return a reference to n-th element with index-bound check
3value_type & front ();    // Return a reference to the first element
4value_type & back ();     // Return a reference to the last element

1void push_back (const value_type & val); // Append val at the end
2void pop_back ();                        // Remove the last element
3void clear ();                           // Remove all elements

 1==, !=, <, >, <=, >=    // Comparison Operators
 2// E.g.
 3template <class T, class Alloc>
 4bool operator== (const vector<T,Alloc> & left, const vector<T, Alloc> & right);
 5   // Compare two vectors
 6   // For == and !=, first compare the size, then each element with equal algorithm.
 7   //   Stop at the first mismatch.
 8   // For <, >, <=, >=, use lexicographical_compare algorithm. Stop at first mismatch.
 9
10template <class T, class Alloc>
11void swap (vector<T,Alloc> & v1, vector<T,Alloc> v2);
12   // Swap the contents of containers v1 and v2.
13   // Both shall has the same type, but can have different sizes.

1iterator begin();  // Return an iterator pointing to the first element
2iterator end();    // Return an iterator pointing to the pass-the-end element
3
4reverse_iterator rbegin(); // Return a reverse iterator pointing to the reverse beginning (last element)
5                           // increasing a reverse iterator to transverse in reverse order
6reverse_iterator rend();   // Return a reverse iterator pointing to the reverse past-the-end

 1iterator insert (iterator pos, const value_type & val);  // Single-Element: insert element val before iterator pos
 2void     insert (iterator pos, size_type n, const value_type & val);  // Fill: insert n copies of val before pos
 3template <class InputIterator>
 4void     insert (iterator pos, InputIterator first, InputIterator last)
 5    // Range-copy: copy the range [first, last) and insert before pos.
 6
 7iterator erase (iterator pos);  // Single-element: remove element pointed to by iterator pos
 8iterator erase (iterator first, iterator last);  // Range: remove elements between [first,last)
 9
10void assign (size_type n, const value_type & val);  // Fill: clear old contents and assign n copies of val
11template <class InputIterator>
12void assign (InputIterator first, InputIterator last);  // Range: assign [first, last)