Standard C++ Library Reference ISO/IEC (VERSION3)

slist::max_size
size_type max_size() const;
The member function returns the length of the longest sequence that the object can control.
slist::merge
void merge(slist& x);
template<class Pred>
void merge(slist& x, Pred pr);
Both member functions remove all elements from the sequence controlled by x and insert them
in the controlled sequence. Both sequences must be ordered by the same predicate, described
below. The resulting sequence is also ordered by that predicate.
For the iterators Pi and Pj designating elements at positions i and j, the first member function
imposes the order !(*Pj < *Pi) whenever i < j. (The elements are sorted in ascending
order.) The second member function imposes the order !pr(*Pj, *Pi) whenever i < j.
No pairs of elements in the original controlled sequence are reversed in the resulting controlled
sequence. If a pair of elements in the resulting controlled sequence compares equal (!(*Pi <
*Pj) && !(*Pj < *Pi)), an element from the original controlled sequence appears before
an element from the sequence controlled by x.
An exception occurs only if pr throws an exception. In that case, the controlled sequence is left
in unspecified order and the exception is rethrown.
slist::pointer
typedef typename A::pointer pointer;
The type describes an object that can serve as a pointer to an element of the controlled
sequence.
slist::pop_back
void pop_back();
The member function removes the last element of the controlled sequence, which must be
non-empty. This operation takes time proportional to the number of elements in the controlled
sequence (linear time complexity).
The member function never throws an exception.