blob: d1bdddaba0cbf453ebd683e11133396c28aa4db7 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
|
// *********************(c)*2004*********************>
// -holzilib--holzilib--holzilib--holzilib--holzilib->
// ++++PD-External++by+Georg+Holzmann++grh@gmx.at++++>
//
// PDContainer:
// this is a port of the containers from the C++ STL
// (Standard Template Library)
// for usage see the documentation and PD help files
// for license see readme.txt
//
// HPriority_Queue.h
#ifndef _h_priority_queue_h__
#define _h_priority_queue_h__
#include "include/QueueStack.h"
#include <queue>
using std::priority_queue;
class ElementPrio
{
public:
Element element;
float priority;
bool operator< (const ElementPrio &key) const
{
return (priority < key.priority);
}
const ElementPrio& operator = (const ElementPrio &src)
{
priority = src.priority;
element = src.element;
return (*this);
}
};
//---------------------------------------------------
/* this is the class of the priority_queue
*/
class HPrioQueue :
public QueueStack< priority_queue<ElementPrio>, int >
{
private:
/* Copy Construction is not allowed
*/
HPrioQueue(const HPrioQueue &src)
{ }
/* assignement operator is not allowed
*/
const HPrioQueue& operator = (const HPrioQueue&)
{ return *this; }
public:
/* Standard Constructor
* no namespace
*/
HPrioQueue()
{ dataname_ = "h_priority_queue"; }
/* Constructor
* with a namespace
*/
HPrioQueue(string h_namespace)
{
dataname_ = "h_priority_queue";
setNamespace(h_namespace);
}
/* Destructor
*/
virtual ~HPrioQueue() { }
/* inserts an element in the container
*/
virtual void push(float prio, Element value)
{
ElementPrio data;
data.priority = prio;
data.element = value;
data_[h_namespace_].push(data);
}
/* returns the element from the top of
* the stack
*/
virtual Element top() const
{ return data_[h_namespace_].top().element; }
};
#endif //_h_priority_queue_h__
|
