| /external/stlport/stlport/stl/ |
| _tree.c | 350 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::_M_insert(_Rb_tree_node_base * __parent,
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 that it can skip comparin
[all...] |
| _hashtable.c | 254 ::_M_insert(const value_type& __obj) {
|
| _string_workaround.h | 364 _M_insert(__p, __f, __l, this->_M_inside(__f));
369 void _M_insert(iterator __p, const _CharT* __f, const _CharT* __l, bool __self_ref) {
371 _Base::_M_insert(__p, __f, __l, __self_ref);
|
| _string.c | 314 void basic_string<_CharT,_Traits,_Alloc>::_M_insert(iterator __pos,
403 _M_insert(__last, __m, __l, __self_ref );
409 _M_insert(__last, __m, __l, true);
414 _M_insert(__last, __m, __l, true);
|
| _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) {
|
| _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,
[all...] |
| /ndk/sources/cxx-stl/stlport/stlport/stl/ |
| _tree.c | 350 _Rb_tree<_Key,_Compare,_Value,_KeyOfValue,_Traits,_Alloc> ::_M_insert(_Rb_tree_node_base * __parent,
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 that it can skip comparin
[all...] |
| _hashtable.c | 254 ::_M_insert(const value_type& __obj) {
|
| _string_workaround.h | 364 _M_insert(__p, __f, __l, this->_M_inside(__f));
369 void _M_insert(iterator __p, const _CharT* __f, const _CharT* __l, bool __self_ref) {
371 _Base::_M_insert(__p, __f, __l, __self_ref);
|
| _string.c | 314 void basic_string<_CharT,_Traits,_Alloc>::_M_insert(iterator __pos,
403 _M_insert(__last, __m, __l, __self_ref );
409 _M_insert(__last, __m, __l, true);
414 _M_insert(__last, __m, __l, true);
|
| _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) {
|
| _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,
[all...] |
| /external/stlport/src/ |
| locale.cpp | 127 void locale::_M_insert(facet* f, locale::id& n) {
|
| /external/stlport/stlport/stl/debug/ |
| _hashtable.h | 313 reference _M_insert(const value_type& __obj) { return _M_non_dbg_impl._M_insert(__obj); }
|
| /ndk/sources/cxx-stl/stlport/src/ |
| locale.cpp | 127 void locale::_M_insert(facet* f, locale::id& n) {
|
| /ndk/sources/cxx-stl/stlport/stlport/stl/debug/ |
| _hashtable.h | 313 reference _M_insert(const value_type& __obj) { return _M_non_dbg_impl._M_insert(__obj); }
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/bits/ |
| stl_list.h | 879 { this->_M_insert(begin(), __x); }
884 { this->_M_insert(begin(), std::move(__x)); }
889 { this->_M_insert(begin(), std::forward<_Args>(__args)...); }
920 { this->_M_insert(end(), __x); }
925 { this->_M_insert(end(), std::move(__x)); }
930 { this->_M_insert(end(), std::forward<_Args>(__args)...); }
[all...] |
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/i686-linux/include/c++/4.4.3/ext/ |
| bitmap_allocator.h | 654 _M_insert(size_t* __addr) throw()
1008 this->_M_insert(__puse_count);
|
