std__priority_queue.3

Free C++ Standard Library

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

.in +1c
.ti -1c
.RI "typedef Container::value_type \fBvalue_type\fR"
.br
.ti -1c
.RI "typedef Container::size_type \fBsize_type\fR"
.br
.ti -1c
.RI "typedef Container \fBcontainer_type\fR"
.br
.ti -1c
.RI "explicit \fBpriority_queue\fR (const Compare &x = Compare(), const Container& = Container())"
.br
.ti -1c
.RI "template<class InputIterator> \fBpriority_queue\fR<InputIterator> (InputIterator first, InputIterator last, const Compare& x = Compare(), const Container& = Container())"
.br
.ti -1c
.RI "bool \fBempty\fR () const"
.br
.ti -1c
.RI "\fBsize_type\fR \fBsize\fR () const"
.br
.ti -1c
.RI "const \fBvalue_type\fR& \fBtop\fR () const"
.br
.ti -1c
.RI "void \fBpush\fR (const \fBvalue_type\fR &x)"
.br
.ti -1c
.RI "void \fBpop\fR ()"
.br
.in -1c
.SS Protected Members

.in +1c
.ti -1c
.RI "Container \fBc\fR"
.br
.ti -1c
.RI "Compare \fBcomp\fR"
.br
.in -1c
.SH MEMBER TYPEDEF DOCUMENTATION
.PP 
.SS template<class T, class Container = vector<T>, class Compare = less<typename Container::value_type>> typedef Container::value_type std::priority_queue<T, Container, Compare>::value_type
.PP
.SS template<class T, class Container = vector<T>, class Compare = less<typename Container::value_type>> typedef Container::size_type std::priority_queue<T, Container, Compare>::size_type
.PP
.SS template<class T, class Container = vector<T>, class Compare = less<typename Container::value_type>> typedef Container std::priority_queue<T, Container, Compare>::container_type
.PP
.SH MEMBER FUNCTION DOCUMENTATION
.PP 
.SS template<class T, class Container = vector<T>, class Compare = less<typename Container::value_type>> explicit std::priority_queue<T, Container, Compare>::priority_queue<T, Container, Compare> (const Compare & x = Compare(), const Container & = Container())
.PP
.nf: comp(x), c(y)
.br
                        {
.br
                                make_heap(c.begin(), c.end(), comp);
.br
                        }
.fi
.SS template<class T, class Container = vector<T>, class Compare = less<typename Container::value_type>>  template<class InputIterator> std::priority_queue<T, Container, Compare>::priority_queue<T, Container, Compare> (InputIterator first, InputIterator last, const Compare & x = Compare(), const Container & = Container())
.PP
.nf: c(y), comp(x)
.br
                        {
.br
                                c.insert(c.end(), first, last);
.br
                                make_heap(c.begin(), c.end(), comp);
.br
                        }
.fi
.SS template<class T, class Container = vector<T>, class Compare = less<typename Container::value_type>> bool std::priority_queue<T, Container, Compare>::empty () const
.PP
.nf{
.br
                                return c.empty();
.br
                        }
.fi
.SS template<class T, class Container = vector<T>, class Compare = less<typename Container::value_type>> \fBsize_type\fR std::priority_queue<T, Container, Compare>::size () const
.PP
.nf{
.br
                                return c.size();
.br
                        }
.fi
.SS template<class T, class Container = vector<T>, class Compare = less<typename Container::value_type>> const \fBvalue_type\fR & std::priority_queue<T, Container, Compare>::top () const
.PP
.nf{
.br
                                return c.front();
.br
                        }
.fi
.SS template<class T, class Container = vector<T>, class Compare = less<typename Container::value_type>> void std::priority_queue<T, Container, Compare>::push (const \fBvalue_type\fR & x)
.PP
.nf{
.br
                                c.push_back(x);
.br
                                push_heap(c.begin(), c.end(), comp);
.br
                        }
.fi
.SS template<class T, class Container = vector<T>, class Compare = less<typename Container::value_type>> void std::priority_queue<T, Container, Compare>::pop ()
.PP
.nf{
.br
                                pop_heap(c.begin(), c.end(), comp);
.br
                                c.pop_back();
.br
                        }
.fi
.SH MEMBER DATA DOCUMENTATION
.PP 
.SS template<class T, class Container = vector<T>, class Compare = less<typename Container::value_type>> Container std::priority_queue<T, Container, Compare>::c\fC [protected]\fR
.PP
.SS template<class T, class Container = vector<T>, class Compare = less<typename Container::value_type>> Compare std::priority_queue<T, Container, Compare>::comp\fC [protected]\fR
.PP


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