std__list.3

Free C++ Standard Library

.TH std::list 3 "13 Sep 1999" "FREE_C++_STANDARD_LIBRARY" \" -*- nroff -*-
.ad l
.nh
.SH NAME
std::list \- 
.SH SYNOPSIS
.br
.PP
.SS Public Members

.in +1c
.ti -1c
.RI "typedef Allocator::reference \fBreference\fR"
.br
.ti -1c
.RI "typedef Allocator::const_reference \fBconst_reference\fR"
.br
.ti -1c
.RI "typedef implementation defined \fBiterator\fR"
.br
.ti -1c
.RI "typedef implementation defined \fBconst_iterator\fR"
.br
.ti -1c
.RI "typedef Allocator::size_type \fBsize_type\fR"
.br
.ti -1c
.RI "typedef Allocator::difference_type \fBdifference_type\fR"
.br
.ti -1c
.RI "typedef T \fBvalue_type\fR"
.br
.ti -1c
.RI "typedef Allocator \fBallocator_type\fR"
.br
.ti -1c
.RI "typedef Allocator::pointer \fBpointer\fR"
.br
.ti -1c
.RI "typedef Allocator::const_pointer \fBconst_pointer\fR"
.br
.ti -1c
.RI "typedef std::reverse_iterator<iterator> \fBreverse_iterator\fR"
.br
.ti -1c
.RI "typedef std::reverse_iterator<const_iterator> \fBconst_reverse_iterator\fR"
.br
.ti -1c
.RI "explicit \fBlist\fR (const Allocator& = Allocator())"
.br
.ti -1c
.RI "explicit \fBlist\fR (\fBsize_type\fR n, const T& value = T(), const Allocator& = Allocator())"
.br
.ti -1c
.RI "template<class InputIterator> \fBlist\fR<InputIterator> (InputIterator first, InputIterator last, const Allocator& = Allocator())"
.br
.ti -1c
.RI "\fBlist\fR (const list<T,Allocator> &x)"
.br
.ti -1c
.RI "\fB~list\fR ()"
.br
.ti -1c
.RI "list<T,Allocator>& \fBoperator=\fR (const list<T,Allocator> &x)"
.br
.ti -1c
.RI "template<class InputIterator> void \fBassign\fR<InputIterator> (InputIterator first, InputIterator last)"
.br
.ti -1c
.RI "template<class Size, class T> void \fBassign\fR<Size, T> (Size n, const T& t = T())"
.br
.ti -1c
.RI "\fBallocator_type\fR \fBget_allocator\fR () const"
.br
.ti -1c
.RI "\fBiterator\fR \fBbegin\fR ()"
.br
.ti -1c
.RI "\fBconst_iterator\fR \fBbegin\fR () const"
.br
.ti -1c
.RI "\fBiterator\fR \fBend\fR ()"
.br
.ti -1c
.RI "\fBconst_iterator\fR \fBend\fR () const"
.br
.ti -1c
.RI "\fBreverse_iterator\fR \fBrbegin\fR ()"
.br
.ti -1c
.RI "\fBconst_reverse_iterator\fR \fBrbegin\fR () const"
.br
.ti -1c
.RI "\fBreverse_iterator\fR \fBrend\fR ()"
.br
.ti -1c
.RI "\fBconst_reverse_iterator\fR \fBrend\fR () const"
.br
.ti -1c
.RI "bool \fBempty\fR () const"
.br
.ti -1c
.RI "\fBsize_type\fR \fBsize\fR () const"
.br
.ti -1c
.RI "\fBsize_type\fR \fBmax_size\fR () const"
.br
.ti -1c
.RI "void \fBresize\fR (\fBsize_type\fR sz, T c = T())"
.br
.ti -1c
.RI "\fBreference\fR \fBfront\fR ()"
.br
.ti -1c
.RI "\fBconst_reference\fR \fBfront\fR () const"
.br
.ti -1c
.RI "\fBreference\fR \fBback\fR ()"
.br
.ti -1c
.RI "\fBconst_reference\fR \fBback\fR () const"
.br
.ti -1c
.RI "void \fBpush_front\fR (const T& x)"
.br
.ti -1c
.RI "void \fBpop_front\fR ()"
.br
.ti -1c
.RI "void \fBpush_back\fR (const T& x)"
.br
.ti -1c
.RI "void \fBpop_back\fR ()"
.br
.ti -1c
.RI "\fBiterator\fR \fBinsert\fR (\fBiterator\fR position, const T& x = T())"
.br
.ti -1c
.RI "void \fBinsert\fR (\fBiterator\fR position, \fBsize_type\fR n, const T& x)"
.br
.ti -1c
.RI "template<class InputIterator> void \fBinsert\fR<InputIterator> (\fBiterator\fR position, InputIterator first, InputIterator last)"
.br
.ti -1c
.RI "\fBiterator\fR \fBerase\fR (\fBiterator\fR position)"
.br
.ti -1c
.RI "\fBiterator\fR \fBerase\fR (\fBiterator\fR position, \fBiterator\fR last)"
.br
.ti -1c
.RI "void \fBswap\fR (list<T,Allocator>&)"
.br
.ti -1c
.RI "void \fBclear\fR ()"
.br
.ti -1c
.RI "void \fBsplice\fR (\fBiterator\fR position, list<T,Allocator>& x)"
.br
.ti -1c
.RI "void \fBsplice\fR (\fBiterator\fR position, list<T,Allocator>& x, \fBiterator\fR i)"
.br
.ti -1c
.RI "void \fBsplice\fR (\fBiterator\fR position, list<T,Allocator>& x, \fBiterator\fR first, \fBiterator\fR last)"
.br
.ti -1c
.RI "void \fBremove\fR (const T &value)"
.br
.ti -1c
.RI "template<class Predicate> void \fBremove_if\fR<Predicate> (Predicate pred)"
.br
.ti -1c
.RI "void \fBunique\fR ()"
.br
.ti -1c
.RI "template<class BinaryPredicate> void \fBunique\fR<BinaryPredicate> (BinaryPredicate binary_pred)"
.br
.ti -1c
.RI "void \fBmerge\fR (list<T,Allocator>& x)"
.br
.ti -1c
.RI "template<class Compare> void \fBmerge\fR<Compare> (list<T,Allocator>& x, Compare comp)"
.br
.ti -1c
.RI "void \fBsort\fR ()"
.br
.ti -1c
.RI "template<class Compare> void \fBsort\fR<Compare> (Compare comp)"
.br
.ti -1c
.RI "void \fBreverse\fR ()"
.br
.in -1c
.SH MEMBER TYPEDEF DOCUMENTATION
.PP 
.SS template<class T, class Allocator = allocator<T>> typedef Allocator::reference std::list<T, Allocator>::reference
.PP
.SS template<class T, class Allocator = allocator<T>> typedef Allocator::const_reference std::list<T, Allocator>::const_reference
.PP
.SS template<class T, class Allocator = allocator<T>> typedef implementation defined std::list<T, Allocator>::iterator
.PP
.SS template<class T, class Allocator = allocator<T>> typedef implementation defined std::list<T, Allocator>::const_iterator
.PP
.SS template<class T, class Allocator = allocator<T>> typedef Allocator::size_type std::list<T, Allocator>::size_type
.PP
.SS template<class T, class Allocator = allocator<T>> typedef Allocator::difference_type std::list<T, Allocator>::difference_type
.PP
.SS template<class T, class Allocator = allocator<T>> typedef T std::list<T, Allocator>::value_type
.PP
.SS template<class T, class Allocator = allocator<T>> typedef Allocator std::list<T, Allocator>::allocator_type
.PP
.SS template<class T, class Allocator = allocator<T>> typedef Allocator::pointer std::list<T, Allocator>::pointer
.PP
.SS template<class T, class Allocator = allocator<T>> typedef Allocator::const_pointer std::list<T, Allocator>::const_pointer
.PP
.SS template<class T, class Allocator = allocator<T>> typedef std::reverse_iterator<iterator> std::list<T, Allocator>::reverse_iterator
.PP
.SS template<class T, class Allocator = allocator<T>> typedef std::reverse_iterator<const_iterator> std::list<T, Allocator>::const_reverse_iterator
.PP
.SH MEMBER FUNCTION DOCUMENTATION
.PP 
.SS template<class T, class Allocator = allocator<T>> explicit std::list<T, Allocator>::list<T, Allocator> (const Allocator & = Allocator())
.PP
.nf{
.br
                                first.next = NULL;
.br
                                first.prev = first;
.br
                        }
