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
|
/* -*- Mode: C++; tab-width: 2; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
/***************************************************************************
* threadsafe_queue_priority.h
*
* Tue Sep 27 14:01:24 CEST 2005
* Copyright 2005 Bent Bisballe Nyeng
* deva@aasimon.org
****************************************************************************/
/*
* This file is part of MIaV.
*
* MIaV is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation; either version 2 of the License, or
* (at your option) any later version.
*
* MIaV is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with MIaV; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA.
*/
#include "config.h"
#ifndef __MIAV_THREADSAFE_QUEUE_PRIORITY_H__
#define __MIAV_THREADSAFE_QUEUE_PRIORITY_H__
#include "threadsafe_queue.h"
#include "frame.h"
#include <queue>
#include <functional>
// Method for use, when comparing Frames in priority queue.
template <typename T>
struct priority : std::binary_function<T, T, bool> {
bool operator() (const T& a, const T& b) const {
return ((Frame*)a)->number > ((Frame*)b)->number;
}
};
class ThreadSafeQueuePriority: public ThreadSafeQueue< Frame* > {
public:
ThreadSafeQueuePriority(unsigned int framenumber = 0);
~ThreadSafeQueuePriority();
void push(Frame *frame);
Frame *pop();
int size();
private:
unsigned int framenumber;
std::priority_queue< Frame*, std::vector<Frame*>, priority<Frame*> > queue;
};
#endif/*__MIAV_THREADSAFE_QUEUE_PRIORITY_H__*/
|
