Searched refs:_M_insert (Results 1 - 14 of 14) sorted by relevance

/external/stlport/stlport/stl/
H A D_tree.c350 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::_M_insert(_Rb_tree_node_base * __parent, function in class:_Alloc
398 return _M_insert(__y, __val, __x);
417 return pair<iterator,bool>(_M_insert(__y, __val, /* __x*/ __y), true);
422 return pair<iterator,bool>(_M_insert(__y, __val, __x), true);
441 return _M_insert(__position._M_node, __val, __position._M_node);
460 // performed and we know the result; skip repeating it in _M_insert
462 return _M_insert(__position._M_node, __val, 0, __position._M_node);
470 return _M_insert(__position._M_node, __val, 0, __position._M_node);
472 return _M_insert(__after._M_node, __val, __after._M_node);
481 // pass along to _M_insert tha
[all...]
H A D_list.h327 { _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) { function in class:list
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) {
H A D_locale.h199 void _M_insert(facet* __f, id& __id);
355 { __loc._M_insert(__facet, _GetFacetId(__facet)); }
H A D_string.c314 void basic_string<_CharT,_Traits,_Alloc>::_M_insert(iterator __pos, function in class:_Alloc
403 _M_insert(__last, __m, __l, __self_ref );
409 _M_insert(__last, __m, __l, true);
414 _M_insert(__last, __m, __l, true);
H A D_string.h613 _M_insert(begin() + __pos, __s._M_Start(), __s._M_Finish(), &__s == this);
624 _M_insert(begin() + __pos,
634 _M_insert(begin() + __pos, __s, __s + __n, _M_inside(__s));
645 _M_insert(this->_M_Start() + __pos, __s, __s + __len, _M_inside(__s));
671 void _M_insert(iterator __p, const _CharT* __first, const _CharT* __last, bool __self_ref);
783 _M_insert(__p, __f, __l, _M_inside(__f));
H A D_string_workaround.h364 _M_insert(__p, __f, __l, this->_M_inside(__f));
369 void _M_insert(iterator __p, const _CharT* __f, const _CharT* __l, bool __self_ref) { function in class:basic_string
371 _Base::_M_insert(__p, __f, __l, __self_ref);
H A D_deque.h777 _M_insert(__pos, __first, __last, _STLP_ITERATOR_CATEGORY(__first, _InputIterator));
909 void _M_insert(iterator __pos, function in class:deque
917 void _M_insert(iterator __pos, function in class:deque
H A D_hashtable.h585 reference _M_insert(const value_type& __obj);
H A D_unordered_map.h156 _M_ht._M_insert(value_type(__key, _STLP_DEFAULT_CONSTRUCTED(_Tp))).second :
H A D_hash_map.h203 _M_ht._M_insert(value_type(__key, _STLP_DEFAULT_CONSTRUCTED(_Tp))).second :
H A D_hashtable.c254 ::_M_insert(const value_type& __obj) { function in class:_All
H A D_tree.h376 iterator _M_insert(_Base_ptr __parent, const value_type& __val, _Base_ptr __on_left = 0, _Base_ptr __on_right = 0);
/external/stlport/stlport/stl/debug/
H A D_hashtable.h313 reference _M_insert(const value_type& __obj) { return _M_non_dbg_impl._M_insert(__obj); } function in class:hashtable
/external/stlport/src/
H A Dlocale.cpp128 void locale::_M_insert(facet* f, locale::id& n) { function in class:locale

Completed in 106 milliseconds