.fi
.SS template<class T, class Allocator = allocator<T>> explicit std::list<T, Allocator>::list<T, Allocator> (\fBsize_type\fR n, const T & value = T(), const Allocator & = Allocator())
.PP
.nf{
.br
                                node *next = &first;
.br
                                while (n--) {
.br
                                        next->next = new node(value);
.br
                                        next->next->prev = next;
.br
                                        next = next->next;                                      
.br
                                }
.br
                                next->next = NULL;
.br
                        }
.fi
.SS template<class T, class Allocator = allocator<T>>  template<class InputIterator> std::list<T, Allocator>::list<T, Allocator> (InputIterator first, InputIterator last, const Allocator & = Allocator())
.PP
.nf{
.br
                                node *next = &first;
.br
                                while (first!=last) {
.br
                                        next->next = new node(*first++);
.br
                                        next->next->prev = next;
.br
                                        next = next->next;
.br
                                }
.br
                                next->next = NULL;
.br
                        }
.fi
.SS template<class T, class Allocator = allocator<T>> std::list<T, Allocator>::list<T, Allocator> (const list<T,Allocator>& x)
.PP
.nf{
.br
                        }
.fi
.SS template<class T, class Allocator = allocator<T>> std::list<T, Allocator>::~list<T, Allocator> ()
.PP
.nf{
.br
                                clear();
.br
                        }
