📄 queue.html
字号:
<HTML><HEAD><TITLE><queue></TITLE></HEAD><BODY><H1><A NAME="<queue>"><CODE><queue></CODE></A></H1><HR><P>Include the <A HREF="index.html#STL">STL</A>standard header <B><CODE><queue></CODE></B>to define the template classes <CODE>priority_queue</CODE> and<CODE>queue</CODE>, and several supporting templates.</P><PRE>namespace std {template<class Ty, class Container> class <B><A HREF="#queue">queue</A></B>;template<class Ty, class Container, class Pr> class <B><A HREF="#priority_queue">priority_queue</A></B>; // TEMPLATE FUNCTIONStemplate<class Ty, class Container> bool <B><A HREF="#operator==">operator==</A></B>(const queue<Ty, Container>& left, const queue<Ty, Container>&);template<class Ty, class Container> bool <B><A HREF="#operator!=">operator!=</A></B>(const queue<Ty, Container>& left, const queue<Ty, Container>&);template<class Ty, class Container> bool <B><A HREF="#operator<">operator<</A></B>(const queue<Ty, Container>& left, const queue<Ty, Container>&);template<class Ty, class Container> bool <B><A HREF="#operator>">operator></A></B>(const queue<Ty, Container>& left, const queue<Ty, Container>&);template<class Ty, class Container> bool <B><A HREF="#operator<=">operator<=</A></B>(const queue<Ty, Container>& left, const queue<Ty, Container>&);template<class Ty, class Container> bool <B><A HREF="#operator>=">operator>=</A></B>(const queue<Ty, Container>& left, const queue<Ty, Container>&); };</PRE><H2><A NAME="operator!="><CODE>operator!=</CODE></A></H2><PRE>template<class Ty, class Container> bool <B>operator!=</B>(const queue <Ty, Container>& left, const queue <Ty, Container>& right);</PRE><P>The template function returns <CODE>!(left == right)</CODE>.</P><H2><A NAME="operator=="><CODE>operator==</CODE></A></H2><PRE>template<class Ty, class Container> bool <B>operator==</B>(const queue <Ty, Container>& left, const queue <Ty, Container>& right);</PRE><P>The template function overloads <CODE>operator==</CODE> to comparetwo objects of template class<A HREF="#queue"><CODE>queue</CODE></A>. The function returns<CODE>left.<A HREF="#queue::c">c</A> == right.c</CODE>.</P><H2><A NAME="operator<"><CODE>operator<</CODE></A></H2><PRE>template<class Ty, class Container> bool <B>operator<</B>(const queue <Ty, Container>& left, const queue <Ty, Container>& right);</PRE><P>The template function overloads <CODE>operator<</CODE> to comparetwo objects of template class<A HREF="#queue"><CODE>queue</CODE></A>. The function returns<CODE>left.<A HREF="#queue::c">c</A> < right.c</CODE>.</P><H2><A NAME="operator<="><CODE>operator<=</CODE></A></H2><PRE>template<class Ty, class Container> bool <B>operator<=</B>(const queue <Ty, Container>& left, const queue <Ty, Container>& right);</PRE><P>The template function returns <CODE>!(right < left)</CODE>.</P><H2><A NAME="operator>"><CODE>operator></CODE></A></H2><PRE>template<class Ty, class Container> bool <B>operator></B>(const queue <Ty, Container>& left, const queue <Ty, Container>& right);</PRE><P>The template function returns <CODE>right < left</CODE>.</P><H2><A NAME="operator>="><CODE>operator>=</CODE></A></H2><PRE>template<class Ty, class Container> bool <B>operator>=</B>(const queue <Ty, Container>& left, const queue <Ty, Container>& right);</PRE><P>The template function returns <CODE>!(left < right)</CODE>.</P><H2><A NAME="priority_queue"><CODE>priority_queue</CODE></A></H2><PRE>template<class Ty, class Container = vector<Ty>, class Pr = less<typename Container::value_type> > class priority_queue {public: typedef Container <B><A HREF="#priority_queue::container_type">container_type</A></B>; typedef typename Container::value_type <B><A HREF="#priority_queue::value_type">value_type</A></B>; typedef typename Container::size_type <B><A HREF="#priority_queue::size_type">size_type</A></B>; <B><A HREF="#priority_queue::priority_queue">priority_queue</A></B>(); explicit <B><A HREF="#priority_queue::priority_queue">priority_queue</A></B>(const Pr& pred); <B><A HREF="#priority_queue::priority_queue">priority_queue</A></B>(const Pr& pred, const container_type& cont); <B><A HREF="#priority_queue::priority_queue">priority_queue</A></B>(const priority_queue& right); template<class InIt> <B><A HREF="#priority_queue::priority_queue">priority_queue</A></B>(InIt first, InIt last); template<class InIt> <B><A HREF="#priority_queue::priority_queue">priority_queue</A></B>(InIt first, InIt last, const Pr& pred); template<class InIt> <B><A HREF="#priority_queue::priority_queue">priority_queue</A></B>(InIt first, InIt last, const Pr& pred, const container_type& cont); bool <B><A HREF="#priority_queue::empty">empty</A></B>() const; size_type <B><A HREF="#priority_queue::size">size</A></B>() const; const value_type& <B><A HREF="#priority_queue::top">top</A></B>() const; void <B><A HREF="#priority_queue::push">push</A></B>(const value_type& val); void <B><A HREF="#priority_queue::pop">pop</A></B>();protected: Container <B><A HREF="#priority_queue::c">c</A></B>; Pr <B><A HREF="#priority_queue::comp">comp</A></B>; };</PRE><P>The template class describes an object that controls avarying-length sequence of elements.The object allocates and frees storage for the sequence it controlsthrough a protected object named<B><A NAME="priority_queue::c"><CODE>c</CODE></A></B>,of class <CODE>Container</CODE>.The type <CODE>Ty</CODE> of elements in the controlled sequence must match<CODE><A HREF="#priority_queue::value_type">value_type</A></CODE>.</P><P>The sequence is ordered using a protected object named<B><A NAME="priority_queue::comp"><CODE>comp</CODE></A></B>.After each insertion or removal of the top element (at position zero),for the iterators <CODE>P0</CODE> and <CODE>Pi</CODE>designating elements at positions <CODE>0</CODE>and <CODE>I</CODE>, <CODE>comp(*P0, *Pi)</CODE> is false.(For the default template parameter<CODE><A HREF="functio2.html#less">less</A><typename Container::value_type></CODE>the top element of the sequence compares largest, or highest priority.)</P><P>An object of class <CODE>Container</CODE> must supplyrandom-access iterators andseveral public members defined the same as for<CODE><A HREF="deque.html#deque">deque</A></CODE> and<CODE><A HREF="vector.html#vector">vector</A></CODE>(both of which are suitable candidates for class <CODE>Container</CODE>).The required members are:</P><PRE> typedef Ty <B>value_type</B>; typedef T0 <B>size_type</B>; typedef T1 <B>iterator</B>; <B>Container</B>(); template<class InIt> <B>Container</B>(InIt first, InIt last); template<class InIt> void <B>insert</B>(iterator where, InIt first, InIt last); iterator <B>begin</B>(); iterator <B>end</B>(); bool <B>empty</B>() const; size_type <B>size</B>() const; const value_type& <B>front</B>() const; void <B>push_back</B>(const value_type& val); void <B>pop_back</B>();</PRE><P>Here, <CODE>T0</CODE> and <CODE>T1</CODE> are unspecified typesthat meet the stated requirements.</P><H3><CODE><A NAME="priority_queue::container_type">priority_queue::container_type</A></CODE></H3><PRE>typedef typename Container::container_type <B>container_type</B>;</PRE><P>The type is a synonym for the template parameter <CODE>Container</CODE>.</P><H3><CODE><A NAME="priority_queue::empty">priority_queue::empty</A></CODE></H3><PRE>bool <B>empty</B>() const;</PRE><P>The member function returns true for an empty controlled sequence.</P><H3><CODE><A NAME="priority_queue::pop">priority_queue::pop</A></CODE></H3><PRE>void <B>pop</B>();</PRE><P>The member function removes the first element of thecontrolled sequence, which must be non-empty, then reorders it.</P><H3><CODE><A NAME="priority_queue::priority_queue">priority_queue::priority_queue</A></CODE></H3><PRE><B>priority_queue</B>();explicit <B>priority_queue</B>(const Pr& pred);<B>priority_queue</B>(const Pr& pred, const container_type& cont);<B>priority_queue</B>(const priority_queue& right);template<class InIt> <B>priority_queue</B>(InIt first, InIt last);template<class InIt> <B>priority_queue</B>(InIt first, InIt last, const Pr& pred);template<class InIt>⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -