Lines Matching refs:Obj
40 class Obj {
42 Obj() {}
43 Obj(KeyType key, ValType val) : key_(key), val_(val) {}
47 bool operator==(const Obj& other) const {
50 bool operator<(const Obj& other) const {
53 bool operator<=(const Obj& other) const {
57 bool operator>(const Obj& other) const {
67 typedef InvalSet<Obj,
76 inline KeyType InvalSet<Obj,
81 kReclaimFactor>::GetKey(const Obj& obj) {
85 inline void InvalSet<Obj,
90 kReclaimFactor>::SetKey(Obj* obj, KeyType key) {
100 set.insert(Obj(i, i));
104 set.insert(Obj(-123, 456));
105 set.insert(Obj(2718, 2871828));
107 VIXL_CHECK(set.GetMinElement() == Obj(-123, 456));
109 set.erase(Obj(-123, 456));
118 VIXL_CHECK(TestSet::IsValid(Obj(0, 0)));
119 VIXL_CHECK(TestSet::IsValid(Obj(-1, 0)));
120 VIXL_CHECK(TestSet::IsValid(Obj(kInvalidKey - 1, 0)));
121 VIXL_CHECK(!TestSet::IsValid(Obj(kInvalidKey, 0)));
130 set.insert(Obj(i, i));
133 set.insert(Obj(-123, 1));
135 set.insert(Obj(-123, 2));
136 set.insert(Obj(-123, 3));
150 set.insert(Obj(2718, 0));
151 set.erase(Obj(2718, 0));
153 set.insert(Obj(2718, 0));
155 set.insert(Obj(2718, 1));
157 set.erase(Obj(2718, 0));
162 set.insert(Obj(i * i, i % 30));
163 set.insert(Obj(i, -1));
166 set.erase(Obj(100, -1));
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));
197 set.insert(Obj(sign * i, i));
199 VIXL_CHECK(set.GetMinElement() == Obj(-max_index, max_index));
202 set.erase(Obj(0, 0));
203 VIXL_CHECK(set.GetMinElement() == Obj(-max_index, max_index));
205 VIXL_CHECK(set.GetMinElement() == Obj(-(max_index - 2), max_index - 2));
222 set.insert(Obj(i, i));
238 set.insert(Obj(i, i));
253 std::vector<Obj> to_erase;
256 to_erase.push_back(Obj(i, i));
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.
291 set.insert(Obj(i, i));
307 set.insert(Obj(i, i));
322 std::vector<Obj> to_erase;
325 to_erase.push_back(Obj(i, i));
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.
368 set1.insert(Obj(i, 1));
369 set2.insert(Obj(i, 2));
389 *it1_b = Obj(42, 1);