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
|
/*
* Copyright (C) 2003-2006 RevConnect, http://www.revconnect.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, see <https://www.gnu.org/licenses/>.
*/
#pragma once
#include "MerkleTree.h"
namespace dcpp {
struct SearchCore
{
int32_t sizeType;
int64_t size;
int32_t fileType;
string query;
string token;
StringList exts;
std::unordered_set<void*> owners;
bool operator==(const SearchCore& rhs) const {
return this->sizeType == rhs.sizeType &&
this->size == rhs.size &&
this->fileType == rhs.fileType &&
this->query == rhs.query &&
this->token == rhs.token;
}
};
class SearchQueue
{
public:
SearchQueue(uint32_t aInterval = 0)
: interval(aInterval), lastSearchTime(0)
{
}
bool add(const SearchCore& s);
bool pop(SearchCore& s, uint64_t now);
void clear()
{
Lock l(cs);
searchQueue.clear();
}
bool cancelSearch(void* aOwner);
/** return 0 means not in queue */
uint64_t getSearchTime(void* aOwner, uint64_t now);
/**
by milli-seconds
0 means no interval, no auto search and manual search is sent immediately
*/
uint64_t interval;
private:
deque<SearchCore> searchQueue;
uint64_t lastSearchTime;
CriticalSection cs;
};
}
|
