Home
last modified time | relevance | path

Searched refs:insert_equal (Results 1 – 13 of 13) sorted by relevance

/external/stlport/stlport/stl/
D_hash_map.h298 { _M_ht.insert_equal(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
302 { _M_ht.insert_equal(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
307 { _M_ht.insert_equal(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
313 { _M_ht.insert_equal(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
320 { _M_ht.insert_equal(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
325 { _M_ht.insert_equal(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
328 { _M_ht.insert_equal(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
332 { _M_ht.insert_equal(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
337 { _M_ht.insert_equal(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
341 { _M_ht.insert_equal(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
[all …]
D_hash_set.h290 { _M_ht.insert_equal(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
294 { _M_ht.insert_equal(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
299 { _M_ht.insert_equal(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
306 { _M_ht.insert_equal(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
312 { _M_ht.insert_equal(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
317 { _M_ht.insert_equal(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
320 { _M_ht.insert_equal(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
324 { _M_ht.insert_equal(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
329 { _M_ht.insert_equal(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
333 { _M_ht.insert_equal(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
[all …]
D_set.h273 { _M_t.insert_equal(__first, __last); } in _STLP_CREATE_ITERATOR_TRAITS()
279 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); } in _STLP_CREATE_ITERATOR_TRAITS()
284 : _M_t(__comp, allocator_type()) { _M_t.insert_equal(__first, __last); } in _STLP_CREATE_ITERATOR_TRAITS()
289 { _M_t.insert_equal(__first, __last); } in _STLP_CREATE_ITERATOR_TRAITS()
294 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); } in _STLP_CREATE_ITERATOR_TRAITS()
298 { _M_t.insert_equal(__first, __last); } in _STLP_CREATE_ITERATOR_TRAITS()
303 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); } in _STLP_CREATE_ITERATOR_TRAITS()
340 { return _M_t.insert_equal(__x); } in _STLP_CREATE_ITERATOR_TRAITS()
342 { return _M_t.insert_equal(__pos, __x); } in _STLP_CREATE_ITERATOR_TRAITS()
347 { _M_t.insert_equal(__first, __last); } in _STLP_CREATE_ITERATOR_TRAITS()
[all …]
D_map.h301 { _M_t.insert_equal(__first, __last); } in _STLP_CREATE_ITERATOR_TRAITS()
306 : _M_t(__comp, allocator_type()) { _M_t.insert_equal(__first, __last); } in _STLP_CREATE_ITERATOR_TRAITS()
312 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); } in _STLP_CREATE_ITERATOR_TRAITS()
316 { _M_t.insert_equal(__first, __last); } in _STLP_CREATE_ITERATOR_TRAITS()
320 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); } in _STLP_CREATE_ITERATOR_TRAITS()
324 { _M_t.insert_equal(__first, __last); } in _STLP_CREATE_ITERATOR_TRAITS()
328 : _M_t(__comp, __a) { _M_t.insert_equal(__first, __last); } in _STLP_CREATE_ITERATOR_TRAITS()
366 iterator insert(const value_type& __x) { return _M_t.insert_equal(__x); } in _STLP_CREATE_ITERATOR_TRAITS()
367 iterator insert(iterator __pos, const value_type& __x) { return _M_t.insert_equal(__pos, __x); } in _STLP_CREATE_ITERATOR_TRAITS()
371 { _M_t.insert_equal(__first, __last); } in _STLP_CREATE_ITERATOR_TRAITS()
[all …]
D_hashtable.h412 iterator insert_equal(const value_type& __obj) {
429 void insert_equal(_InputIterator __f, _InputIterator __l)
430 { insert_equal(__f, __l, _STLP_ITERATOR_CATEGORY(__f, _InputIterator)); }
440 void insert_equal(_InputIterator __f, _InputIterator __l,
443 insert_equal(*__f);
456 void insert_equal(_ForwardIterator __f, _ForwardIterator __l,
472 void insert_equal(const value_type* __f, const value_type* __l) {
486 void insert_equal(const_iterator __f, const_iterator __l) {
D_unordered_set.h244 { _M_ht.insert_equal(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
251 { _M_ht.insert_equal(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
258 { _M_ht.insert_equal(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
278 { return _M_ht.insert_equal(__obj); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
280 { return _M_ht.insert_equal(__obj); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
286 { _M_ht.insert_equal(__f,__l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
289 { _M_ht.insert_equal(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
D_tree.h459 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) {
467 insert_equal(*__first);
482 void insert_equal(const_iterator __first, const_iterator __last) {
484 insert_equal(*__first);
486 void insert_equal(const value_type* __first, const value_type* __last) {
488 insert_equal(*__first);
D_unordered_map.h268 { _M_ht.insert_equal(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
275 { _M_ht.insert_equal(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
282 { _M_ht.insert_equal(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
302 { return _M_ht.insert_equal(__obj); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
304 { return _M_ht.insert_equal(__obj); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
310 { _M_ht.insert_equal(__f,__l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
313 { _M_ht.insert_equal(__f, __l); } in _STLP_CREATE_HASH_ITERATOR_TRAITS()
D_tree.c387 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_equal(const _Value& __val) { in insert_equal() function
539 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::insert_equal(iterator __position, in insert_equal() function
545 return insert_equal(__val); in insert_equal()
573 return insert_equal(__val); in insert_equal()
581 return insert_equal(__val); in insert_equal()
615 return insert_equal(__val); in insert_equal()
/external/stlport/stlport/stl/debug/
D_tree.h227 iterator insert_equal(const value_type& __x) in insert_equal() function
228 { return iterator(&_M_iter_list, _M_non_dbg_impl.insert_equal(__x)); } in insert_equal()
234 iterator insert_equal(iterator __pos, const value_type& __x) { in insert_equal() function
236 return iterator(&_M_iter_list, _M_non_dbg_impl.insert_equal(__pos._M_iterator, __x)); in insert_equal()
241 void insert_equal(_InputIterator __first, _InputIterator __last) { in insert_equal() function
243 … _M_non_dbg_impl.insert_equal(_STLP_PRIV _Non_Dbg_iter(__first), _STLP_PRIV _Non_Dbg_iter(__last)); in insert_equal()
259 void insert_equal(const_iterator __first, const_iterator __last) { in insert_equal() function
261 _M_non_dbg_impl.insert_equal(__first._M_iterator, __last._M_iterator); in insert_equal()
263 void insert_equal(const value_type* __first, const value_type* __last) { in insert_equal() function
265 _M_non_dbg_impl.insert_equal(__first, __last); in insert_equal()
D_hashtable.h214 iterator insert_equal(const value_type& __obj) in insert_equal() function
215 { return iterator(&_M_iter_list, _M_non_dbg_impl.insert_equal(__obj)); } in insert_equal()
233 void insert_equal(_InputIterator __f, _InputIterator __l){ in insert_equal() function
235 _M_non_dbg_impl.insert_equal(_STLP_PRIV _Non_Dbg_iter(__f), _STLP_PRIV _Non_Dbg_iter(__l)); in insert_equal()
244 void insert_equal(const value_type* __f, const value_type* __l) { in insert_equal() function
246 _M_non_dbg_impl.insert_equal(__f, __l); in insert_equal()
254 void insert_equal(const_iterator __f, const_iterator __l) { in insert_equal() function
256 _M_non_dbg_impl.insert_equal(__f._M_iterator, __l._M_iterator); in insert_equal()
/external/stlport/stlport/stl/pointers/
D_set.h386 …_M_t.insert_equal(_STLP_TYPENAME _STLP_PRIV _IteWrapper<_KeyStorageType, _Key, _InputIterator>::_I…
389 _M_t.insert_equal(__first, __last);
399 …_M_t.insert_equal(_STLP_TYPENAME _STLP_PRIV _IteWrapper<_KeyStorageType, _Key, _InputIterator>::_I…
402 _M_t.insert_equal(__first, __last);
412 …_M_t.insert_equal(_STLP_TYPENAME _STLP_PRIV _IteWrapper<_KeyStorageType, _Key, _InputIterator>::_I…
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 …]
/external/stlport/etc/
DChangeLog-5.17961 …* stl/_tree.h : fixed several bugs in new code for corner cases in insert_equal()/insert_unique() …