Home
last modified time | relevance | path

Searched refs:_M_insert (Results 1 – 15 of 15) sorted by relevance

/reactos/sdk/include/c++/stlport/stl/
H A D_tree.c398 return _M_insert(__y, __val, __x); in insert_equal()
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()
472 return _M_insert(__after._M_node, __val, __after._M_node); in insert_unique()
500 return _M_insert(__position._M_node, __val, __position._M_node); in insert_unique()
524 return _M_insert(__after._M_node, __val, __after._M_node); in insert_unique()
548 return _M_insert(__position._M_node, __val, __position._M_node); in insert_equal()
553 return _M_insert(__position._M_node, __val); in insert_equal()
570 return _M_insert(__after._M_node, __val, __after._M_node); in insert_equal()
598 return _M_insert(__position._M_node, __val, __position._M_node); in insert_equal()
[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) {
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.h197 void _M_insert(facet* __f, id& __id);
353 { __loc._M_insert(__facet, _GetFacetId(__facet)); } in _InsertFacet()
H A D_string.h613 _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()
H A D_string.c314 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()
H A D_string_workaround.h364 _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()
H A D_deque.h777 _M_insert(__pos, __first, __last, _STLP_ITERATOR_CATEGORY(__first, _InputIterator));
909 void _M_insert(iterator __pos,
917 void _M_insert(iterator __pos,
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 : in _STLP_CREATE_HASH_ITERATOR_TRAITS()
H A D_hashtable.c254 ::_M_insert(const value_type& __obj) { in _M_insert() function
H A D_tree.h376 …iterator _M_insert(_Base_ptr __parent, const value_type& __val, _Base_ptr __on_left = 0, _Base_ptr…
H A D_hash_map.h203 _M_ht._M_insert(value_type(__key, _STLP_DEFAULT_CONSTRUCTED(_Tp))).second : in _STLP_CREATE_HASH_ITERATOR_TRAITS()
/reactos/sdk/include/c++/stlport/stl/debug/
H A D_hashtable.h313 reference _M_insert(const value_type& __obj) { return _M_non_dbg_impl._M_insert(__obj); } in _M_insert() function
/reactos/sdk/lib/3rdparty/stlport/src/
H A Dlocale.cpp127 void locale::_M_insert(facet* f, locale::id& n) { in _M_insert() function in locale
/reactos/sdk/lib/3rdparty/stlport/etc/
H A DChangeLog-5.14418 * stlport/stl/_tree.c: Fix _M_insert method that was leaking in case of