Tree Compression with Top Trees Revisited
Public Member Functions | Friends | List of all members
RePair::PriorityQueue Struct Reference

RePair Priority Queue. More...

#include <PriorityQueue.h>

Public Member Functions

 PriorityQueue (const int size=0)
 
void init (const int size)
 
void clear ()
 
bool addEntry (PQEntry *entry)
 
void removeEntry (PQEntry *entry)
 
PQEntrypopMaxEntry ()
 
bool empty ()
 

Friends

std::ostream & operator<< (std::ostream &os, const PriorityQueue &pq)
 

Detailed Description

RePair Priority Queue.

Definition at line 11 of file PriorityQueue.h.

Constructor & Destructor Documentation

RePair::PriorityQueue::PriorityQueue ( const int  size = 0)
inline

Definition at line 12 of file PriorityQueue.h.

Member Function Documentation

bool RePair::PriorityQueue::addEntry ( PQEntry entry)
inline

Definition at line 22 of file PriorityQueue.h.

void RePair::PriorityQueue::clear ( )
inline

Definition at line 18 of file PriorityQueue.h.

bool RePair::PriorityQueue::empty ( )
inline

Definition at line 55 of file PriorityQueue.h.

void RePair::PriorityQueue::init ( const int  size)
inline

Definition at line 14 of file PriorityQueue.h.

PQEntry* RePair::PriorityQueue::popMaxEntry ( )
inline

Definition at line 45 of file PriorityQueue.h.

void RePair::PriorityQueue::removeEntry ( PQEntry entry)
inline

Definition at line 36 of file PriorityQueue.h.

Friends And Related Function Documentation

std::ostream& operator<< ( std::ostream &  os,
const PriorityQueue pq 
)
friend

Definition at line 62 of file PriorityQueue.h.


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