Specialised bucket priority queue for RePair. More...

#include <RePair.h>

Public Member Functions
	PriorityQueue (const int size=0)

void	init (const int size)

void	insert (Record< Pair > *record)

bool	empty () const

Record< Pair > *	popMostFrequentRecord ()

void	decrementFrequency (Record< Pair > *record)

Friends
std::ostream &	operator<< (std::ostream &os, const PriorityQueue< Pair > &queue)

Detailed Description

Specialised bucket priority queue for RePair.

Definition at line 75 of file RePair.h.

Constructor & Destructor Documentation

template<typename Pair>

SimpleRePair::PriorityQueue< Pair >::PriorityQueue ( const int size = 0 )

inline

Definition at line 76 of file RePair.h.

template<typename Pair>

void SimpleRePair::PriorityQueue< Pair >::decrementFrequency ( Record< Pair > * record )

inline

Definition at line 120 of file RePair.h.

template<typename Pair>

bool SimpleRePair::PriorityQueue< Pair >::empty ( ) const

inline

Definition at line 94 of file RePair.h.

template<typename Pair>

void SimpleRePair::PriorityQueue< Pair >::init ( const int size )

inline

Definition at line 78 of file RePair.h.

template<typename Pair>

void SimpleRePair::PriorityQueue< Pair >::insert ( Record< Pair > * record )

inline

Definition at line 82 of file RePair.h.

template<typename Pair>

Record<Pair>* SimpleRePair::PriorityQueue< Pair >::popMostFrequentRecord ( )

inline

Definition at line 98 of file RePair.h.

template<typename Pair>

friend

Definition at line 150 of file RePair.h.

The documentation for this struct was generated from the following file: