| /external/stlport/stlport/stl/debug/ |
| _slist.h | 238 iterator insert_after(iterator __pos, const value_type& __x = _Tp()) { function in class:slist
240 iterator insert_after(iterator __pos, const value_type& __x) {
244 return iterator(&_M_iter_list,_M_non_dbg_impl.insert_after(__pos._M_iterator, __x));
248 iterator insert_after(iterator __pos) { function in class:slist
249 return insert_after(__pos, _STLP_DEFAULT_CONSTRUCTED(_Tp));
253 void insert_after(iterator __pos, size_type __n, const value_type& __x) { function in class:slist
256 _M_non_dbg_impl.insert_after(__pos._M_iterator, __n, __x);
281 void insert_after(iterator __pos, _InIter __first, _InIter __last) { function in class:slist
285 _M_non_dbg_impl.insert_after(__pos._M_iterator,
298 void insert_after(iterator __pos function in class:slist
305 void insert_after(iterator __pos, function in class:slist
[all...] |
| /external/stlport/stlport/stl/pointers/ |
| _slist.h | 112 insert_after(before_begin(), __first, __last);
122 { insert_after(before_begin(), __first, __last); }
226 iterator insert_after(iterator __pos, const value_type& __x = _STLP_DEFAULT_CONSTRUCTED(value_type)) function in class:slist
228 iterator insert_after(iterator __pos, const value_type& __x)
230 { return iterator(_M_impl.insert_after(_BaseIte(__pos._M_node),
234 iterator insert_after(iterator __pos) function in class:slist
235 { return iterator(_M_impl.insert_after(_BaseIte(__pos._M_node))._M_node);}
238 void insert_after(iterator __pos, size_type __n, const value_type& __x) function in class:slist
239 { _M_impl.insert_after(_BaseIte(__pos._M_node), __n, cast_traits::to_storage_type_cref(__x)); }
247 _M_impl.insert_after(_BaseIte(__pos._M_node), __n, __val)
263 void insert_after(iterator __pos, _InputIterator __first, _InputIterator __last) { function in class:slist
274 void insert_after(iterator __pos, function in class:slist
278 void insert_after(iterator __pos, function in class:slist
[all...] |
| /external/stlport/stlport/stl/ |
| _slist.h | 408 // insert_after, erase_after, etc. Note that even for an empty
601 iterator insert_after(iterator __pos, const value_type& __x = _Tp()) { function in class:slist
603 iterator insert_after(iterator __pos, const value_type& __x) {
609 iterator insert_after(iterator __pos) { function in class:slist
610 return insert_after(__pos, _STLP_DEFAULT_CONSTRUCTED(_Tp));
614 void insert_after(iterator __pos, size_type __n, const value_type& __x) { function in class:slist
622 void insert_after(iterator __pos, _InIter __first, _InIter __last) { function in class:slist
624 void insert_after(iterator __pos,
628 void insert_after(iterator __pos,
705 this->insert_after(__pos, iterator(__before_first._M_node->_M_next), iterator(__before_last._M_node->_M_next))
[all...] |
