Lines Matching refs:set
96 TestSet set;
97 VIXL_CHECK(set.empty() && (set.size() == 0));
100 set.insert(Obj(i, i));
102 VIXL_CHECK(set.size() == kNPreallocatedElements);
104 set.insert(Obj(-123, 456));
105 set.insert(Obj(2718, 2871828));
106 VIXL_CHECK(set.size() == kNPreallocatedElements + 2);
107 VIXL_CHECK(set.GetMinElement() == Obj(-123, 456));
109 set.erase(Obj(-123, 456));
110 VIXL_CHECK(set.GetMinElementKey() == 0);
112 set.clear();
113 VIXL_CHECK(set.empty() && (set.size() == 0));
126 TestSet set;
127 VIXL_CHECK(set.empty() && (set.size() == 0));
130 set.insert(Obj(i, i));
132 VIXL_CHECK(set.size() == kNPreallocatedElements);
133 set.insert(Obj(-123, 1));
134 VIXL_CHECK(set.size() == kNPreallocatedElements + 1);
135 set.insert(Obj(-123, 2));
136 set.insert(Obj(-123, 3));
137 VIXL_CHECK(set.size() == kNPreallocatedElements + 3);
139 set.clear();
140 VIXL_CHECK(set.empty() && (set.size() == 0));
145 TestSet set;
146 VIXL_CHECK(set.empty() && (set.size() == 0));
148 // Test with only preallocated elements in the set.
150 set.insert(Obj(2718, 0));
151 set.erase(Obj(2718, 0));
152 VIXL_CHECK(set.empty() && (set.size() == 0));
153 set.insert(Obj(2718, 0));
154 VIXL_CHECK(set.size() == 1);
155 set.insert(Obj(2718, 1));
156 VIXL_CHECK(set.size() == 2);
157 set.erase(Obj(2718, 0));
158 VIXL_CHECK(set.size() == 1);
162 set.insert(Obj(i * i, i % 30));
163 set.insert(Obj(i, -1));
165 size_t max_size = set.size();
166 set.erase(Obj(100, -1));
167 VIXL_CHECK(set.size() == max_size - 1);
169 set.erase(set.GetMinElement());
170 VIXL_CHECK(set.size() == max_size - i);
173 VIXL_CHECK(set.empty() && (set.size() == 0));
178 TestSet set;
179 VIXL_CHECK(set.empty() && (set.size() == 0));
181 // Test with only preallocated elements in the set.
183 set.insert(Obj(-1, -1));
184 set.insert(Obj(-1, 0));
185 set.insert(Obj(0, 0));
186 set.insert(Obj(1, 0));
187 VIXL_CHECK(set.GetMinElement() == Obj(-1, -1));
188 VIXL_CHECK(set.GetMinElementKey() == -1);
189 VIXL_CHECK(set.GetMinElement().key_ == set.GetMinElementKey());
192 set.clear();
197 set.insert(Obj(sign * i, i));
199 VIXL_CHECK(set.GetMinElement() == Obj(-max_index, max_index));
200 VIXL_CHECK(set.GetMinElement().key_ == set.GetMinElementKey());
202 set.erase(Obj(0, 0));
203 VIXL_CHECK(set.GetMinElement() == Obj(-max_index, max_index));
204 set.erase(set.GetMinElement());
205 VIXL_CHECK(set.GetMinElement() == Obj(-(max_index - 2), max_index - 2));
207 set.clear();
208 VIXL_CHECK(set.empty() && (set.size() == 0));
213 TestSet set;
214 VIXL_CHECK(set.empty() && (set.size() == 0));
216 // Ensure that set.begin() == set.end() for the empty set.
217 VIXL_CHECK(set.begin() == set.end());
219 // Test with only preallocated elements in the set.
222 set.insert(Obj(i, i));
228 for (InvalSetIterator<TestSet> it = set.begin(); it != set.end(); ++it) {
232 VIXL_CHECK(size == set.size());
238 set.insert(Obj(i, i));
244 for (InvalSetIterator<TestSet> it = set.begin(); it != set.end(); ++it) {
248 VIXL_CHECK(size == set.size());
255 for (unsigned i = 0; i < set.size(); i += step, step++) {
258 to_erase.push_back(Obj(set.size() - 1, set.size() - 1)); // The last element.
259 to_erase.push_back(Obj(set.size(), set.size())); // Not in the set.
263 size_t erased = set.erase(to_erase.back());
273 for (InvalSetIterator<TestSet> it = set.begin(); it != set.end(); ++it) {
277 VIXL_CHECK(size == set.size());
285 TestSet set;
286 VIXL_CHECK(set.empty() && (set.size() == 0));
288 // Test with only preallocated elements in the set.
291 set.insert(Obj(i, i));
297 for (auto object : set) {
301 VIXL_CHECK(size == set.size());
307 set.insert(Obj(i, i));
313 for (auto object : set) {
317 VIXL_CHECK(size == set.size());
324 for (unsigned i = 0; i < set.size(); i += step, step++) {
327 to_erase.push_back(Obj(set.size() - 1, set.size() - 1)); // The last element.
328 to_erase.push_back(Obj(set.size(), set.size())); // Not in the set.
332 size_t erased = set.erase(to_erase.back());
342 for (auto object : set) {
346 VIXL_CHECK(size == set.size());
366 // Test with only preallocated elements in the set.