www.fifi.org     Documentation         Manpages         GNU Info         Debian document tree         Whole document tree     Trigance web page     Public services     User info     Mailing lists     Secure server     Multilingual usage   Copyright (C) 2000-2012 Philippe Troin <webmaster@fifi.org>. Validate HTML Validate CSS

Whole document tree                   std::priority_queue< _Tp, _Sequence, _Compare > Class Template Reference #include <stl_queue.h> List of all members. Public Types typedef _Sequence::value_type  value_type typedef _Sequence::size_type  size_type typedef _Sequence  container_type typedef _Sequence::reference  reference typedef _Sequence::const_reference  const_reference Public Methods   priority_queue (const _Compare &__x=_Compare(), const _Sequence &__s=_Sequence()) template<class _InputIterator>   priority_queue (_InputIterator __first, _InputIterator __last, const _Compare &__x=_Compare(), const _Sequence &__s=_Sequence()) bool  empty () const size_type  size () const const_reference  top () const void  push (const value_type &__x) void  pop () Protected Attributes _Sequence  c _Compare  comp Private Types typedef _Sequence::value_type  _Sequence_value_type Private Methods   __glibcpp_class_requires (_Tp, _SGIAssignableConcept)   __glibcpp_class_requires (_Sequence, _SequenceConcept)   __glibcpp_class_requires (_Sequence, _RandomAccessContainerConcept)   __glibcpp_class_requires2 (_Tp, _Sequence_value_type, _SameTypeConcept)   __glibcpp_class_requires4 (_Compare, bool, _Tp, _Tp, _BinaryFunctionConcept) template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>> class std::priority_queue< _Tp, _Sequence, _Compare > Member Typedef Documentation template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>> typedef _Sequence::value_type std::priority_queue< _Tp, _Sequence, _Compare >::_Sequence_value_type [private]   Definition at line 170 of file stl_queue.h. template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>> typedef _Sequence::const_reference std::priority_queue< _Tp, _Sequence, _Compare >::const_reference   Definition at line 180 of file stl_queue.h. Referenced by std::priority_queue< _Tp, _Sequence, _Compare >::top(). template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>> typedef _Sequence std::priority_queue< _Tp, _Sequence, _Compare >::container_type   Definition at line 177 of file stl_queue.h. template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>> typedef _Sequence::reference std::priority_queue< _Tp, _Sequence, _Compare >::reference   Definition at line 179 of file stl_queue.h. template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>> typedef _Sequence::size_type std::priority_queue< _Tp, _Sequence, _Compare >::size_type   Definition at line 176 of file stl_queue.h. Referenced by std::priority_queue< _Tp, _Sequence, _Compare >::size(). template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>> typedef _Sequence::value_type std::priority_queue< _Tp, _Sequence, _Compare >::value_type   Definition at line 175 of file stl_queue.h. Referenced by std::priority_queue< _Tp, _Sequence, _Compare >::push(). Constructor & Destructor Documentation template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>> std::priority_queue< _Tp, _Sequence, _Compare >::priority_queue (  const _Compare &    __x = _Compare(), const _Sequence &    __s = _Sequence() )  [inline, explicit]   Definition at line 185 of file stl_queue.h. References std::priority_queue< _Tp, _Sequence, _Compare >::c, std::priority_queue< _Tp, _Sequence, _Compare >::comp, and std::make_heap(). template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>> template<class _InputIterator> std::priority_queue< _Tp, _Sequence, _Compare >::priority_queue (  _InputIterator    __first, _InputIterator    __last, const _Compare &    __x = _Compare(), const _Sequence &    __s = _Sequence() )  [inline]   Definition at line 191 of file stl_queue.h. References std::priority_queue< _Tp, _Sequence, _Compare >::c, std::priority_queue< _Tp, _Sequence, _Compare >::comp, and std::make_heap(). Member Function Documentation template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>> std::priority_queue< _Tp, _Sequence, _Compare >::__glibcpp_class_requires (  _Sequence   , _RandomAccessContainerConcept    )  [private] template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>> std::priority_queue< _Tp, _Sequence, _Compare >::__glibcpp_class_requires (  _Sequence   , _SequenceConcept    )  [private] template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>> std::priority_queue< _Tp, _Sequence, _Compare >::__glibcpp_class_requires (  _Tp   , _SGIAssignableConcept    )  [private] template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>> std::priority_queue< _Tp, _Sequence, _Compare >::__glibcpp_class_requires2 (  _Tp   , _Sequence_value_type   , _SameTypeConcept    )  [private] template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>> std::priority_queue< _Tp, _Sequence, _Compare >::__glibcpp_class_requires4 (  _Compare   , bool   , _Tp   , _Tp   , _BinaryFunctionConcept    )  [private] template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>> bool std::priority_queue< _Tp, _Sequence, _Compare >::empty (    )  const [inline]   Definition at line 200 of file stl_queue.h. References std::priority_queue< _Tp, _Sequence, _Compare >::c. template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>> void std::priority_queue< _Tp, _Sequence, _Compare >::pop (    )  [inline]   Definition at line 210 of file stl_queue.h. References __STL_UNWIND, std::priority_queue< _Tp, _Sequence, _Compare >::c, std::priority_queue< _Tp, _Sequence, _Compare >::comp, and std::pop_heap(). template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>> void std::priority_queue< _Tp, _Sequence, _Compare >::push (  const value_type &    __x )  [inline]   Definition at line 203 of file stl_queue.h. References __STL_UNWIND, std::priority_queue< _Tp, _Sequence, _Compare >::c, std::priority_queue< _Tp, _Sequence, _Compare >::comp, std::push_heap(), and std::priority_queue< _Tp, _Sequence, _Compare >::value_type. template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>> size_type std::priority_queue< _Tp, _Sequence, _Compare >::size (    )  const [inline]   Definition at line 201 of file stl_queue.h. References std::priority_queue< _Tp, _Sequence, _Compare >::c, and std::priority_queue< _Tp, _Sequence, _Compare >::size_type. template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>> const_reference std::priority_queue< _Tp, _Sequence, _Compare >::top (    )  const [inline]   Definition at line 202 of file stl_queue.h. References std::priority_queue< _Tp, _Sequence, _Compare >::c, and std::priority_queue< _Tp, _Sequence, _Compare >::const_reference. Member Data Documentation template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>> _Sequence std::priority_queue< _Tp, _Sequence, _Compare >::c [protected]   Definition at line 182 of file stl_queue.h. Referenced by std::priority_queue< _Tp, _Sequence, _Compare >::empty(), std::priority_queue< _Tp, _Sequence, _Compare >::pop(), std::priority_queue< _Tp, _Sequence, _Compare >::priority_queue(), std::priority_queue< _Tp, _Sequence, _Compare >::push(), std::priority_queue< _Tp, _Sequence, _Compare >::size(), and std::priority_queue< _Tp, _Sequence, _Compare >::top(). template<class _Tp, class _Sequence = vector<_Tp>, class _Compare = less<typename _Sequence::value_type>> _Compare std::priority_queue< _Tp, _Sequence, _Compare >::comp [protected]   Definition at line 183 of file stl_queue.h. Referenced by std::priority_queue< _Tp, _Sequence, _Compare >::pop(), std::priority_queue< _Tp, _Sequence, _Compare >::priority_queue(), and std::priority_queue< _Tp, _Sequence, _Compare >::push(). The documentation for this class was generated from the following file: stl_queue.h