Bentley-Otmann Algorithm 2.0
An implementation of Bentley-Ottmann algorithm in order to count the m,n-cubes
|
Implementation of custom priority queues. More...
#include <structures.hpp>
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. | |
T | 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. |
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.
bool PriorityQueue< T, A >::mem | ( | const T & | value | ) | [inline] |
Test if a value is a member of the queue.
value | Value to test |
Definition at line 157 of file structures.hpp.
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.
value | New value to push in the queue or existing member of the queue. |
assoc | Associated element to add to vector of value |
Definition at line 122 of file structures.hpp.
void PriorityQueue< T, A >::push | ( | const T & | value | ) | [inline] |
Push a new value with associated vector empty.
value | New value to push in the queue. |
Definition at line 108 of file structures.hpp.
T PriorityQueue< T, A >::top | ( | ) | [inline] |
Extract the minimum of the tree.
Definition at line 137 of file structures.hpp.