[C++11] Replacing iterators redecls_begin() and redecls_end() with iterator_range redecls(). Updating all of the usages of the iterators with range-based for loops, which allows the begin/end forms to be removed entirely.
llvm-svn: 203179
This commit is contained in:
@@ -1269,9 +1269,8 @@ bool LookupResult::isVisibleSlow(Sema &SemaRef, NamedDecl *D) {
|
||||
static NamedDecl *findAcceptableDecl(Sema &SemaRef, NamedDecl *D) {
|
||||
assert(!LookupResult::isVisible(SemaRef, D) && "not in slow case");
|
||||
|
||||
for (Decl::redecl_iterator RD = D->redecls_begin(), RDEnd = D->redecls_end();
|
||||
RD != RDEnd; ++RD) {
|
||||
if (NamedDecl *ND = dyn_cast<NamedDecl>(*RD)) {
|
||||
for (auto RD : D->redecls()) {
|
||||
if (auto ND = dyn_cast<NamedDecl>(RD)) {
|
||||
if (LookupResult::isVisible(SemaRef, ND))
|
||||
return ND;
|
||||
}
|
||||
|
||||
Reference in New Issue
Block a user