http://cppreference.com/wiki/ 2010-09-09T09:17:33-07:00 http://cppreference.com/wiki/ http://cppreference.com/wiki/lib/images/favicon.ico text/html 2010-07-15T19:52:15-07:00 http://cppreference.com/wiki/stl/list/assign?rev=1279248735&do=diff assign Syntax: #include <list> void assign( size_type num, const TYPE& val ); void assign( input_iterator start, input_iterator end ); The assign() function either gives the current list the values from start to end, or gives it num copies of val. text/html 2009-07-27T23:49:46-07:00 http://cppreference.com/wiki/stl/list/back?rev=1248763786&do=diff back Syntax: #include <list> TYPE& back(); const TYPE& back() const; The back() function returns a reference to the last element in the list. For example: list<int> l; for( int i = 0; i < 5; i++ ) { l.push_back(i); } cout << "The first element is " << l.front() << " and the last element is " << l.back() << endl; text/html 2009-02-02T11:07:32-07:00 http://cppreference.com/wiki/stl/list/begin?rev=1233601652&do=diff begin Syntax: #include <list> iterator begin(); const_iterator begin() const; The function begin() returns an iterator to the first element of the list. begin() should run in constant time. For example, the following code uses begin() to initialize an iterator that is used to traverse a list: text/html 2008-10-14T15:42:06-07:00 http://cppreference.com/wiki/stl/list/clear?rev=1224024126&do=diff clear Syntax: #include <list> void clear(); The function clear() deletes all of the elements in the list. clear() runs in linear time. Related Topics: erase text/html 2009-07-24T13:27:59-07:00 http://cppreference.com/wiki/stl/list/empty?rev=1248467279&do=diff empty Syntax: #include <list> bool empty() const; The empty() function returns true if the list has no elements, false otherwise. For example, the following code uses empty() as the stopping condition on a while loop to clear a list and display its contents in reverse order: text/html 2010-06-10T17:58:10-07:00 http://cppreference.com/wiki/stl/list/end?rev=1276217890&do=diff end Syntax: #include <list> iterator end(); const_iterator end() const; The end() function returns an iterator just past the end of the list. Note that before you can access the last element of the list using an iterator that you get from a call to end(), you'll have to decrement the iterator first. text/html 2010-06-10T13:52:44-07:00 http://cppreference.com/wiki/stl/list/erase?rev=1276203164&do=diff erase Syntax: #include <list> iterator erase( iterator loc ); iterator erase( iterator start, iterator end ); The erase method either deletes the element at location loc, or deletes the elements between start and end (including start but not including end). The return value is the element after the last element erased. text/html 2008-10-14T15:42:06-07:00 http://cppreference.com/wiki/stl/list/front?rev=1224024126&do=diff front Syntax: #include <list> TYPE& front(); const TYPE& front() const; The front() function returns a reference to the first element of the list, and runs in constant time. Related Topics: back, pop_front, push_front text/html 2010-04-20T09:19:53-07:00 http://cppreference.com/wiki/stl/list/insert?rev=1271780393&do=diff insert Syntax: #include <list> iterator insert( iterator loc, const TYPE& val ); void insert( iterator loc, size_type num, const TYPE& val ); void insert( iterator loc, input_iterator start, input_iterator end ); The insert() function either: text/html 2009-10-10T07:46:41-07:00 http://cppreference.com/wiki/stl/list/list_constructors?rev=1255186001&do=diff List constructors Syntax: #include <list> list(); list( const list& c ); explicit list( size_type num, const TYPE& val = TYPE() ); list( input_iterator start, input_iterator end ); ~list(); The default list constructor takes no arguments, creates a new instance of that list. text/html 2009-10-09T04:35:45-07:00 http://cppreference.com/wiki/stl/list/list_operators?rev=1255088145&do=diff List operators Syntax: #include <list> list& operator=(const list& c2); bool operator==(const list& c1, const list& c2); bool operator!=(const list& c1, const list& c2); bool operator<(const list& c1, const list& c2); bool operator>(const list& c1, const list& c2); bool operator<=(const list& c1, const list& c2); bool operator>=(const list& c1, const list& c2); text/html 2009-07-28T02:20:49-07:00 http://cppreference.com/wiki/stl/list/max_size?rev=1248772849&do=diff max_size Syntax: #include <list> size_type max_size() const; The max_size() function returns the maximum number of elements that the list can hold. The max_size() function should not be confused with the size function, which return the number of elements currently in the list. text/html 2009-10-10T08:23:31-07:00 http://cppreference.com/wiki/stl/list/merge?rev=1255188211&do=diff merge Syntax: #include <list> void merge( list& other ); void merge( list& other, BinPred compfunction ); The function merge() merges all elements of other into *this, making other empty. The resulting list is ordered with respect to the < operator. If compfunction is specified, then it is used as the comparison function for the lists instead of <. text/html 2010-06-14T12:11:08-07:00 http://cppreference.com/wiki/stl/list/pop_back?rev=1276542668&do=diff pop_back Syntax: #include <list> void pop_back(); The pop_back method removes the last element of the list. pop_back runs in constant time. Related Topics: back, erase, pop_front, push_back text/html 2008-10-14T15:42:06-07:00 http://cppreference.com/wiki/stl/list/pop_front?rev=1224024126&do=diff pop_front Syntax: #include <list> void pop_front(); The function pop_front() removes the first element of the list. The pop_front() function runs in constant time. Related Topics: erase, front, pop_back, push_front text/html 2008-10-14T15:42:06-07:00 http://cppreference.com/wiki/stl/list/push_back?rev=1224024126&do=diff push_back Syntax: #include <list> void push_back( const TYPE& val ); The push_back() function appends val to the end of the list. For example, the following code puts 10 integers into a list: list<int> the_list; for( int i = 0; i < 10; i++ ) the_list.push_back( i ); text/html 2008-10-14T15:42:06-07:00 http://cppreference.com/wiki/stl/list/push_front?rev=1224024126&do=diff push_front Syntax: #include <list> void push_front( const TYPE& val ); The push_front() function inserts val at the beginning of list. push_front() runs in constant time. Related Topics: assign, front, insert, pop_front, push_back text/html 2009-10-10T08:25:07-07:00 http://cppreference.com/wiki/stl/list/rbegin?rev=1255188307&do=diff rbegin Syntax: #include <list> reverse_iterator rbegin(); const_reverse_iterator rbegin() const; The rbegin() function returns a reverse_iterator to the end of the current list (the position of the last element). rbegin() runs in constant time. text/html 2010-01-04T10:28:59-07:00 http://cppreference.com/wiki/stl/list/remove?rev=1262629739&do=diff remove Syntax: #include <list> void remove( const TYPE &val ); The function remove() removes all elements that are equal to val from the list. For example, the following code creates a list of the first 10 characters of the alphabet, then uses remove() to remove the letter 'E' from the list: text/html 2009-02-06T08:35:46-07:00 http://cppreference.com/wiki/stl/list/remove_if?rev=1233938146&do=diff remove_if Syntax: #include <list> void remove_if( UnPred pr ); The remove_if() function removes all elements from the list for which the unary predicate pr is true. remove_if() runs in linear time. Related Topics: erase, remove, unique text/html 2009-07-24T19:25:59-07:00 http://cppreference.com/wiki/stl/list/rend?rev=1248488759&do=diff rend Syntax: #include <list> reverse_iterator rend(); const_reverse_iterator rend() const; The function rend() returns a reverse_iterator to an element just before the first element of the current list. rend() runs in constant time. text/html 2009-10-09T05:18:59-07:00 http://cppreference.com/wiki/stl/list/resize?rev=1255090739&do=diff resize Syntax: #include <list> void resize( size_type size, TYPE val = TYPE() ); The resize method changes the size of the list to size. If val is specified then any newly-created elements will be initialized to have a value of val. This function runs in linear time. text/html 2008-10-14T15:42:06-07:00 http://cppreference.com/wiki/stl/list/reverse?rev=1224024126&do=diff reverse Syntax: #include <list> void reverse(); The function reverse() reverses the list, and takes linear time. Related Topics: sort text/html 2008-10-14T15:42:06-07:00 http://cppreference.com/wiki/stl/list/size?rev=1224024126&do=diff size Syntax: #include <list> size_type size() const; The size() function returns the number of elements in the current list. Related Topics: empty, max_size, resize text/html 2009-10-10T08:29:00-07:00 http://cppreference.com/wiki/stl/list/sort?rev=1255188540&do=diff sort Syntax: #include <list> void sort(); void sort( BinPred p ); The sort() function is used to sort lists into ascending order. Ordering is done via the < operator, unless p is specified, in which case it is used to determine if an element is less than another. text/html 2009-08-02T22:36:52-07:00 http://cppreference.com/wiki/stl/list/splice?rev=1249277812&do=diff splice Syntax: #include <list> void splice( iterator pos, list& lst ); void splice( iterator pos, list& lst, iterator del ); void splice( iterator pos, list& lst, iterator start, iterator end ); The splice function moves one or more items from lst right before location pos. The first overloading moves all items to lst, the second moves just the item at del, and the third moves all items in the range inclusive of start and exclusive of end. text/html 2010-08-07T03:12:34-07:00 http://cppreference.com/wiki/stl/list/start?rev=1281175954&do=diff Lists are sequences of elements stored in a linked list. Compared to vectors, they allow fast insertions and deletions, but no random access. Constructorscreate lists and initialize them with some dataOperatorsassign and compare listsassignassign elements to a listbackreturns a reference to last element of a listbeginreturns an iterator to the beginning of the listclearremoves all elements from the listemptytrue if the list has no elementsendreturns an iterator just past the last element of a l… text/html 2009-10-09T04:47:39-07:00 http://cppreference.com/wiki/stl/list/swap?rev=1255088859&do=diff swap Syntax: #include <list> void swap( list& from ); The swap() function exchanges the elements of the current list with those of from. This function operates in constant time. For example, the following code uses the swap() function to exchange the values of two lists: text/html 2008-10-14T15:42:06-07:00 http://cppreference.com/wiki/stl/list/unique?rev=1224024126&do=diff unique Syntax: #include <list> void unique(); void unique( BinPred pr ); The function unique() removes all consecutive duplicate elements from the list. Note that only consecutive duplicates are removed, which may require that you sort() the list first.