62 inline void __slist_splice_after(_Slist_node_base* __pos,  in __slist_splice_after()  argument
66   if (__pos != __before_first && __pos != __before_last) {  in __slist_splice_after()
68     _Slist_node_base* __after = __pos->_M_next;  in __slist_splice_after()
70     __pos->_M_next = __first;  in __slist_splice_after()
240   _Slist_node_base* _M_erase_after(_Slist_node_base* __pos)  in _M_erase_after()
242     _Slist_node<_Tp>* __next = (_Slist_node<_Tp>*) (__pos->_M_next);  in _M_erase_after()
244     __pos->_M_next = __next_next;  in _M_erase_after()
267   _Slist_node_base* _M_erase_after(_Slist_node_base* __pos)  in _M_erase_after()
269     _Slist_node<_Tp>* __next = (_Slist_node<_Tp>*) (__pos->_M_next);  in _M_erase_after()
271     __pos->_M_next = __next_next;  in _M_erase_after()
449   iterator previous(const_iterator __pos) {  in previous()  argument
450     return iterator((_Node*) __slist_previous(&_M_head, __pos._M_node));  in previous()
452   const_iterator previous(const_iterator __pos) const {  in previous()  argument
453     return const_iterator((_Node*) __slist_previous(&_M_head, __pos._M_node));  in previous()
457   _Node* _M_insert_after(_Node_base* __pos, const value_type& __x) {  in _M_insert_after()  argument
458     return (_Node*) (__slist_make_link(__pos, _M_create_node(__x)));  in _M_insert_after()
461   _Node* _M_insert_after(_Node_base* __pos) {  in _M_insert_after()  argument
462     return (_Node*) (__slist_make_link(__pos, _M_create_node()));  in _M_insert_after()
465   void _M_insert_after_fill(_Node_base* __pos,  in _M_insert_after_fill()  argument
468       __pos = __slist_make_link(__pos, _M_create_node(__x));  in _M_insert_after_fill()
475   void _M_insert_after_range(_Node_base* __pos,   in _M_insert_after_range()  argument
478     _M_insert_after_range(__pos, __first, __last, _Integral());  in _M_insert_after_range()
482   void _M_insert_after_range(_Node_base* __pos, _Integer __n, _Integer __x,  in _M_insert_after_range()  argument
484     _M_insert_after_fill(__pos, __n, __x);  in _M_insert_after_range()
488   void _M_insert_after_range(_Node_base* __pos,  in _M_insert_after_range()  argument
492       __pos = __slist_make_link(__pos, _M_create_node(*__first));  in _M_insert_after_range()
499   void _M_insert_after_range(_Node_base* __pos,  in _M_insert_after_range()  argument
502       __pos = __slist_make_link(__pos, _M_create_node(*__first));  in _M_insert_after_range()
506   void _M_insert_after_range(_Node_base* __pos,  in _M_insert_after_range()  argument
510       __pos = __slist_make_link(__pos, _M_create_node(*__first));  in _M_insert_after_range()
519   iterator insert_after(iterator __pos, const value_type& __x) {  in insert_after()  argument
520     return iterator(_M_insert_after(__pos._M_node, __x));  in insert_after()
523   iterator insert_after(iterator __pos) {  in insert_after()  argument
524     return insert_after(__pos, value_type());  in insert_after()
527   void insert_after(iterator __pos, size_type __n, const value_type& __x) {  in insert_after()  argument
528     _M_insert_after_fill(__pos._M_node, __n, __x);  in insert_after()
536   void insert_after(iterator __pos, _InIter __first, _InIter __last) {  in insert_after()  argument
537     _M_insert_after_range(__pos._M_node, __first, __last);  in insert_after()
542   void insert_after(iterator __pos,  in insert_after()  argument
544     _M_insert_after_range(__pos._M_node, __first, __last);  in insert_after()
546   void insert_after(iterator __pos,  in insert_after()  argument
548     _M_insert_after_range(__pos._M_node, __first, __last);  in insert_after()
553   iterator insert(iterator __pos, const value_type& __x) {  in insert()  argument
554     return iterator(_M_insert_after(__slist_previous(&_M_head, __pos._M_node),  in insert()
558   iterator insert(iterator __pos) {  in insert()  argument
559     return iterator(_M_insert_after(__slist_previous(&_M_head, __pos._M_node),  in insert()
563   void insert(iterator __pos, size_type __n, const value_type& __x) {  in insert()  argument
564     _M_insert_after_fill(__slist_previous(&_M_head, __pos._M_node), __n, __x);  in insert()
572   void insert(iterator __pos, _InIter __first, _InIter __last) {  in insert()  argument
573     _M_insert_after_range(__slist_previous(&_M_head, __pos._M_node),   in insert()
579   void insert(iterator __pos, const_iterator __first, const_iterator __last) {  in insert()  argument
580     _M_insert_after_range(__slist_previous(&_M_head, __pos._M_node),   in insert()
583   void insert(iterator __pos, const value_type* __first,   in insert()  argument
585     _M_insert_after_range(__slist_previous(&_M_head, __pos._M_node),   in insert()
593   iterator erase_after(iterator __pos) {  in erase_after()  argument
594     return iterator((_Node*) _M_erase_after(__pos._M_node));  in erase_after()
601   iterator erase(iterator __pos) {  in erase()  argument
603                                                     __pos._M_node));  in erase()
617   void splice_after(iterator __pos,   in splice_after()  argument
621       __slist_splice_after(__pos._M_node, __before_first._M_node,   in splice_after()
627   void splice_after(iterator __pos, iterator __prev)  in splice_after()  argument
629     __slist_splice_after(__pos._M_node,  in splice_after()
635   void splice(iterator __pos, slist& __x) {  in splice()  argument
637       __slist_splice_after(__slist_previous(&_M_head, __pos._M_node),  in splice()
642   void splice(iterator __pos, slist& __x, iterator __i) {  in splice()  argument
643     __slist_splice_after(__slist_previous(&_M_head, __pos._M_node),  in splice()
650   void splice(iterator __pos, slist& __x, iterator __first, iterator __last)  in splice()  argument
653       __slist_splice_after(__slist_previous(&_M_head, __pos._M_node),  in splice()