.fi
.SS template<class T, class Allocator = allocator<T>> list<T,Allocator>& std::list<T, Allocator>::operator= (const list<T,Allocator>& x)
.PP
.SS template<class T, class Allocator = allocator<T>>  template<class InputIterator> void std::list<T, Allocator>::assign (InputIterator first, InputIterator last)
.PP
.nf{
.br
                                erase(begin(), end());
.br
                                insert(begin(), first, last);
.br
                        }
.fi
.SS template<class T, class Allocator = allocator<T>>  template<class Size, class T> void std::list<T, Allocator>::assign (Size n, const T & t = T())
.PP
.nf{
.br
                                erase(begin(), end());
.br
                                insert(begin(), n ,t);
.br
                        }
.fi
.SS template<class T, class Allocator = allocator<T>> \fBallocator_type\fR std::list<T, Allocator>::get_allocator () const
.PP
.SS template<class T, class Allocator = allocator<T>> \fBiterator\fR std::list<T, Allocator>::begin ()
.PP
.SS template<class T, class Allocator = allocator<T>> \fBconst_iterator\fR std::list<T, Allocator>::begin () const
.PP
.SS template<class T, class Allocator = allocator<T>> \fBiterator\fR std::list<T, Allocator>::end ()
.PP
.SS template<class T, class Allocator = allocator<T>> \fBconst_iterator\fR std::list<T, Allocator>::end () const
.PP
.SS template<class T, class Allocator = allocator<T>> \fBreverse_iterator\fR std::list<T, Allocator>::rbegin ()
.PP
.SS template<class T, class Allocator = allocator<T>> \fBconst_reverse_iterator\fR std::list<T, Allocator>::rbegin () const
.PP
.SS template<class T, class Allocator = allocator<T>> \fBreverse_iterator\fR std::list<T, Allocator>::rend ()
.PP
.SS template<class T, class Allocator = allocator<T>> \fBconst_reverse_iterator\fR std::list<T, Allocator>::rend () const
.PP
.SS template<class T, class Allocator = allocator<T>> bool std::list<T, Allocator>::empty () const
.PP
.SS template<class T, class Allocator = allocator<T>> \fBsize_type\fR std::list<T, Allocator>::size () const
.PP
.SS template<class T, class Allocator = allocator<T>> \fBsize_type\fR std::list<T, Allocator>::max_size () const
.PP
.SS template<class T, class Allocator = allocator<T>> void std::list<T, Allocator>::resize (\fBsize_type\fR sz, T c = T())
.PP
.SS template<class T, class Allocator = allocator<T>> \fBreference\fR std::list<T, Allocator>::front ()
.PP
.SS template<class T, class Allocator = allocator<T>> \fBconst_reference\fR std::list<T, Allocator>::front () const
.PP
.SS template<class T, class Allocator = allocator<T>> \fBreference\fR std::list<T, Allocator>::back ()
.PP
.SS template<class T, class Allocator = allocator<T>> \fBconst_reference\fR std::list<T, Allocator>::back () const
.PP
.SS template<class T, class Allocator = allocator<T>> void std::list<T, Allocator>::push_front (const T & x)
.PP
.SS template<class T, class Allocator = allocator<T>> void std::list<T, Allocator>::pop_front ()
.PP
.SS template<class T, class Allocator = allocator<T>> void std::list<T, Allocator>::push_back (const T & x)
.PP
.SS template<class T, class Allocator = allocator<T>> void std::list<T, Allocator>::pop_back ()
.PP
.SS template<class T, class Allocator = allocator<T>> \fBiterator\fR std::list<T, Allocator>::insert (\fBiterator\fR position, const T & x = T())
.PP
.SS template<class T, class Allocator = allocator<T>> void std::list<T, Allocator>::insert (\fBiterator\fR position, \fBsize_type\fR n, const T & x)
.PP
.SS template<class T, class Allocator = allocator<T>>  template<class InputIterator> void std::list<T, Allocator>::insert (\fBiterator\fR position, InputIterator first, InputIterator last)
.PP
.SS template<class T, class Allocator = allocator<T>> \fBiterator\fR std::list<T, Allocator>::erase (\fBiterator\fR position)
.PP
.SS template<class T, class Allocator = allocator<T>> \fBiterator\fR std::list<T, Allocator>::erase (\fBiterator\fR position, \fBiterator\fR last)
.PP
.SS template<class T, class Allocator = allocator<T>> void std::list<T, Allocator>::swap (list<T,Allocator>&)
.PP
.SS template<class T, class Allocator = allocator<T>> void std::list<T, Allocator>::clear ()
.PP
.SS template<class T, class Allocator = allocator<T>> void std::list<T, Allocator>::splice (\fBiterator\fR position, list<T,Allocator>& x)
.PP
.SS template<class T, class Allocator = allocator<T>> void std::list<T, Allocator>::splice (\fBiterator\fR position, list<T,Allocator>& x, \fBiterator\fR i)
.PP
.SS template<class T, class Allocator = allocator<T>> void std::list<T, Allocator>::splice (\fBiterator\fR position, list<T,Allocator>& x, \fBiterator\fR first, \fBiterator\fR last)
.PP
.SS template<class T, class Allocator = allocator<T>> void std::list<T, Allocator>::remove (const T & value)
.PP
.SS template<class T, class Allocator = allocator<T>>  template<class Predicate> void std::list<T, Allocator>::remove_if (Predicate pred)
.PP
.SS template<class T, class Allocator = allocator<T>> void std::list<T, Allocator>::unique ()
.PP
.SS template<class T, class Allocator = allocator<T>>  template<class BinaryPredicate> void std::list<T, Allocator>::unique (BinaryPredicate binary_pred)
.PP
.SS template<class T, class Allocator = allocator<T>> void std::list<T, Allocator>::merge (list<T,Allocator>& x)
.PP
.SS template<class T, class Allocator = allocator<T>>  template<class Compare> void std::list<T, Allocator>::merge (list<T,Allocator>& x, Compare comp)
.PP
.SS template<class T, class Allocator = allocator<T>> void std::list<T, Allocator>::sort ()
.PP
.SS template<class T, class Allocator = allocator<T>>  template<class Compare> void std::list<T, Allocator>::sort (Compare comp)
.PP
.SS template<class T, class Allocator = allocator<T>> void std::list<T, Allocator>::reverse ()
.PP


.SH AUTHOR
.PP 
Generated automatically by Doxygen for FREE_C++_STANDARD_LIBRARY from the source code.