Movatterモバイル変換

[0]ホーム
URL:

LLVM 20.0.0git
MapVector.h
Go to the documentation of this file.
1//===- llvm/ADT/MapVector.h - Map w/ deterministic value order --*- C++ -*-===//
2//
3// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6//
7//===----------------------------------------------------------------------===//
8///
9/// \file
10/// This file implements a map that provides insertion order iteration. The
11/// interface is purposefully minimal. The key is assumed to be cheap to copy
12/// and 2 copies are kept, one for indexing in a DenseMap, one for iteration in
13/// a SmallVector.
14///
15//===----------------------------------------------------------------------===//
16
17#ifndef LLVM_ADT_MAPVECTOR_H
18#define LLVM_ADT_MAPVECTOR_H
19
20#include "llvm/ADT/DenseMap.h"
21#include "llvm/ADT/SmallVector.h"
22#include <cassert>
23#include <cstddef>
24#include <iterator>
25#include <type_traits>
26#include <utility>
27
28namespacellvm {
29
30/// This class implements a map that also provides access to all stored values
31/// in a deterministic order. The values are kept in a SmallVector<*, 0> and the
32/// mapping is done with DenseMap from Keys to indexes in that vector.
33template <typenameKeyT,typenameValueT,
34typename MapType = DenseMap<KeyT, unsigned>,
35typenameVectorType = SmallVector<std::pair<KeyT, ValueT>, 0>>
36classMapVector {
37 MapType Map;
38VectorType Vector;
39
40static_assert(
41 std::is_integral_v<typename MapType::mapped_type>,
42"The mapped_type of the specified Map must be an integral type");
43
44public:
45usingkey_type =KeyT;
46usingvalue_type =typename VectorType::value_type;
47usingsize_type =typename VectorType::size_type;
48
49usingiterator =typename VectorType::iterator;
50usingconst_iterator =typename VectorType::const_iterator;
51usingreverse_iterator =typename VectorType::reverse_iterator;
52usingconst_reverse_iterator =typename VectorType::const_reverse_iterator;
53
54 /// Clear the MapVector and return the underlying vector.
55VectorTypetakeVector() {
56 Map.clear();
57return std::move(Vector);
58 }
59
60size_typesize() const{return Vector.size(); }
61
62 /// Grow the MapVector so that it can contain at least \p NumEntries items
63 /// before resizing again.
64voidreserve(size_type NumEntries) {
65 Map.reserve(NumEntries);
66 Vector.reserve(NumEntries);
67 }
68
69iteratorbegin() {return Vector.begin(); }
70const_iteratorbegin() const{return Vector.begin(); }
71iteratorend() {return Vector.end(); }
72const_iteratorend() const{return Vector.end(); }
73
74reverse_iteratorrbegin() {return Vector.rbegin(); }
75const_reverse_iteratorrbegin() const{return Vector.rbegin(); }
76reverse_iteratorrend() {return Vector.rend(); }
77const_reverse_iteratorrend() const{return Vector.rend(); }
78
79boolempty() const{
80return Vector.empty();
81 }
82
83 std::pair<KeyT, ValueT> &front() {return Vector.front(); }
84const std::pair<KeyT, ValueT> &front() const{return Vector.front(); }
85 std::pair<KeyT, ValueT> &back() {return Vector.back(); }
86const std::pair<KeyT, ValueT> &back() const{return Vector.back(); }
87
88voidclear() {
89 Map.clear();
90 Vector.clear();
91 }
92
93voidswap(MapVector &RHS) {
94std::swap(Map,RHS.Map);
95std::swap(Vector,RHS.Vector);
96 }
97
98ValueT &operator[](constKeyT &Key) {
99 std::pair<KeyT, typename MapType::mapped_type> Pair = std::make_pair(Key, 0);
100 std::pair<typename MapType::iterator, bool> Result = Map.insert(Pair);
101auto &I = Result.first->second;
102if (Result.second) {
103 Vector.push_back(std::make_pair(Key,ValueT()));
104I = Vector.size() - 1;
105 }
106return Vector[I].second;
107 }
108
109// Returns a copy of the value. Only allowed if ValueT is copyable.
110ValueTlookup(constKeyT &Key) const{
111static_assert(std::is_copy_constructible_v<ValueT>,
112"Cannot call lookup() if ValueT is not copyable.");
113typename MapType::const_iterator Pos = Map.find(Key);
114return Pos == Map.end()?ValueT() : Vector[Pos->second].second;
115 }
116
117template <typename... Ts>
118 std::pair<iterator, bool>try_emplace(constKeyT &Key, Ts &&...Args) {
119auto [It, Inserted] = Map.insert(std::make_pair(Key, 0));
120if (Inserted) {
121 It->second = Vector.size();
122 Vector.emplace_back(std::piecewise_construct, std::forward_as_tuple(Key),
123 std::forward_as_tuple(std::forward<Ts>(Args)...));
124return std::make_pair(std::prev(end()),true);
125 }
126return std::make_pair(begin() + It->second,false);
127 }
128template <typename... Ts>
129 std::pair<iterator, bool>try_emplace(KeyT &&Key, Ts &&...Args) {
130auto [It, Inserted] = Map.insert(std::make_pair(Key, 0));
131if (Inserted) {
132 It->second = Vector.size();
133 Vector.emplace_back(std::piecewise_construct,
134 std::forward_as_tuple(std::move(Key)),
135 std::forward_as_tuple(std::forward<Ts>(Args)...));
136return std::make_pair(std::prev(end()),true);
137 }
138return std::make_pair(begin() + It->second,false);
139 }
140
141 std::pair<iterator, bool>insert(const std::pair<KeyT, ValueT> &KV) {
142returntry_emplace(KV.first, KV.second);
143 }
144 std::pair<iterator, bool>insert(std::pair<KeyT, ValueT> &&KV) {
145returntry_emplace(std::move(KV.first), std::move(KV.second));
146 }
147
148template <typename V>
149 std::pair<iterator, bool>insert_or_assign(constKeyT &Key, V &&Val) {
150auto Ret =try_emplace(Key, std::forward<V>(Val));
151if (!Ret.second)
152 Ret.first->second = std::forward<V>(Val);
153return Ret;
154 }
155template <typename V>
156 std::pair<iterator, bool>insert_or_assign(KeyT &&Key, V &&Val) {
157auto Ret =try_emplace(std::move(Key), std::forward<V>(Val));
158if (!Ret.second)
159 Ret.first->second = std::forward<V>(Val);
160return Ret;
161 }
162
163boolcontains(constKeyT &Key) const{return Map.find(Key) != Map.end(); }
164
165size_typecount(constKeyT &Key) const{returncontains(Key) ? 1 : 0; }
166
167iteratorfind(constKeyT &Key) {
168typename MapType::const_iterator Pos = Map.find(Key);
169return Pos == Map.end()? Vector.end() :
170 (Vector.begin() + Pos->second);
171 }
172
173const_iteratorfind(constKeyT &Key) const{
174typename MapType::const_iterator Pos = Map.find(Key);
175return Pos == Map.end()? Vector.end() :
176 (Vector.begin() + Pos->second);
177 }
178
179 /// Remove the last element from the vector.
180voidpop_back() {
181typename MapType::iterator Pos = Map.find(Vector.back().first);
182 Map.erase(Pos);
183 Vector.pop_back();
184 }
185
186 /// Remove the element given by Iterator.
187 ///
188 /// Returns an iterator to the element following the one which was removed,
189 /// which may be end().
190 ///
191 /// \note This is a deceivingly expensive operation (linear time). It's
192 /// usually better to use \a remove_if() if possible.
193typename VectorType::iteratorerase(typename VectorType::iterator Iterator) {
194 Map.erase(Iterator->first);
195auto Next = Vector.erase(Iterator);
196if (Next == Vector.end())
197return Next;
198
199// Update indices in the map.
200size_tIndex = Next - Vector.begin();
201for (auto &I : Map) {
202assert(I.second !=Index &&"Index was already erased!");
203if (I.second >Index)
204 --I.second;
205 }
206return Next;
207 }
208
209 /// Remove all elements with the key value Key.
210 ///
211 /// Returns the number of elements removed.
212size_typeerase(constKeyT &Key) {
213auto Iterator =find(Key);
214if (Iterator ==end())
215return 0;
216erase(Iterator);
217return 1;
218 }
219
220 /// Remove the elements that match the predicate.
221 ///
222 /// Erase all elements that match \c Pred in a single pass. Takes linear
223 /// time.
224template <class Predicate>voidremove_if(Predicate Pred);
225};
226
227template <typename KeyT,typename ValueT,typename MapType,typename VectorType>
228template <class Function>
229voidMapVector<KeyT, ValueT, MapType, VectorType>::remove_if(Function Pred) {
230auto O =Vector.begin();
231for (autoI = O,E =Vector.end();I !=E; ++I) {
232if (Pred(*I)) {
233// Erase from the map.
234 Map.erase(I->first);
235continue;
236 }
237
238if (I != O) {
239// Move the value and update the index in the map.
240 *O = std::move(*I);
241 Map[O->first] = O -Vector.begin();
242 }
243 ++O;
244 }
245// Erase trailing entries in the vector.
246Vector.erase(O,Vector.end());
247}
248
249/// A MapVector that performs no allocations if smaller than a certain
250/// size.
251template <typename KeyT,typename ValueT,unsigned N>
252structSmallMapVector
253 :MapVector<KeyT, ValueT, SmallDenseMap<KeyT, unsigned, N>,
254 SmallVector<std::pair<KeyT, ValueT>, N>> {
255};
256
257}// end namespace llvm
258
259#endif// LLVM_ADT_MAPVECTOR_H
E
static GCRegistry::Add< CoreCLRGC > E("coreclr", "CoreCLR-compatible GC")
DenseMap.h
This file defines the DenseMap class.
Index
uint32_t Index
Definition:ELFObjHandler.cpp:83
I
#define I(x, y, z)
Definition:MD5.cpp:58
assert
assert(ImpDefSCC.getReg()==AMDGPU::SCC &&ImpDefSCC.isDef())
SmallVector.h
This file defines the SmallVector class.
RHS
Value * RHS
Definition:X86PartialReduction.cpp:74
KeyT
Predicate
Definition:AMDGPURegBankLegalizeRules.cpp:332
ValueT
VectorType
Definition:ItaniumDemangle.h:1173
llvm::Function
Definition:Function.h:63
llvm::MapVector
This class implements a map that also provides access to all stored values in a deterministic order.
Definition:MapVector.h:36
llvm::MapVector::try_emplace
std::pair< iterator, bool > try_emplace(KeyT &&Key, Ts &&...Args)
Definition:MapVector.h:129
llvm::MapVector::count
size_type count(const KeyT &Key) const
Definition:MapVector.h:165
llvm::MapVector::iterator
typename VectorType::iterator iterator
Definition:MapVector.h:49
llvm::MapVector::end
iterator end()
Definition:MapVector.h:71
llvm::MapVector::pop_back
void pop_back()
Remove the last element from the vector.
Definition:MapVector.h:180
llvm::MapVector::rbegin
const_reverse_iterator rbegin() const
Definition:MapVector.h:75
llvm::MapVector::swap
void swap(MapVector &RHS)
Definition:MapVector.h:93
llvm::MapVector::rend
reverse_iterator rend()
Definition:MapVector.h:76
llvm::MapVector::operator[]
ValueT & operator[](const KeyT &Key)
Definition:MapVector.h:98
llvm::MapVector::end
const_iterator end() const
Definition:MapVector.h:72
llvm::MapVector::erase
VectorType::iterator erase(typename VectorType::iterator Iterator)
Remove the element given by Iterator.
Definition:MapVector.h:193
llvm::MapVector::insert_or_assign
std::pair< iterator, bool > insert_or_assign(KeyT &&Key, V &&Val)
Definition:MapVector.h:156
llvm::MapVector::takeVector
VectorType takeVector()
Clear the MapVector and return the underlying vector.
Definition:MapVector.h:55
llvm::MapVector::size_type
typename VectorType::size_type size_type
Definition:MapVector.h:47
llvm::MapVector::back
const std::pair< KeyT, ValueT > & back() const
Definition:MapVector.h:86
llvm::MapVector::front
const std::pair< KeyT, ValueT > & front() const
Definition:MapVector.h:84
llvm::MapVector::const_reverse_iterator
typename VectorType::const_reverse_iterator const_reverse_iterator
Definition:MapVector.h:52
llvm::MapVector::value_type
typename VectorType::value_type value_type
Definition:MapVector.h:46
llvm::MapVector::find
iterator find(const KeyT &Key)
Definition:MapVector.h:167
llvm::MapVector::remove_if
void remove_if(Predicate Pred)
Remove the elements that match the predicate.
llvm::MapVector::contains
bool contains(const KeyT &Key) const
Definition:MapVector.h:163
llvm::MapVector::empty
bool empty() const
Definition:MapVector.h:79
llvm::MapVector::begin
const_iterator begin() const
Definition:MapVector.h:70
llvm::MapVector::begin
iterator begin()
Definition:MapVector.h:69
llvm::MapVector::insert_or_assign
std::pair< iterator, bool > insert_or_assign(const KeyT &Key, V &&Val)
Definition:MapVector.h:149
llvm::MapVector::find
const_iterator find(const KeyT &Key) const
Definition:MapVector.h:173
llvm::MapVector::try_emplace
std::pair< iterator, bool > try_emplace(const KeyT &Key, Ts &&...Args)
Definition:MapVector.h:118
llvm::MapVector::insert
std::pair< iterator, bool > insert(const std::pair< KeyT, ValueT > &KV)
Definition:MapVector.h:141
llvm::MapVector::lookup
ValueT lookup(const KeyT &Key) const
Definition:MapVector.h:110
llvm::MapVector::reserve
void reserve(size_type NumEntries)
Grow the MapVector so that it can contain at least NumEntries items before resizing again.
Definition:MapVector.h:64
llvm::MapVector::reverse_iterator
typename VectorType::reverse_iterator reverse_iterator
Definition:MapVector.h:51
llvm::MapVector::size
size_type size() const
Definition:MapVector.h:60
llvm::MapVector::erase
size_type erase(const KeyT &Key)
Remove all elements with the key value Key.
Definition:MapVector.h:212
llvm::MapVector::const_iterator
typename VectorType::const_iterator const_iterator
Definition:MapVector.h:50
llvm::MapVector::front
std::pair< KeyT, ValueT > & front()
Definition:MapVector.h:83
llvm::MapVector::clear
void clear()
Definition:MapVector.h:88
llvm::MapVector::insert
std::pair< iterator, bool > insert(std::pair< KeyT, ValueT > &&KV)
Definition:MapVector.h:144
llvm::MapVector::rend
const_reverse_iterator rend() const
Definition:MapVector.h:77
llvm::MapVector::rbegin
reverse_iterator rbegin()
Definition:MapVector.h:74
llvm::MapVector::back
std::pair< KeyT, ValueT > & back()
Definition:MapVector.h:85
llvm::VectorType
Base class of all SIMD vector types.
Definition:DerivedTypes.h:427
llvm
This is an optimization pass for GlobalISel generic memory operations.
Definition:AddressRanges.h:18
llvm::VFParamKind::Vector
@ Vector
std::swap
void swap(llvm::BitVector &LHS, llvm::BitVector &RHS)
Implement std::swap in terms of BitVector swap.
Definition:BitVector.h:860
llvm::SmallMapVector
A MapVector that performs no allocations if smaller than a certain size.
Definition:MapVector.h:254
Generated on Thu Jul 17 2025 04:36:33 for LLVM by doxygen 1.9.6
[8]ページ先頭
©2009-2025 Movatter.jp