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
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
|
/* ScummVM - Graphic Adventure Engine
*
* ScummVM is the legal property of its developers, whose names
* are too numerous to list here. Please refer to the COPYRIGHT
* file distributed with this source distribution.
*
* 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 3 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 <http://www.gnu.org/licenses/>.
*
*/
/********************************************
DISCLAIMER:
This is a wrapper code to mimic the relevant std:: class
Please use it ONLY when porting an existing code e.g. from the original sources
For all new development please use classes from Common::
*********************************************/
#ifndef COMMON_STD_SET_H
#define COMMON_STD_SET_H
#include "common/array.h"
namespace Std {
/**
* Derives the ScummVM SortedArray to match the std::set class
*/
template<class T, class Comparitor = Common::Less<T> >
class set : public Common::SortedArray<T, const T &> {
private:
static int ComparatorFn(const T &a, const T &b) {
return Comparitor().operator()(a, b) ? -1 : 0;
}
static bool CompareEq(const T &a, const T &b) {
return !ComparatorFn(a, b) && !ComparatorFn(b, a);
}
public:
struct Entry {
const T &_value;
Entry(const T &item) : _value(item) {
}
};
public:
using iterator = typename Common::SortedArray<T, const T &>::iterator;
using const_iterator = typename Common::SortedArray<T, const T &>::const_iterator;
/**
* Constructor
*/
set() : Common::SortedArray<T, const T & >(ComparatorFn) {}
/**
* Locate an item in the set
*/
iterator find(const T &item) {
iterator begin = this->begin();
iterator end = this->end();
while (begin < end) {
iterator mid = begin + (Common::distance(begin, end) / 2);
if (ComparatorFn(item, *mid))
end = mid;
else if (ComparatorFn(*mid, item))
begin = mid + 1;
else
return mid;
}
return this->end();
}
/**
* Insert an element at the sorted position.
*/
Entry insert(const T &item) {
Common::SortedArray<T, const T &>::insert(item);
return Entry(item);
}
/**
* Removes the element at the given iterator
*/
void erase(iterator item) {
Common::SortedArray<T, const T &>::erase(item);
}
/**
* Removes the elements at the specified range
*/
void erase(iterator first, iterator last) {
Common::SortedArray<T, const T &>::erase(first, last);
}
/**
* Removes the elements equal to the given item.
* Returns the number of elements removed
*/
size_t erase(const T &item) {
iterator first = find(item);
if (first == this->end())
return 0;
iterator end = first + 1;
while (end != this->end() && CompareEq(*first, *end)) {
++end;
}
size_t erased = Common::distance(first, end);
this->erase(first, end);
return erased;
}
/**
* Returns the number of keys that match the specified key
*/
size_t count(const T item) const {
size_t total = 0;
for (const_iterator it = this->begin(); it != this->end(); ++it) {
if (CompareEq(*it, item))
++total;
else if (!ComparatorFn(item, *it))
// Passed beyond possibility of matches
break;
}
return total;
}
};
} // namespace Std
#endif
|
