40 class Obj {  class
42   Obj() {}  in Obj()  function in vixl::Obj
43   Obj(KeyType key, ValType val) : key_(key), val_(val) {}  in Obj()  function in vixl::Obj
47   bool operator==(const Obj& other) const {  in operator ==()
50   bool operator<(const Obj& other) const {  in operator <()
53   bool operator<=(const Obj& other) const {  in operator <=()
57   bool operator>(const Obj& other) const {  in operator >()
67 typedef InvalSet<Obj,
75 inline KeyType InvalSet<Obj,
80                         kReclaimFactor>::GetKey(const Obj& obj) {  in GetKey()
84 inline void InvalSet<Obj,
89                      kReclaimFactor>::SetKey(Obj* obj, KeyType key) {  in SetKey()
99     set.insert(Obj(i, i));  in TEST()
103   set.insert(Obj(-123, 456));  in TEST()
104   set.insert(Obj(2718, 2871828));  in TEST()
106   VIXL_CHECK(set.GetMinElement() == Obj(-123, 456));  in TEST()
108   set.erase(Obj(-123, 456));  in TEST()
117   VIXL_CHECK(TestSet::IsValid(Obj(0, 0)));  in TEST()
118   VIXL_CHECK(TestSet::IsValid(Obj(-1, 0)));  in TEST()
119   VIXL_CHECK(TestSet::IsValid(Obj(kInvalidKey - 1, 0)));  in TEST()
120   VIXL_CHECK(!TestSet::IsValid(Obj(kInvalidKey, 0)));  in TEST()
129     set.insert(Obj(i, i));  in TEST()
132   set.insert(Obj(-123, 1));  in TEST()
134   set.insert(Obj(-123, 2));  in TEST()
135   set.insert(Obj(-123, 3));  in TEST()
149   set.insert(Obj(2718, 0));  in TEST()
150   set.erase(Obj(2718, 0));  in TEST()
152   set.insert(Obj(2718, 0));  in TEST()
154   set.insert(Obj(2718, 1));  in TEST()
156   set.erase(Obj(2718, 0));  in TEST()
161     set.insert(Obj(i * i, i % 30));  in TEST()
162     set.insert(Obj(i, -1));  in TEST()
165   set.erase(Obj(100, -1));  in TEST()
182   set.insert(Obj(-1, -1));  in TEST()
183   set.insert(Obj(-1, 0));  in TEST()
184   set.insert(Obj(0, 0));  in TEST()
185   set.insert(Obj(1, 0));  in TEST()
186   VIXL_CHECK(set.GetMinElement() == Obj(-1, -1));  in TEST()
196     set.insert(Obj(sign * i, i));  in TEST()
198   VIXL_CHECK(set.GetMinElement() == Obj(-max_index, max_index));  in TEST()
201   set.erase(Obj(0, 0));  in TEST()
202   VIXL_CHECK(set.GetMinElement() == Obj(-max_index, max_index));  in TEST()
204   VIXL_CHECK(set.GetMinElement() == Obj(-(max_index - 2), max_index - 2));  in TEST()
221     set.insert(Obj(i, i));  in TEST()
237     set.insert(Obj(i, i));  in TEST()
252   std::vector<Obj> to_erase;  in TEST()
255     to_erase.push_back(Obj(i, i));  in TEST()
257   to_erase.push_back(Obj(set.size() - 1, set.size() - 1));  // The last element.  in TEST()
258   to_erase.push_back(Obj(set.size(), set.size()));          // Not in the set.  in TEST()
290     set.insert(Obj(i, i));  in TEST()
306     set.insert(Obj(i, i));  in TEST()
321   std::vector<Obj> to_erase;  in TEST()
324     to_erase.push_back(Obj(i, i));  in TEST()
326   to_erase.push_back(Obj(set.size() - 1, set.size() - 1));  // The last element.  in TEST()
327   to_erase.push_back(Obj(set.size(), set.size()));          // Not in the set.  in TEST()
367     set1.insert(Obj(i, 1));  in TEST()
368     set2.insert(Obj(i, 2));  in TEST()
388   *it1_b = Obj(42, 1);  in TEST()