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
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
|
//////////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////////////
//
// copyright : (C) 2008 by Eran Ifrah
// file name : sync_queue.h
//
// -------------------------------------------------------------------------
// A
// _____ _ _ _ _
// / __ \ | | | | (_) |
// | / \/ ___ __| | ___| | _| |_ ___
// | | / _ \ / _ |/ _ \ | | | __/ _ )
// | \__/\ (_) | (_| | __/ |___| | || __/
// \____/\___/ \__,_|\___\_____/_|\__\___|
//
// F i l e
//
// This program 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.
//
//////////////////////////////////////////////////////////////////////////////
//////////////////////////////////////////////////////////////////////////////
#ifndef SYNC_QUEUE_H
#define SYNC_QUEUE_H
#include "codelite_exports.h"
#include "wx/thread.h"
#include <deque>
/**
* A thread safe queue implementation
*/
template <class T> class WXDLLIMPEXP_SDK SyncQueue
{
std::deque<T> m_queue;
wxMutex m_mutex;
wxCondition m_cv;
public:
SyncQueue()
: m_cv(m_mutex)
{
}
virtual ~SyncQueue() { clear(); }
/**
* Add element to the top of the queue
*/
void push_front(T&& element)
{
wxMutexLocker lk(m_mutex);
m_queue.emplace_front(std::move(element));
m_cv.Broadcast();
}
/**
* pop element from the top of the queue
*/
T pop_front()
{
wxMutexLocker lk(m_mutex);
// wait until 10 ms or something is in the queue
m_cv.WaitTimeout(10);
if(m_queue.empty()) {
return nullptr;
}
T e = std::move(m_queue.front());
m_queue.pop_front();
return e;
}
/**
* Add element to the end of the queue
*/
void push_back(T&& element)
{
wxMutexLocker lk(m_mutex);
m_queue.emplace_back(std::move(element));
m_cv.Broadcast();
}
/**
* pop element from the end of the queue
*/
T pop_back()
{
wxMutexLocker lk(m_mutex);
// wait until 10 ms or something is in the queue
m_cv.WaitTimeout(10);
if(m_queue.empty()) {
return nullptr;
}
T e = std::move(m_queue.back());
m_queue.pop_back();
return std::move(e);
}
/**
* Return number of elements on the queue
*/
size_t size()
{
wxMutexLocker lk(m_mutex);
return m_queue.size();
}
/**
* Clear the queue - remove all elements from the queue
*/
void clear()
{
wxMutexLocker lk(m_mutex);
m_queue.clear();
}
};
#endif // SYNC_QUEUE_H
|
