SourceForge.jp

クラス テンプレートstx::stable_priority_queue< T, Container, Compare >

#include <stable_priority_queue.h>

stx::stable_priority_queue< T, Container, Compare >のコラボレーション図

Collaboration graph
[凡例]
すべてのメンバ一覧

Public 型

typedef Container::value_type value_type
typedef Container::size_type size_type
typedef Container container_type

Public メソッド

 stable_priority_queue (const Compare &pp=Compare(), const Container &cc=Container())
template<class InputIterator>  stable_priority_queue (InputIterator first, InputIterator last, const Compare &pp=Compare())
bool empty () const
 dequeのemptyと同じ

size_type size () const
 dequeのsize

const value_typetop () const
 dequeのback

void pop ()
 dequeのpop_back

void push (const value_type &x)

Protected 変数

Container c
Compare comp

template<class T, class Container = std::deque<T>, class Compare = std::less<Container::value_type>>
class stx::stable_priority_queue< T, Container, Compare >


型定義

template<class T, class Container = std::deque<T>, class Compare = std::less<Container::value_type>>
typedef Container stx::stable_priority_queue< T, Container, Compare >::container_type
 

template<class T, class Container = std::deque<T>, class Compare = std::less<Container::value_type>>
typedef Container::size_type stx::stable_priority_queue< T, Container, Compare >::size_type
 

template<class T, class Container = std::deque<T>, class Compare = std::less<Container::value_type>>
typedef Container::value_type stx::stable_priority_queue< T, Container, Compare >::value_type
 


コンストラクタとデストラクタ

template<class T, class Container = std::deque<T>, class Compare = std::less<Container::value_type>>
stx::stable_priority_queue< T, Container, Compare >::stable_priority_queue const Compare &  pp = Compare(),
const Container &  cc = Container()
[inline, explicit]
 

template<class T, class Container = std::deque<T>, class Compare = std::less<Container::value_type>>
template<class InputIterator>
stx::stable_priority_queue< T, Container, Compare >::stable_priority_queue InputIterator  first,
InputIterator  last,
const Compare &  pp = Compare()
[inline]
 


関数

template<class T, class Container = std::deque<T>, class Compare = std::less<Container::value_type>>
bool stx::stable_priority_queue< T, Container, Compare >::empty  )  const [inline]
 

dequeのemptyと同じ

template<class T, class Container = std::deque<T>, class Compare = std::less<Container::value_type>>
void stx::stable_priority_queue< T, Container, Compare >::pop  )  [inline]
 

dequeのpop_back

template<class T, class Container = std::deque<T>, class Compare = std::less<Container::value_type>>
void stx::stable_priority_queue< T, Container, Compare >::push const value_type x  )  [inline]
 

template<class T, class Container = std::deque<T>, class Compare = std::less<Container::value_type>>
size_type stx::stable_priority_queue< T, Container, Compare >::size  )  const [inline]
 

dequeのsize

template<class T, class Container = std::deque<T>, class Compare = std::less<Container::value_type>>
const value_type& stx::stable_priority_queue< T, Container, Compare >::top  )  const [inline]
 

dequeのback


変数

template<class T, class Container = std::deque<T>, class Compare = std::less<Container::value_type>>
Container stx::stable_priority_queue< T, Container, Compare >::c [protected]
 

template<class T, class Container = std::deque<T>, class Compare = std::less<Container::value_type>>
Compare stx::stable_priority_queue< T, Container, Compare >::comp [protected]
 


このクラスの説明は次のファイルから生成されました:
dkutil 1.02リリース前 d金魚専用マニュアルバージョンに対してSun Dec 28 21:23:24 2003に生成されました。 doxygen 1.3.5