C++ std::list 函数大全

Table 6.12. Constructors and Destructor of Lists Operation  Effect 
list<Elem> c  Creates an empty list without any elements
list<Elem> c1(c2)  Creates a copy of another list of the same type (all elements are copied)
list<Elem> c(n)  Creates a list with n elements that are created by the default constructor 
list<Elem> c(n,elem)  Creates a list initialized with n copies of element elem 
list<Elem> c (beg,end)  Creates a list initialized with the elements of the range [beg,end) 
c.~list<Elem>()  Destroys all elements and frees the
memory

Table 6.13. Nonmodifying Operations of Lists Operation  Effect 
c.size()  Returns the actual number of elements
c. empty ()  Returns whether the container is empty (equivalent to size()==0, but might be faster) 
c.max_size()  Returns the maximum number of elements possible
c1 == c2  Returns whether c1 is equal to c2 
c1 != c2  Returns whether c1 is not equal to c2 (equivalent to ! (c1==c2)) 
c1 < c2  Returns whether c1 is less than c2 
c1 > c2  Returns whether c1 is greater than c2 (equivalent to c2<c1) 
c1 <= c2  Returns whether c1 is less than or equal to c2 (equivalent to ! (c2<c1) ) 
c1 >= c2  Returns whether c1 is greater than or equal to c2 (equivalent to ! (c1<c2))

Table 6.14. Assignment Operations of Lists Operation  Effect 
c1 = c2  Assigns all elements of c2 to c1 
c.assign(n,elem)  Assigns n copies of element elem 
c.assign(beg,end)  Assigns the elements of the range [beg,end) 
c1.swap(c2)  Swaps the data of c1 and c2 
swap(c1,c2)  Same (as global function)

Table 6.15. Direct Element Access of Lists Operation  Effect 
c.front()  Returns the first element (no check whether a first element exists) 
c.back()  Returns the last element (no check whether a last element exists) 

Table 6.16. Iterator Operations of Lists Operation  Effect 
c.begin()  Returns a bidirectional iterator for the first element
c.end()  Returns a bidirectional iterator for the position after the last element
c.rbegin()  Returns a reverse iterator for the first element of a reverse iteration
c.rend()  Returns a reverse iterator for the position after the last element of a reverse iteration

Table 6.17. Insert and Remove Operations of Lists Operation  Effect 
c.insert (pos, elem)  Inserts at iterator position pos a copy of elem and returns the position of the new element 
c.insert (pos,n, elem)  Inserts at iterator position pos n copies of elem (returns nothing) 
c. insert (pos, beg,end)  Inserts at iterator position pos a copy of all elements of the range [beg,end) (returns nothing) 
c.push_back(elem)  Appends a copy of elem at the end 
c.pop_back()  Removes the last element (does not return it)
c.push_front(elem)  Inserts a copy of elem at the beginning 
c.pop_front ()  Removes the first element (does not return it)
c. remove (val)  Removes all elements with value val 
c.remove_if (op)  Removes all elements for which op(elem) yields true 
c. erase (pos)  Removes the element at iterator position pos and returns the position of the next element 
c.erase (beg,end)  Removes all elements of the range [beg,end) and returns the position of the next element 
c. resize (num)  Changes the number of elements to num (if size() grows, new elements are created by their default constructor) 
c.resize (num, elem)  Changes the number of elements to num (if size ( ) grows, new elements are copies of elem) 
c. clear ()  Removes all elements (makes the container empty)

Table 6.18. Special Modifying Operations for Lists Operation  Effect 
c.unique()  Removes duplicates of consecutive elements with the same value
c.unique(op)  Removes duplicates of consecutive elements, for which op() yields true 
c1.splice(pos,c2)  Moves all elements of c2 to c1 in front of the iterator position pos 
c1.splice(pos,c2,c2pos)  Moves the element at c2pos in c2 in front of pos of list c1 (c1 and c2 may be identical) 
c1.splice(pos,c2,c2beg,c2end)  Moves all elements of the range [c2beg,c2end) in c2 in front of pos of list c1 (c1 and c2 may be identical) 
c.sort()  Sorts all elements with operator < 
c.sort(op)  Sorts all elements with op() 
c1.merge(c2)  Assuming both containers contain the elements sorted, moves all elements of c2 into c1 so that all elements are merged and still sorted 
c1.merge(c2,op)  Assuming both containers contain the elements sorted due to the sorting criterion op(), moves all elements of c2 into c1 so that all elements are merged and still sorted according to op() 
c.reverse()  Reverses the order of all elements