Skip to content

[ADT] Rename variable names in IndexedMap (NFC) #164925

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Oct 24, 2025
+18 −18
Merged

[ADT] Rename variable names in IndexedMap (NFC) #164925

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
36 changes: 18 additions & 18 deletions llvm/include/llvm/ADT/IndexedMap.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -43,40 +43,40 @@ class IndexedMap {
// is trivially copyable.
using StorageT = SmallVector<T, 0>;

StorageT storage_;
T nullVal_ = T();
ToIndexT toIndex_;
StorageT Storage;
T NullVal = T();
ToIndexT ToIndex;

public:
IndexedMap() = default;

explicit IndexedMap(const T &val) : nullVal_(val) {}
explicit IndexedMap(const T &Val) : NullVal(Val) {}

typename StorageT::reference operator[](IndexT n) {
assert(toIndex_(n) < storage_.size() && "index out of bounds!");
return storage_[toIndex_(n)];
typename StorageT::reference operator[](IndexT N) {
assert(ToIndex(N) < Storage.size() && "index out of bounds!");
return Storage[ToIndex(N)];
}

typename StorageT::const_reference operator[](IndexT n) const {
assert(toIndex_(n) < storage_.size() && "index out of bounds!");
return storage_[toIndex_(n)];
typename StorageT::const_reference operator[](IndexT N) const {
assert(ToIndex(N) < Storage.size() && "index out of bounds!");
return Storage[ToIndex(N)];
}

void reserve(typename StorageT::size_type s) { storage_.reserve(s); }
void reserve(typename StorageT::size_type S) { Storage.reserve(S); }

void resize(typename StorageT::size_type s) { storage_.resize(s, nullVal_); }
void resize(typename StorageT::size_type S) { Storage.resize(S, NullVal); }

void clear() { storage_.clear(); }
void clear() { Storage.clear(); }

void grow(IndexT n) {
unsigned NewSize = toIndex_(n) + 1;
if (NewSize > storage_.size())
void grow(IndexT N) {
unsigned NewSize = ToIndex(N) + 1;
if (NewSize > Storage.size())
resize(NewSize);
}

bool inBounds(IndexT n) const { return toIndex_(n) < storage_.size(); }
bool inBounds(IndexT N) const { return ToIndex(N) < Storage.size(); }

typename StorageT::size_type size() const { return storage_.size(); }
typename StorageT::size_type size() const { return Storage.size(); }
};

} // namespace llvm
Expand Down