rusyaev-roman added a comment. In sum, this change brings the following improvements for all graph traversal iterators that are used in 'range-based for loop':
- avoid creating an empty iterator (that holds containers inside) to compare with the end iterator - make 'empty()' call explicit (instead of comparing two containers of iterators) when an iterator is compared with the end iterator Repository: rG LLVM Github Monorepo CHANGES SINCE LAST ACTION https://reviews.llvm.org/D131448/new/ https://reviews.llvm.org/D131448 _______________________________________________ cfe-commits mailing list cfe-commits@lists.llvm.org https://lists.llvm.org/cgi-bin/mailman/listinfo/cfe-commits
