自己找找看吧(红色字体表示对前面函数的支持)
size_type container::capacity() constvector,string
void constainer::reserve(size_type num) vector,string
bool comparison(const container& c1,const container& c2)vector,deque,list,set,multiset,map,multimap,string
size_type container::count(const T& value) constset,multiset,map,multimap
iterator container::find(const T& value)
const_iterator container::find(const T& value) constset,multiset,map,multimap
iterator container::lower_bound(const T& value)
const_iterator container::lower_boudn(const T& value) constset,multiset,map,multimap
iterator container::upper_bound(const T& value)
const_iterator container::upper_boudn(const T& value) constset,multiset,map,multimap
pair<iterator,iterator> container::equal_range(const T& value)
pair<const_iterator,const_iterator>container::equal_range(const T& value) constset,multiset,map,multimap
key_compare container::key_comp() set,multiset,map,multimap
value_compare container::value_comp() set,multiset,map,multimap
container& container::operator=(const container& c)vector,deque,list,set,multiset,map,multimap
void container::assign(size_type num,const T& value) set,multiset,map,multimap
void container::assign(InputIteartor beg,InputIterator end)vector,deque,list,string
void container::swap(container& c) vector,deque,list,set,multiset,map,multimap,string
void swap(container& c1,container& c2)
元素存取专属
reference container::at(size_type idx)
const_reference container::at(size_type idx) constvector,deque,string
reference container::operator[](size_type idx)
const_reference container::operator[](size_type idx) constvector,deque,string
T& map::operator[](const key_type& key)map
reference container::front()
const_reference container::front() constvector,deque,list
reference container::back()
const_reference container::back() const vector,deque,list
返回迭代器专属
iterator container::begin()
const_iterator container::begin() constvector,deque,list,set,multiset,map,multimap,string
iterator container::end()
const_iterator container::end() constvector,deque,list,set,multiset,map,multimap,string
reverse_iterator container::rbegin();
const_reverse_iterator container::rbegin() constvector,deque,list,set,multiset,map,multimap,string
reverse_iterator container::rend();
const_reverse_iterator container::rend() constvector,deque,list,set,multiset,map,multimap,string
插入删除专属
iterator container::insert(const T& value)multiset,multimap
pair<iterator,bool>container::insert(const T& value)set,map
iterator container::insert(iterator pos,const T& value)vector,deque,ist,set,multiset,map,multimap,string
void container::insert(iterator pos,size_type num,const T& value)vector,deque,list,string
void container::insert(InputIterator beg,InputIterator end)set,multiset,map,multimap,string
void container::insert(iterator posInputIterator beg,InputIterator end)vector,deque,list,string
void container::push_front(const T& value)deque,list
void container::push_back(const T& value)vector,deque,list,string
void list::remove(const T& value)
void list::remove_if(UnaryPredicate op)
size_type container::erase(const T& value)set,multiset,map,multimap
void container::erase(iterator pos) set,multiset,map,multimap
iterator container::erase(iterator pos)vector,deque,list,string
void container::erase(iterator beg,iterator end)set,multiset,map,multimap
iteratorcontainer::erase(iterator beg,iterator end)vector,deque,list,string
void container::pop_front() deque,list
void container::pop_back() vector,deque,list
void container::resize(size_type num)
void container::resize(size_type num,T value)vector,deque,list,string
void container::clear() vector,deque,list,set,multiset,map,multimap,string
list专属
void list::unique()
void list::unique(BinaryPredicate op)
void list::splice(iterator pos,list& source)
void list::splice(iterator pos,list& source,iterator sourcepos)
void list::splice(iterator pos,list& source,iterator sourceBeg,iterator sourceEnd)
void list::sort();
void list::sort(CmpFunc op)
void list::merge(list& source)
void list::merge(list& source,CompFunc op)
void list::reverse()
送两张有价值的图片:
从STL标准程序库截取: