headers/cpp/stl_slist.h

67     _Slist_node_base* __first = __before_first->_M_next;
70     __pos->_M_next = __first;
366   slist(_InputIterator __first, _InputIterator __last,
368     { _M_insert_after_range(&_M_head, __first, __last); }
371   slist(const_iterator __first, const_iterator __last,
373     { _M_insert_after_range(&_M_head, __first, __last); }
374   slist(const value_type* __first, const value_type* __last,
376     { _M_insert_after_range(&_M_head, __first, __last); }
397   void assign(_InputIterator __first, _InputIterator __last) {
399     _M_assign_dispatch(__first, __last, _Integral());
407   void _M_assign_dispatch(_InputIterator __first, _InputIterator __last,
476                              _InIter __first, _InIter __last) {
478     _M_insert_after_range(__pos, __first, __last, _Integral());
489                              _InIter __first, _InIter __last,
491     while (__first != __last) {
492       __pos = __slist_make_link(__pos, _M_create_node(*__first));
493       ++__first;
500                              const_iterator __first, const_iterator __last) {
501     while (__first != __last) {
502       __pos = __slist_make_link(__pos, _M_create_node(*__first));
503       ++__first;
507                              const value_type* __first,
509     while (__first != __last) {
510       __pos = __slist_make_link(__pos, _M_create_node(*__first));
511       ++__first;
536   void insert_after(iterator __pos, _InIter __first, _InIter __last) {
537     _M_insert_after_range(__pos._M_node, __first, __last);
543                     const_iterator __first, const_iterator __last) {
544     _M_insert_after_range(__pos._M_node, __first, __last);
547                     const value_type* __first, const value_type* __last) {
548     _M_insert_after_range(__pos._M_node, __first, __last);
572   void insert(iterator __pos, _InIter __first, _InIter __last) {
574                           __first, __last);
579   void insert(iterator __pos, const_iterator __first, const_iterator __last) {
581                           __first, __last);
583   void insert(iterator __pos, const value_type* __first,
586                           __first, __last);
605   iterator erase(iterator __first, iterator __last) {
607       __slist_previous(&_M_head, __first._M_node), __last._M_node);
648   // Linear in distance(begin(), __pos), in distance(__x.begin(), __first),
649   // and in distance(__first, __last).
650   void splice(iterator __pos, slist& __x, iterator __first, iterator __last)
652     if (__first != __last)
654                            __slist_previous(&__x._M_head, __first._M_node),
655                            __slist_previous(__first._M_node, __last._M_node));
725 slist<_Tp, _Alloc>::_M_assign_dispatch(_InputIter __first, _InputIter __last,
730   while (__node != 0 && __first != __last) {
731     __node->_M_data = *__first;
734     ++__first;
736   if (__first != __last)
737     _M_insert_after_range(__prev, __first, __last);