Bentley-Otmann Algorithm 2.0
An implementation of Bentley-Ottmann algorithm in order to count the m,n-cubes
Public Member Functions
PriorityQueue< T, A > Class Template Reference

Implementation of custom priority queues. More...

#include <structures.hpp>

Inheritance diagram for PriorityQueue< T, A >:
Inheritance graph
[legend]
Collaboration diagram for PriorityQueue< T, A >:
Collaboration graph
[legend]

List of all members.

Public Member Functions

void push (const T &value)
 Push a new value with associated vector empty.
void push (const T &value, const A &assoc)
 Push a new value in the queue or add an associated element to an existing queue's member.
top ()
 Extract the minimum of the tree.
void pop ()
 Erase the top of the queue.
bool mem (const T &value)
 Test if a value is a member of the queue.

Detailed Description

template<class T, class A>
class PriorityQueue< T, A >

Implementation of custom priority queues.

Inheritance assures the tree structure. We just define some other methods to simplify the usage of the instances and keep the vocabulary of the usual priority queues.

Definition at line 100 of file structures.hpp.


Member Function Documentation

template<class T, class A>
bool PriorityQueue< T, A >::mem ( const T &  value) [inline]

Test if a value is a member of the queue.

Parameters:
valueValue to test
Returns:
True if and only if value is a member of the queue (independently to the associated vector).

Definition at line 157 of file structures.hpp.

template<class T, class A>
void PriorityQueue< T, A >::push ( const T &  value,
const A &  assoc 
) [inline]

Push a new value in the queue or add an associated element to an existing queue's member.

Parameters:
valueNew value to push in the queue or existing member of the queue.
assocAssociated element to add to vector of value

Definition at line 122 of file structures.hpp.

template<class T, class A>
void PriorityQueue< T, A >::push ( const T &  value) [inline]

Push a new value with associated vector empty.

Parameters:
valueNew value to push in the queue.

Definition at line 108 of file structures.hpp.

template<class T, class A>
T PriorityQueue< T, A >::top ( ) [inline]

Extract the minimum of the tree.

Returns:
Top member of type T

Definition at line 137 of file structures.hpp.


The documentation for this class was generated from the following file:
 All Classes Files Functions Variables Typedefs Enumerations