libstdc%2B%2B/stl/stl_slist.h

132   typedef _Slist_node<_Tp> _Node;
134   _Slist_iterator(_Node* __x) : _Slist_iterator_base(__x) {}
138   reference operator*() const { return ((_Node*) _M_node)->_M_data; }
320   typedef _Slist_node<_Tp>      _Node;
324   _Node* _M_create_node(const value_type& __x) {
325     _Node* __node = _M_get_node();
334   _Node* _M_create_node() {
335     _Node* __node = _M_get_node();
414   iterator begin() { return iterator((_Node*)_M_head._M_next); }
416     { return const_iterator((_Node*)_M_head._M_next);}
435   reference front() { return ((_Node*) _M_head._M_next)->_M_data; }
437     { return ((_Node*) _M_head._M_next)->_M_data; }
443     _Node* __node = (_Node*) _M_head._M_next;
450     return iterator((_Node*) __slist_previous(&_M_head, __pos._M_node));
453     return const_iterator((_Node*) __slist_previous(&_M_head, __pos._M_node));
457   _Node* _M_insert_after(_Node_base* __pos, const value_type& __x) {
458     return (_Node*) (__slist_make_link(__pos, _M_create_node(__x)));
461   _Node* _M_insert_after(_Node_base* __pos) {
462     return (_Node*) (__slist_make_link(__pos, _M_create_node()));
594     return iterator((_Node*) _M_erase_after(__pos._M_node));
597     return iterator((_Node*) _M_erase_after(__before_first._M_node,
602     return (_Node*) _M_erase_after(__slist_previous(&_M_head,
606     return (_Node*) _M_erase_after(
689     _Node* __n1 = (_Node*) _M_head._M_next;
690     const _Node* __n2 = (const _Node*) __x._M_head._M_next;
694       __n1 = (_Node*) __n1->_M_next;
695       __n2 = (const _Node*) __n2->_M_next;
700       _M_insert_after_range(__p1, const_iterator((_Node*)__n2),
709   _Node* __node = (_Node*) _M_head._M_next;
713     __node = (_Node*) __node->_M_next;
729   _Node* __node = (_Node*) _M_head._M_next;
733     __node = (_Node*) __node->_M_next;
748   typedef typename slist<_Tp,_Alloc>::_Node _Node;
749   _Node* __n1 = (_Node*) _SL1._M_head._M_next;
750   _Node* __n2 = (_Node*) _SL2._M_head._M_next;
752     __n1 = (_Node*) __n1->_M_next;
753     __n2 = (_Node*) __n2->_M_next;
795     if (((_Node*) __cur->_M_next)->_M_data == __val)
808       if (((_Node*)__cur)->_M_data ==
809           ((_Node*)(__cur->_M_next))->_M_data)
822     if (((_Node*) __x._M_head._M_next)->_M_data <
823         ((_Node*)       __n1->_M_next)->_M_data)
867     if (__pred(((_Node*) __cur->_M_next)->_M_data))
877   _Node* __cur = (_Node*) _M_head._M_next;
880       if (__pred(((_Node*)__cur)->_M_data,
881                  ((_Node*)(__cur->_M_next))->_M_data))
884         __cur = (_Node*) __cur->_M_next;
895     if (__comp(((_Node*) __x._M_head._M_next)->_M_data,
896                ((_Node*)       __n1->_M_next)->_M_data))