Lines Matching refs:Obj
41 class Obj {
43 Obj() {}
44 Obj(KeyType key, ValType val) : key_(key), val_(val) {}
48 bool operator==(const Obj& other) const {
51 bool operator<(const Obj& other) const {
55 bool operator<=(const Obj& other) const {
59 bool operator>(const Obj& other) const {
70 typedef InvalSet<Obj,
78 inline KeyType InvalSet<Obj,
83 kReclaimFactor>::Key(const Obj& obj) {
84 return obj.key_;
87 inline void InvalSet<Obj,
92 kReclaimFactor>::SetKey(Obj* obj, KeyType key) {
93 obj->key_ = key;
102 set.insert(Obj(i, i));
106 set.insert(Obj(-123, 456));
107 set.insert(Obj(2718, 2871828));
109 VIXL_CHECK(set.min_element() == Obj(-123, 456));
111 set.erase(Obj(-123, 456));
120 VIXL_CHECK(TestSet::IsValid(Obj(0, 0)));
121 VIXL_CHECK(TestSet::IsValid(Obj(-1, 0)));
122 VIXL_CHECK(TestSet::IsValid(Obj(kInvalidKey - 1, 0)));
123 VIXL_CHECK(!TestSet::IsValid(Obj(kInvalidKey, 0)));
132 set.insert(Obj(i, i));
135 set.insert(Obj(-123, 1));
137 set.insert(Obj(-123, 2));
138 set.insert(Obj(-123, 3));
152 set.insert(Obj(2718, 0));
153 set.erase(Obj(2718, 0));
155 set.insert(Obj(2718, 0));
157 set.insert(Obj(2718, 1));
159 set.erase(Obj(2718, 0));
164 set.insert(Obj(i * i, i % 30));
165 set.insert(Obj(i, -1));
168 set.erase(Obj(100, -1));
185 set.insert(Obj(-1, -1));
186 set.insert(Obj(-1, 0));
187 set.insert(Obj(0, 0));
188 set.insert(Obj(1, 0));
189 VIXL_CHECK(set.min_element() == Obj(-1, -1));
199 set.insert(Obj(sign * i, i));
201 VIXL_CHECK(set.min_element() == Obj(-max_index, max_index));
204 set.erase(Obj(0, 0));
205 VIXL_CHECK(set.min_element() == Obj(-max_index, max_index));
207 VIXL_CHECK(set.min_element() == Obj(-(max_index - 2), max_index - 2));
220 set.insert(Obj(i, i));
233 set.insert(Obj(i, i));
244 set.erase(Obj(0, 0));
