Lines Matching refs:size
97 VIXL_CHECK(set.empty() && (set.size() == 0));
102 VIXL_CHECK(set.size() == kNPreallocatedElements);
106 VIXL_CHECK(set.size() == kNPreallocatedElements + 2);
113 VIXL_CHECK(set.empty() && (set.size() == 0));
127 VIXL_CHECK(set.empty() && (set.size() == 0));
132 VIXL_CHECK(set.size() == kNPreallocatedElements);
134 VIXL_CHECK(set.size() == kNPreallocatedElements + 1);
137 VIXL_CHECK(set.size() == kNPreallocatedElements + 3);
140 VIXL_CHECK(set.empty() && (set.size() == 0));
146 VIXL_CHECK(set.empty() && (set.size() == 0));
152 VIXL_CHECK(set.empty() && (set.size() == 0));
154 VIXL_CHECK(set.size() == 1);
156 VIXL_CHECK(set.size() == 2);
158 VIXL_CHECK(set.size() == 1);
165 size_t max_size = set.size();
167 VIXL_CHECK(set.size() == max_size - 1);
170 VIXL_CHECK(set.size() == max_size - i);
173 VIXL_CHECK(set.empty() && (set.size() == 0));
179 VIXL_CHECK(set.empty() && (set.size() == 0));
208 VIXL_CHECK(set.empty() && (set.size() == 0));
214 VIXL_CHECK(set.empty() && (set.size() == 0));
226 size_t size = 0;
230 size++;
232 VIXL_CHECK(size == set.size());
242 size = 0;
246 size++;
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.
271 size = 0;
275 size++;
277 VIXL_CHECK(size == set.size());
286 VIXL_CHECK(set.empty() && (set.size() == 0));
295 size_t size = 0;
299 size++;
301 VIXL_CHECK(size == set.size());
311 size = 0;
315 size++;
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.
340 size = 0;
344 size++;
346 VIXL_CHECK(size == set.size());
361 VIXL_CHECK(set1.empty() && (set1.size() == 0));
364 VIXL_CHECK(set2.empty() && (set2.size() == 0));