sspt_SkewHeap< P, T, CompareOp > Class Template Reference

priority queue-type data structure supporting arbitary queue sizes More...

#include <sspt_skewheap.h>

List of all members.

Public Member Functions
	sspt_SkewHeap ()
	~sspt_SkewHeap ()
bool	isEmpty ()
void	insert (const P &priority, const T &item)
bool	current (P *priority, T *item)
bool	remove (P *priority, T *item)
sspt_SkewNode< P, T > *	root () const

---

Detailed Description

template<class P, class T, class CompareOp>
class sspt_SkewHeap< P, T, CompareOp >

priority queue-type data structure supporting arbitary queue sizes

It requires an additional comparison object with bool operator(const P &a, const P &b) to compare priorities.

---

Constructor & Destructor Documentation

template<class P , class T , class CompareOp >

sspt_SkewHeap< P, T, CompareOp >::sspt_SkewHeap

(

)

[inline]

template<class P , class T , class CompareOp >

sspt_SkewHeap< P, T, CompareOp >::~sspt_SkewHeap

(

)

[inline]

---

Member Function Documentation

template<class P, class T, class CompareOp >

bool sspt_SkewHeap< P, T, CompareOp >::current	(	P *	priority,
		T *	item
	)			[inline]

template<class P, class T, class CompareOp >

void sspt_SkewHeap< P, T, CompareOp >::insert	(	const P &	priority,
		const T &	item
	)			[inline]

template<class P , class T , class CompareOp >

bool sspt_SkewHeap< P, T, CompareOp >::isEmpty

(

)

[inline]

template<class P, class T, class CompareOp >

bool sspt_SkewHeap< P, T, CompareOp >::remove	(	P *	priority,
		T *	item
	)			[inline]

template<class P , class T , class CompareOp >

sspt_SkewNode< P, T > * sspt_SkewHeap< P, T, CompareOp >::root

(

)

const [inline]