blob: ef3f0b83814c3786b47b2d5fbba1352393c99ae9 (
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
|
/*
*
* Copyright (c) 2006 The Apache Software Foundation
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*
*/
#ifndef _LockedQueue_
#define _LockedQueue_
#include <queue>
#include "Monitor.h"
/**
* A threadsafe queue abstraction
*/
namespace qpid {
namespace concurrent {
template<class T, class L> class LockedQueue
{
L lock;
std::queue<T*> queue;
public:
void put(T* item);
T* take();
bool empty();
};
template<class T, class L> void LockedQueue<T, L>::put(T* item){
lock.acquire();
queue.push(item);
lock.release();
}
template<class T, class L> T* LockedQueue<T, L>::take(){
lock.acquire();
T* item = 0;
if(!queue.empty()){
item = queue.front();
queue.pop();
}
lock.release();
return item;
}
template<class T, class L> bool LockedQueue<T, L>::empty(){
lock.acquire();
bool result = queue.empty();
lock.release();
return result;
}
}
}
#endif
|
