STL结构设计.pptVIP

容器 templateclass T class Cont { public: iterator begin(); iterator end(); reverse_iterator rbegin(); reverse_iterator rend(); size_type size() const; size_type max_size() const; bool empty() const; iterator erase(iterator it); iterator erase(iterator first, iterator last); void clear(); void swap(Cont X); }; memory templateclass T pairT *, ptrdiff_t get_temporary_buffer(ptrdiff_t n); templateclass T void return_temporary_buffer(T *p); templateclass InIt, class FwdIt FwdIt uninitialized_copy(InIt first, InIt last, FwdIt resutl); templateclass FwdIt, class T void uninitialized_fill(FwdIt first, FwdIt last, const T x); templateclass FwdIt, class Size, class T void uniniitalized_fill_n(FwdIt first, Size n, const T x); memory templateclass T class allocator { pointer address(reference x) const; templateclass U struct rebind{ typedef allocatorU other; }; templateclass U pointer allocate(size_type n, const U *hint=0); void deallocate(pointer p, size_type n); void construct(pointer p, size_type n); void destroy(pointer p); size_type max_size() const; }; vector void assign(InIt first, InIt last); reference front(); reference back(); reference at(size_type pos); reference operator[](size_type pos); size_type capacity() const; iterator insert(iterator it, const T x); void insert(iterator it, InIt first, InIt last); void push_back(const T x); void pop_back(); void reserve(size_type n); void resize(size_type n); void resize(size_type n, T x); list void assign(InIt first, InIt last); reference front(); / reference back(); iterator insert(iterator it, const T x); void insert(iterator it, size_type n, cont T x); void insert(iterator it, InIt first, InIt last); void push_front(const T x); / void pop_front(); void push_back(const T x); / void pop_back(); void merge(list x); / void merge(list x, Pred Pr); void remove(const T x); / void remove_if(Pred pr); void reverse(); void sor