Тема 22 Основные контейнеры vector и deque：基本的主題矢量和deque 22的容器

1、 271 Vector Vector Deque Deque . , . , , . , . , : - ; - ; - . , , / . , , . , . #include using namespace std; int main(int argc, char* argv) vector v1; / int vector v2; / double vector v3; / bool vector v4; / string return EXIT_SUCCESS; vectorvector matrix; / Vector 3 Vector 3 #include using namesp

2、ace std; int main(int argc, char* argv) vector v1; / initially empty vector v2(5); / 5 elements, initialized to 0 vector v3(10, 1); / 10 elements, initialized to 1 vector v4(v3); / v4 is a copy of v3 return EXIT_SUCCESS; (constructor)(constructor) (public member function) (destructor)(destructor) (p

3、ublic member function) operator=operator= (public member function) : beginbegin (public member type) endend (public member function) rbeginrbegin (public member function) rendrend (public member function); : sizesize (public member function) max_sizemax_size (public member function) resizeresize (pu

4、blic member function) capacitycapacity (public member function) emptyempty , (public member function) reservereserve (public member function) Vector 5Vector 5 : : operatoroperator (public member function) atat (public member function) frontfront (public member function) backback (public member funct

5、ion) : assignassign (public member function) push_backpush_back (public member function) pop_backpop_back (public member function) insertinsert (public member function) eraseerase (public member function) swapswap (public member function) clearclear (public member function) : get_allocatorget_alloca

6、tor (public member function) Vector 6Vector 6 / vector v; / for (int i = 0; i 5; i+) v.push_back(i); cout Size: v.size() endl; / for (int j = 0; j 5; j+) v.pop_back(); cout Size: v.size() endl; cout endl v.empty() endl; / : vector v(12); v1 = 3; v.at(2) = 90; v.front() = v.back(); Vector 7 Vector 7

7、/ vector:iterator it; for (it = v.begin(); it != v.end(); it+) cout *it endl; / v.insert(v.begin(), 70); cout v0 endl; cout v.size() endl; / 6 vector:iterator it = v.end() - 6; v.erase(it, v.end(); cout v.size() endl; Vector 8 Vector 8 Deque double-ended queue. - . , . , , . . , . : - ; - ; - . , ,

8、. deque(); / deque deque( size_type size ); / deque size deque( size_type num, const TYPE /c num val - num val deque deque( input_iterator start, input_iterator end ); / start end deque (start) (end). assignassign Syntax: void assign( input_iterator start, input_iterator end); void assign( Size num,

9、 const TYPE . atat Syntax: reference at( size_type pos ); pos. backback Syntax: reference back(); . beginbegin Syntax: iterator begin(); . clearclear Syntax: void clear(); . emptyempty Syntax: bool empty(); true, . false. endend Syntax: iterator end(); . eraseerase Syntax: iterator erase( iterator p

10、os ); . frontfront Syntax: reference front(); . insertinsert Syntax: iterator insert( iterator pos, size_type num, const TYPE num val pos. max_sizemax_size Syntax: size_type max_size(); , . pop_backpop_back Syntax: void pop_back(); . pop_frontpop_front Syntax: void pop_front(); . push_backpush_back

11、Syntax: void push_back( const TYPE . push_frontpush_front Syntax: void push_front( const TYPE . rbeginrbegin Syntax: reverse_iterator rbegin(); . rendrend Syntax: reverse_iterator rend(); . resizeresize Syntax: void resize( size_type num, TYPE val ); num, , val. sizesize Syntax: size_type size(); .

12、swapswap Syntax: void swap( deque double. / 1 deque dq( 10, 1 ); / :iterator iter; / dq.push_back (8); / dq.push_front (9); / dq.pop_front (); / for( iter = dq.begin(); iter != dq.end(); iter+ ) cout *iter endl; / dq.clear(); Vector Deque , : 1) deque . 2) : (!) -vector . 2 ( Visual C+ 6.0). . , . ,

13、 n*K , K , , (1+sqrt(5)/2. n, , n . , , . - . -deque . . , vector . 1. deque deque insert() and erase() 0 (1) , . capacity(), back(), clear(), destroy(), value(), pop_back(). 2.dequedeque , vectorvector. , vectorvector dequedeque -capacity() and reserve(). 3. - deque vectora push_back() 4. reserve() . dequ