Searched defs:insert_equal (Results 1 - 5 of 5) sorted by relevance
/external/stlport/stlport/stl/ |
H A D | _tree.c | 26 * insert_equal with valid hint -- efficiency is improved all around, and it is 387 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_equal(const _Value& __val) { function in class:_Alloc 539 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_equal(iterator __position, function in class:_Alloc 545 return insert_equal(__val); 573 return insert_equal(__val); 581 return insert_equal(__val); 615 return insert_equal(__val);
|
H A D | _hashtable.h | 412 iterator insert_equal(const value_type& __obj) { function in class:hashtable 429 void insert_equal(_InputIterator __f, _InputIterator __l) function in class:hashtable 430 { insert_equal(__f, __l, _STLP_ITERATOR_CATEGORY(__f, _InputIterator)); } 440 void insert_equal(_InputIterator __f, _InputIterator __l, function in class:hashtable 443 insert_equal(*__f); 456 void insert_equal(_ForwardIterator __f, _ForwardIterator __l, function in class:hashtable 472 void insert_equal(const value_type* __f, const value_type* __l) { function in class:hashtable 486 void insert_equal(const_iterator __f, const_iterator __l) { function in class:hashtable
|
H A D | _tree.h | 459 iterator insert_equal(const value_type& __x); 462 iterator insert_equal(iterator __pos, const value_type& __x); 465 template<class _II> void insert_equal(_II __first, _II __last) { function in class:_Rb_tree 467 insert_equal(*__first); 482 void insert_equal(const_iterator __first, const_iterator __last) { function in class:_Rb_tree 484 insert_equal(*__first); 486 void insert_equal(const value_type* __first, const value_type* __last) { function in class:_Rb_tree 488 insert_equal(*__first);
|
/external/stlport/stlport/stl/debug/ |
H A D | _tree.h | 227 iterator insert_equal(const value_type& __x) function in class:_Rb_tree 228 { return iterator(&_M_iter_list, _M_non_dbg_impl.insert_equal(__x)); } 234 iterator insert_equal(iterator __pos, const value_type& __x) { function in class:_Rb_tree 236 return iterator(&_M_iter_list, _M_non_dbg_impl.insert_equal(__pos._M_iterator, __x)); 241 void insert_equal(_InputIterator __first, _InputIterator __last) { function in class:_Rb_tree 243 _M_non_dbg_impl.insert_equal(_STLP_PRIV _Non_Dbg_iter(__first), _STLP_PRIV _Non_Dbg_iter(__last)); 259 void insert_equal(const_iterator __first, const_iterator __last) { function in class:_Rb_tree 261 _M_non_dbg_impl.insert_equal(__first._M_iterator, __last._M_iterator); 263 void insert_equal(const value_type* __first, const value_type* __last) { function in class:_Rb_tree 265 _M_non_dbg_impl.insert_equal(__firs [all...] |
H A D | _hashtable.h | 214 iterator insert_equal(const value_type& __obj) function in class:hashtable 215 { return iterator(&_M_iter_list, _M_non_dbg_impl.insert_equal(__obj)); } 233 void insert_equal(_InputIterator __f, _InputIterator __l){ function in class:hashtable 235 _M_non_dbg_impl.insert_equal(_STLP_PRIV _Non_Dbg_iter(__f), _STLP_PRIV _Non_Dbg_iter(__l)); 244 void insert_equal(const value_type* __f, const value_type* __l) { function in class:hashtable 246 _M_non_dbg_impl.insert_equal(__f, __l); 254 void insert_equal(const_iterator __f, const_iterator __l) { function in class:hashtable 256 _M_non_dbg_impl.insert_equal(__f._M_iterator, __l._M_iterator);
|
Completed in 183 milliseconds