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
|
/*
* Copyright (C) 2001-2006 Jacek Sieka, arnetheduck on gmail point com
*
* 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.
*
* This program 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 this program; if not, write to the Free Software
* Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA 02111-1307, USA.
*/
#if !defined(TASK_H)
#define TASK_H
#include "CriticalSection.h"
struct Task {
virtual ~Task() = 0 { }
};
struct StringTask : public Task {
StringTask(const string& str_) : str(str_) { }
string str;
};
class TaskQueue {
public:
typedef pair<int, Task*> Pair;
typedef vector<Pair> List;
typedef List::iterator Iter;
TaskQueue() {
}
~TaskQueue() {
clear();
}
void add(int type, Task* data) { Lock l(cs); tasks.push_back(make_pair(type, data)); }
void get(List& list) { Lock l(cs); swap(tasks, list); }
void clear() {
List tmp;
get(tmp);
for(Iter i = tmp.begin(); i != tmp.end(); ++i) {
delete i->second;
}
}
private:
TaskQueue(const TaskQueue&);
TaskQueue& operator=(const TaskQueue&);
CriticalSection cs;
List tasks;
};
#endif TASK_H
|
