blob: 8f4fbaf7ac86ed9a450396994d7a27e9967990bd (
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
|
// queue.h
/* Copyright 2009 10gen Inc.
*
* 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.
*/
#pragma once
#include "../stdafx.h"
#include "../util/goodies.h"
#include <queue>
namespace mongo {
/**
* simple blocking queue
*/
template<typename T> class BlockingQueue : boost::noncopyable {
public:
void push(T const& t){
boostlock l( _lock );
_queue.push( t );
_condition.notify_one();
}
bool empty() const {
boostlock l( _lock );
return _queue.empty();
}
bool tryPop( T & t ){
boostlock l( _lock );
if ( _queue.empty() )
return false;
t = _queue.front();
_queue.pop();
return true;
}
T blockingPop(){
boostlock l( _lock );
while( _queue.empty() )
_condition.wait( l );
T t = _queue.front();
_queue.pop();
return t;
}
private:
std::queue<T> _queue;
mutable boost::mutex _lock;
boost::condition _condition;
};
}
|
