headers/cpp/stl_slist.h

111   _Slist_iterator_base(_Slist_node_base* __x) : _M_node(__x) {}
114   bool operator==(const _Slist_iterator_base& __x) const {
115     return _M_node == __x._M_node;
117   bool operator!=(const _Slist_iterator_base& __x) const {
118     return _M_node != __x._M_node;
134   _Slist_iterator(_Node* __x) : _Slist_iterator_base(__x) {}
136   _Slist_iterator(const iterator& __x) : _Slist_iterator_base(__x._M_node) {}
324   _Node* _M_create_node(const value_type& __x) {
327       construct(&__node->_M_data, __x);
355   slist(size_type __n, const value_type& __x,
357     { _M_insert_after_fill(&_M_head, __n, __x); }
379   slist(const slist& __x) : _Base(__x.get_allocator())
380     { _M_insert_after_range(&_M_head, __x.begin(), __x.end()); }
382   slist& operator= (const slist& __x);
427   void swap(slist& __x) { __STD::swap(_M_head._M_next, __x._M_head._M_next); }
438   void push_front(const value_type& __x)   {
439     __slist_make_link(&_M_head, _M_create_node(__x));
457   _Node* _M_insert_after(_Node_base* __pos, const value_type& __x) {
458     return (_Node*) (__slist_make_link(__pos, _M_create_node(__x)));
466                             size_type __n, const value_type& __x) {
468       __pos = __slist_make_link(__pos, _M_create_node(__x));
482   void _M_insert_after_range(_Node_base* __pos, _Integer __n, _Integer __x,
484     _M_insert_after_fill(__pos, __n, __x);
519   iterator insert_after(iterator __pos, const value_type& __x) {
520     return iterator(_M_insert_after(__pos._M_node, __x));
527   void insert_after(iterator __pos, size_type __n, const value_type& __x) {
528     _M_insert_after_fill(__pos._M_node, __n, __x);
553   iterator insert(iterator __pos, const value_type& __x) {
555                     __x));
563   void insert(iterator __pos, size_type __n, const value_type& __x) {
564     _M_insert_after_fill(__slist_previous(&_M_head, __pos._M_node), __n, __x);
610   void resize(size_type new_size, const _Tp& __x);
634   // Linear in distance(begin(), __pos), and linear in __x.size().
635   void splice(iterator __pos, slist& __x) {
636     if (__x._M_head._M_next)
638                            &__x._M_head, __slist_previous(&__x._M_head, 0));
641   // Linear in distance(begin(), __pos), and in distance(__x.begin(), __i).
642   void splice(iterator __pos, slist& __x, iterator __i) {
644                          __slist_previous(&__x._M_head, __i._M_node),
648   // Linear in distance(begin(), __pos), in distance(__x.begin(), __first),
650   void splice(iterator __pos, slist& __x, iterator __first, iterator __last)
654                            __slist_previous(&__x._M_head, __first._M_node),
666   void merge(slist& __x);
685 slist<_Tp,_Alloc>& slist<_Tp,_Alloc>::operator=(const slist<_Tp,_Alloc>& __x)
687   if (&__x != this) {
690     const _Node* __n2 = (const _Node*) __x._M_head._M_next;
769 inline void swap(slist<_Tp,_Alloc>& __x, slist<_Tp,_Alloc>& __y) {
770   __x.swap(__y);
777 void slist<_Tp,_Alloc>::resize(size_type __len, const _Tp& __x)
787     _M_insert_after_fill(__cur, __len, __x);
818 void slist<_Tp,_Alloc>::merge(slist<_Tp,_Alloc>& __x)
821   while (__n1->_M_next && __x._M_head._M_next) {
822     if (((_Node*) __x._M_head._M_next)->_M_data <
824       __slist_splice_after(__n1, &__x._M_head, __x._M_head._M_next);
827   if (__x._M_head._M_next) {
828     __n1->_M_next = __x._M_head._M_next;
829     __x._M_head._M_next = 0;
890 void slist<_Tp,_Alloc>::merge(slist<_Tp,_Alloc>& __x,
894   while (__n1->_M_next && __x._M_head._M_next) {
895     if (__comp(((_Node*) __x._M_head._M_next)->_M_data,
897       __slist_splice_after(__n1, &__x._M_head, __x._M_head._M_next);
900   if (__x._M_head._M_next) {
901     __n1->_M_next = __x._M_head._M_next;
902     __x._M_head._M_next = 0;