54   IndexedSet() { Map.reserve(N); }  in IndexedSet()
58     assert(Idx != 0 && !Map.empty() && Idx - 1 < Map.size());  in get()
59     return Map[Idx - 1];  in get()
64     auto F = llvm::find(Map, Val);  in insert()
65     if (F != Map.end())  in insert()
66       return F - Map.begin() + 1;  in insert()
67     Map.push_back(Val);  in insert()
68     return Map.size(); // Return actual_index + 1.  in insert()
72     auto F = llvm::find(Map, Val);  in find()
73     assert(F != Map.end());  in find()
74     return F - Map.begin() + 1;  in find()
77   uint32_t size() const { return Map.size(); }  in size()
81   const_iterator begin() const { return Map.begin(); }  in begin()
82   const_iterator end() const { return Map.end(); }  in end()
85   std::vector<T> Map;
294     return Map.emplace(Key, Empty).first->second;
297   auto begin() { return Map.begin(); }  in begin()
298   auto end() { return Map.end(); }  in end()
299   auto begin() const { return Map.begin(); }  in begin()
300   auto end() const { return Map.end(); }  in end()
301   auto find(const KeyType &Key) const { return Map.find(Key); }  in find()
305   std::map<KeyType, RegisterAggr> Map;  member
308   using key_type = typename decltype(Map)::key_type;
309   using mapped_type = typename decltype(Map)::mapped_type;
310   using value_type = typename decltype(Map)::value_type;