/external/stlport/stlport/stl/debug/ |
_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(__first, __last) [all...] |
_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);
|
/ndk/sources/cxx-stl/stlport/stlport/stl/debug/ |
_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(__first, __last) [all...] |
_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);
|
/external/stlport/stlport/stl/ |
_map.h | 301 { _M_t.insert_equal(__first, __last); } 306 : _M_t(__comp, allocator_type()) { _M_t.insert_equal(__first, __last); } 312 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); } 316 { _M_t.insert_equal(__first, __last); } 320 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); } 324 { _M_t.insert_equal(__first, __last); } 328 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); } 366 iterator insert(const value_type& __x) { return _M_t.insert_equal(__x); } 367 iterator insert(iterator __pos, const value_type& __x) { return _M_t.insert_equal(__pos, __x); } 371 { _M_t.insert_equal(__first, __last); [all...] |
_set.h | 273 { _M_t.insert_equal(__first, __last); } 279 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); } 284 : _M_t(__comp, allocator_type()) { _M_t.insert_equal(__first, __last); } 289 { _M_t.insert_equal(__first, __last); } 294 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); } 298 { _M_t.insert_equal(__first, __last); } 303 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); } 340 { return _M_t.insert_equal(__x); } 342 { return _M_t.insert_equal(__pos, __x); } 347 { _M_t.insert_equal(__first, __last); [all...] |
_hash_map.h | 298 { _M_ht.insert_equal(__f, __l); } 302 { _M_ht.insert_equal(__f, __l); } 307 { _M_ht.insert_equal(__f, __l); } 313 { _M_ht.insert_equal(__f, __l); } 320 { _M_ht.insert_equal(__f, __l); } 325 { _M_ht.insert_equal(__f, __l); } 328 { _M_ht.insert_equal(__f, __l); } 332 { _M_ht.insert_equal(__f, __l); } 337 { _M_ht.insert_equal(__f, __l); } 341 { _M_ht.insert_equal(__f, __l); [all...] |
_hash_set.h | 290 { _M_ht.insert_equal(__f, __l); } 294 { _M_ht.insert_equal(__f, __l); } 299 { _M_ht.insert_equal(__f, __l); } 306 { _M_ht.insert_equal(__f, __l); } 312 { _M_ht.insert_equal(__f, __l); } 317 { _M_ht.insert_equal(__f, __l); } 320 { _M_ht.insert_equal(__f, __l); } 324 { _M_ht.insert_equal(__f, __l); } 329 { _M_ht.insert_equal(__f, __l); } 333 { _M_ht.insert_equal(__f, __l); [all...] |
_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
|
_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);
|
_unordered_map.h | 268 { _M_ht.insert_equal(__f, __l); } 275 { _M_ht.insert_equal(__f, __l); } 282 { _M_ht.insert_equal(__f, __l); } 302 { return _M_ht.insert_equal(__obj); } 304 { return _M_ht.insert_equal(__obj); } 310 { _M_ht.insert_equal(__f,__l); } 313 { _M_ht.insert_equal(__f, __l); }
|
_unordered_set.h | 244 { _M_ht.insert_equal(__f, __l); } 251 { _M_ht.insert_equal(__f, __l); } 258 { _M_ht.insert_equal(__f, __l); } 278 { return _M_ht.insert_equal(__obj); } 280 { return _M_ht.insert_equal(__obj); } 286 { _M_ht.insert_equal(__f,__l); } 289 { _M_ht.insert_equal(__f, __l); }
|
_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);
|
/ndk/sources/cxx-stl/stlport/stlport/stl/ |
_map.h | 301 { _M_t.insert_equal(__first, __last); } 306 : _M_t(__comp, allocator_type()) { _M_t.insert_equal(__first, __last); } 312 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); } 316 { _M_t.insert_equal(__first, __last); } 320 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); } 324 { _M_t.insert_equal(__first, __last); } 328 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); } 366 iterator insert(const value_type& __x) { return _M_t.insert_equal(__x); } 367 iterator insert(iterator __pos, const value_type& __x) { return _M_t.insert_equal(__pos, __x); } 371 { _M_t.insert_equal(__first, __last); [all...] |
_set.h | 273 { _M_t.insert_equal(__first, __last); } 279 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); } 284 : _M_t(__comp, allocator_type()) { _M_t.insert_equal(__first, __last); } 289 { _M_t.insert_equal(__first, __last); } 294 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); } 298 { _M_t.insert_equal(__first, __last); } 303 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); } 340 { return _M_t.insert_equal(__x); } 342 { return _M_t.insert_equal(__pos, __x); } 347 { _M_t.insert_equal(__first, __last); [all...] |
_hash_map.h | 298 { _M_ht.insert_equal(__f, __l); } 302 { _M_ht.insert_equal(__f, __l); } 307 { _M_ht.insert_equal(__f, __l); } 313 { _M_ht.insert_equal(__f, __l); } 320 { _M_ht.insert_equal(__f, __l); } 325 { _M_ht.insert_equal(__f, __l); } 328 { _M_ht.insert_equal(__f, __l); } 332 { _M_ht.insert_equal(__f, __l); } 337 { _M_ht.insert_equal(__f, __l); } 341 { _M_ht.insert_equal(__f, __l); [all...] |
_hash_set.h | 290 { _M_ht.insert_equal(__f, __l); } 294 { _M_ht.insert_equal(__f, __l); } 299 { _M_ht.insert_equal(__f, __l); } 306 { _M_ht.insert_equal(__f, __l); } 312 { _M_ht.insert_equal(__f, __l); } 317 { _M_ht.insert_equal(__f, __l); } 320 { _M_ht.insert_equal(__f, __l); } 324 { _M_ht.insert_equal(__f, __l); } 329 { _M_ht.insert_equal(__f, __l); } 333 { _M_ht.insert_equal(__f, __l); [all...] |
_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
|
_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);
|
_unordered_map.h | 268 { _M_ht.insert_equal(__f, __l); } 275 { _M_ht.insert_equal(__f, __l); } 282 { _M_ht.insert_equal(__f, __l); } 302 { return _M_ht.insert_equal(__obj); } 304 { return _M_ht.insert_equal(__obj); } 310 { _M_ht.insert_equal(__f,__l); } 313 { _M_ht.insert_equal(__f, __l); }
|
_unordered_set.h | 244 { _M_ht.insert_equal(__f, __l); } 251 { _M_ht.insert_equal(__f, __l); } 258 { _M_ht.insert_equal(__f, __l); } 278 { return _M_ht.insert_equal(__obj); } 280 { return _M_ht.insert_equal(__obj); } 286 { _M_ht.insert_equal(__f,__l); } 289 { _M_ht.insert_equal(__f, __l); }
|
_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);
|
/external/stlport/stlport/stl/pointers/ |
_set.h | 386 _M_t.insert_equal(_STLP_TYPENAME _STLP_PRIV _IteWrapper<_KeyStorageType, _Key, _InputIterator>::_Ite(__first), 389 _M_t.insert_equal(__first, __last); 399 _M_t.insert_equal(_STLP_TYPENAME _STLP_PRIV _IteWrapper<_KeyStorageType, _Key, _InputIterator>::_Ite(__first), 402 _M_t.insert_equal(__first, __last); 412 _M_t.insert_equal(_STLP_TYPENAME _STLP_PRIV _IteWrapper<_KeyStorageType, _Key, _InputIterator>::_Ite(__first), 415 _M_t.insert_equal(__first, __last); 422 _M_t.insert_equal(cast_traits::to_storage_type_cptr(__first), 430 _M_t.insert_equal(cast_traits::to_storage_type_cptr(__first), 436 { _M_t.insert_equal(_S_to_storage_ite(__first), _S_to_storage_ite(__last)); } 442 { _M_t.insert_equal(_S_to_storage_ite(__first), _S_to_storage_ite(__last)); [all...] |
/ndk/sources/cxx-stl/stlport/stlport/stl/pointers/ |
_set.h | 386 _M_t.insert_equal(_STLP_TYPENAME _STLP_PRIV _IteWrapper<_KeyStorageType, _Key, _InputIterator>::_Ite(__first), 389 _M_t.insert_equal(__first, __last); 399 _M_t.insert_equal(_STLP_TYPENAME _STLP_PRIV _IteWrapper<_KeyStorageType, _Key, _InputIterator>::_Ite(__first), 402 _M_t.insert_equal(__first, __last); 412 _M_t.insert_equal(_STLP_TYPENAME _STLP_PRIV _IteWrapper<_KeyStorageType, _Key, _InputIterator>::_Ite(__first), 415 _M_t.insert_equal(__first, __last); 422 _M_t.insert_equal(cast_traits::to_storage_type_cptr(__first), 430 _M_t.insert_equal(cast_traits::to_storage_type_cptr(__first), 436 { _M_t.insert_equal(_S_to_storage_ite(__first), _S_to_storage_ite(__last)); } 442 { _M_t.insert_equal(_S_to_storage_ite(__first), _S_to_storage_ite(__last)); [all...] |
/prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/backward/ |
hashtable.h | 437 insert_equal(const value_type& __obj) function in class:hashtable 456 insert_equal(_InputIterator __f, _InputIterator __l) function in class:hashtable 457 { insert_equal(__f, __l, __iterator_category(__f)); } 470 insert_equal(_InputIterator __f, _InputIterator __l, function in class:hashtable 474 insert_equal(*__f); 490 insert_equal(_ForwardIterator __f, _ForwardIterator __l, function in class:hashtable [all...] |