blob: dde5693904a3f9633cf09cea9de4b73dc9cff9e6 (
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
|
/*
* SOLID - Software Library for Interference Detection
*
* Copyright (C) 2001-2003 Dtecta. All rights reserved.
*
* This library may be distributed under the terms of the Q Public License
* (QPL) as defined by Trolltech AS of Norway and appearing in the file
* LICENSE.QPL included in the packaging of this file.
*
* This library may be distributed and/or modified under the terms of the
* GNU General Public License (GPL) version 2 as published by the Free Software
* Foundation and appearing in the file LICENSE.GPL included in the
* packaging of this file.
*
* This library is provided AS IS with NO WARRANTY OF ANY KIND, INCLUDING THE
* WARRANTY OF DESIGN, MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
*
* Commercial use or any other use of this library not covered by either
* the QPL or the GPL requires an additional license from Dtecta.
* Please contact info@dtecta.com for enquiries about the terms of commercial
* use of this library.
*/
#ifndef BP_PROXYLIST_H
#define BP_PROXYLIST_H
#include <assert.h>
#include <vector>
#include <algorithm>
#include <utility>
class BP_Proxy;
typedef std::pair<BP_Proxy *, unsigned int> BP_ProxyEntry;
inline bool operator<(const BP_ProxyEntry& a, const BP_ProxyEntry& b)
{
return a.first < b.first;
}
class BP_ProxyList : public std::vector<BP_ProxyEntry> {
public:
BP_ProxyList(size_t n = 20) : std::vector<BP_ProxyEntry>(n) {}
iterator add(BP_Proxy *proxy)
{
BP_ProxyEntry entry = std::make_pair(proxy, 0);
iterator it = std::lower_bound(begin(), end(), entry);
if (it == end() || (*it).first != proxy)
{
it = insert(it, entry);
}
++(*it).second;
return it;
}
void remove(BP_Proxy *proxy)
{
BP_ProxyEntry entry = std::make_pair(proxy, 0);
iterator it = std::lower_bound(begin(), end(), entry);
if (it != end() && (*it).first == proxy && --(*it).second == 0)
{
erase(it);
}
}
};
#endif
|