| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| D | _tree.c | 350 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::_M_insert(_Rb_tree_node_base * __parent, in _M_insert() function
398 return _M_insert(__y, __val, __x); in insert_equal()
417 return pair<iterator,bool>(_M_insert(__y, __val, /* __x*/ __y), true); in insert_unique()
422 return pair<iterator,bool>(_M_insert(__y, __val, __x), true); in insert_unique()
441 return _M_insert(__position._M_node, __val, __position._M_node); in insert_unique()
462 return _M_insert(__position._M_node, __val, 0, __position._M_node); in insert_unique()
470 return _M_insert(__position._M_node, __val, 0, __position._M_node); in insert_unique()
472 return _M_insert(__after._M_node, __val, __after._M_node); in insert_unique()
483 …return _M_insert(_M_rightmost(), __val, 0, __position._M_node); // Last argument only needs to be … in insert_unique()
498 …return _M_insert(__before._M_node, __val, 0, __before._M_node); // Last argument only needs to be … in insert_unique()
[all …]
|
| D | _list.h | 327 { _M_insert(begin(), __first, __last); }
333 { _M_insert(begin(), __first, __last); }
339 { _M_insert(begin(), __first, __last); }
343 { _M_insert(begin(), __first, __last); }
356 { _M_insert(begin(), __x.begin(), __x.end()); }
438 void _M_insert(iterator __pos, _InputIterator __first, _InputIterator __last) {
454 void _M_insert(iterator __pos, const value_type* __first, const value_type* __last) {
458 void _M_insert(iterator __pos, const_iterator __first, const_iterator __last) {
|
| D | _locale.h | 199 void _M_insert(facet* __f, id& __id);
355 { __loc._M_insert(__facet, _GetFacetId(__facet)); } in _InsertFacet()
|
| D | _string.c | 314 void basic_string<_CharT,_Traits,_Alloc>::_M_insert(iterator __pos, in _M_insert() function
403 _M_insert(__last, __m, __l, __self_ref ); in _M_replace()
409 _M_insert(__last, __m, __l, true); in _M_replace()
414 _M_insert(__last, __m, __l, true); in _M_replace()
|
| D | _string.h | 613 _M_insert(begin() + __pos, __s._M_Start(), __s._M_Finish(), &__s == this); in insert()
624 _M_insert(begin() + __pos, in insert()
634 _M_insert(begin() + __pos, __s, __s + __n, _M_inside(__s)); in insert()
645 _M_insert(this->_M_Start() + __pos, __s, __s + __len, _M_inside(__s)); in insert()
671 void _M_insert(iterator __p, const _CharT* __first, const _CharT* __last, bool __self_ref);
783 _M_insert(__p, __f, __l, _M_inside(__f)); in insert()
|
| D | _string_workaround.h | 364 _M_insert(__p, __f, __l, this->_M_inside(__f)); in insert()
369 void _M_insert(iterator __p, const _CharT* __f, const _CharT* __l, bool __self_ref) { in _M_insert() function
371 _Base::_M_insert(__p, __f, __l, __self_ref); in _M_insert()
|
| D | _deque.h | 777 _M_insert(__pos, __first, __last, _STLP_ITERATOR_CATEGORY(__first, _InputIterator));
909 void _M_insert(iterator __pos,
917 void _M_insert(iterator __pos,
|
| D | _unordered_map.h | 156 _M_ht._M_insert(value_type(__key, _STLP_DEFAULT_CONSTRUCTED(_Tp))).second : in _STLP_CREATE_HASH_ITERATOR_TRAITS()
|
| D | _hashtable.h | 585 reference _M_insert(const value_type& __obj);
|
| D | _hashtable.c | 254 ::_M_insert(const value_type& __obj) { in _M_insert() function
|
| D | _tree.h | 376 …iterator _M_insert(_Base_ptr __parent, const value_type& __val, _Base_ptr __on_left = 0, _Base_ptr…
|
| D | _hash_map.h | 203 _M_ht._M_insert(value_type(__key, _STLP_DEFAULT_CONSTRUCTED(_Tp))).second : in _STLP_CREATE_HASH_ITERATOR_TRAITS()
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/debug/ |
| D | _hashtable.h | 313 reference _M_insert(const value_type& __obj) { return _M_non_dbg_impl._M_insert(__obj); } in _M_insert() function
|
| /ndk/sources/cxx-stl/stlport/src/ |
| D | locale.cpp | 128 void locale::_M_insert(facet* f, locale::id& n) { in _M_insert() function in locale
|