| /external/stlport/stlport/stl/ |
| H A D | _tree.c | 25 * Modified CRP 7/10/00 for improved conformance / efficiency on insert_unique /
405 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(const _Value& __val) { function in class:_Alloc
432 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_unique(iterator __position, function in class:_Alloc
436 // if the container is empty, fall back on insert_unique.
438 return insert_unique(__val).first;
475 return insert_unique(__val).first;
486 return insert_unique(__val).first;
530 return insert_unique(__val).first;
552 // Unlike insert_unique, can't avoid doing a comparison here.
|
| H A D | _hashtable.h | 407 pair<iterator, bool> insert_unique(const value_type& __obj) { function in class:hashtable
425 void insert_unique(_InputIterator __f, _InputIterator __l) function in class:hashtable
426 { insert_unique(__f, __l, _STLP_ITERATOR_CATEGORY(__f, _InputIterator)); }
433 void insert_unique(_InputIterator __f, _InputIterator __l, function in class:hashtable
436 insert_unique(*__f);
447 void insert_unique(_ForwardIterator __f, _ForwardIterator __l, function in class:hashtable
465 void insert_unique(const value_type* __f, const value_type* __l) { function in class:hashtable
479 void insert_unique(const_iterator __f, const_iterator __l) { function in class:hashtable
|
| H A D | _tree.h | 458 pair<iterator,bool> insert_unique(const value_type& __x);
461 iterator insert_unique(iterator __pos, const value_type& __x);
469 template<class _II> void insert_unique(_II __first, _II __last) { function in class:_Rb_tree
471 insert_unique(*__first);
474 void insert_unique(const_iterator __first, const_iterator __last) { function in class:_Rb_tree
476 insert_unique(*__first);
478 void insert_unique(const value_type* __first, const value_type* __last) { function in class:_Rb_tree
480 insert_unique(*__first);
|
| /external/stlport/stlport/stl/debug/ |
| H A D | _tree.h | 223 pair<iterator,bool> insert_unique(const value_type& __x) { function in class:_Rb_tree
224 _STLP_STD::pair<_Base_iterator, bool> __res = _M_non_dbg_impl.insert_unique(__x);
230 iterator insert_unique(iterator __pos, const value_type& __x) { function in class:_Rb_tree
232 return iterator(&_M_iter_list, _M_non_dbg_impl.insert_unique(__pos._M_iterator, __x));
246 void insert_unique(_InputIterator __first, _InputIterator __last) { function in class:_Rb_tree
248 _M_non_dbg_impl.insert_unique(_STLP_PRIV _Non_Dbg_iter(__first), _STLP_PRIV _Non_Dbg_iter(__last));
251 void insert_unique(const_iterator __first, const_iterator __last) { function in class:_Rb_tree
253 _M_non_dbg_impl.insert_unique(__first._M_iterator, __last._M_iterator);
255 void insert_unique(const value_type* __first, const value_type* __last) { function in class:_Rb_tree
257 _M_non_dbg_impl.insert_unique(__firs
[all...] |
| H A D | _hashtable.h | 209 pair<iterator, bool> insert_unique(const value_type& __obj) { function in class:hashtable
210 pair<_Base_iterator, bool> __res = _M_non_dbg_impl.insert_unique(__obj);
227 void insert_unique(_InputIterator __f, _InputIterator __l) { function in class:hashtable
229 _M_non_dbg_impl.insert_unique(_STLP_PRIV _Non_Dbg_iter(__f), _STLP_PRIV _Non_Dbg_iter(__l));
239 void insert_unique(const value_type* __f, const value_type* __l) { function in class:hashtable
241 _M_non_dbg_impl.insert_unique(__f, __l);
249 void insert_unique(const_iterator __f, const_iterator __l) { function in class:hashtable
251 _M_non_dbg_impl.insert_unique(__f._M_iterator, __l._M_iterator);
|