__slist_previous
return iterator((_Node*) __slist_previous(&_M_head, __pos._M_node));
return const_iterator((_Node*) __slist_previous(&_M_head, __pos._M_node));
return iterator(_M_insert_after(__slist_previous(&_M_head, __pos._M_node),
return iterator(_M_insert_after(__slist_previous(&_M_head, __pos._M_node),
_M_insert_after_fill(__slist_previous(&_M_head, __pos._M_node), __n, __x);
_M_insert_after_range(__slist_previous(&_M_head, __pos._M_node),
_M_insert_after_range(__slist_previous(&_M_head, __pos._M_node),
_M_insert_after_range(__slist_previous(&_M_head, __pos._M_node),
return (_Node*) _M_erase_after(__slist_previous(&_M_head,
__slist_previous(&_M_head, __first._M_node), __last._M_node);
__slist_splice_after(__slist_previous(&_M_head, __pos._M_node),
&__x._M_head, __slist_previous(&__x._M_head, 0));
__slist_splice_after(__slist_previous(&_M_head, __pos._M_node),
__slist_previous(&__x._M_head, __i._M_node),
__slist_splice_after(__slist_previous(&_M_head, __pos._M_node),
__slist_previous(&__x._M_head, __first._M_node),
__slist_previous(__first._M_node, __last._M_node));