/usr/include/eiskaltdcpp/dcpp/TaskQueue.h is in libeiskaltdcpp-dev 2.2.9-4.1.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 | /*
* Copyright (C) 2001-2012 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., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
*/
#pragma once
#include <memory>
#include <utility>
#include <vector>
#include "CriticalSection.h"
namespace dcpp {
using std::make_pair;
using std::pair;
using std::swap;
using std::unique_ptr;
using std::vector;
struct Task {
virtual ~Task() { };
};
struct StringTask : public Task {
StringTask(const string& str_) : str(str_) { }
string str;
};
class TaskQueue {
public:
typedef pair<int, unique_ptr<Task>> Pair;
typedef vector<Pair> List;
TaskQueue() {
}
~TaskQueue() {
clear();
}
void add(int type, std::unique_ptr<Task> && data) { Lock l(cs); tasks.push_back(make_pair(type, move(data))); }
void get(List& list) { Lock l(cs); swap(tasks, list); }
void clear() {
List tmp;
get(tmp);
}
private:
TaskQueue(const TaskQueue&);
TaskQueue& operator=(const TaskQueue&);
CriticalSection cs;
List tasks;
};
} // namespace dcpp
|