Is there a check in clang-tidy to reveal the most vexing parse cases?

112 Views Asked by At

I would like to speed up the compilation time of a legacy C++ project with millions of lines of code. I didn't find any compiler benchmarks focusing on refactoring the "most vexing parse" described by Scott Meyers https://en.wikipedia.org/wiki/Most_vexing_parse I have a theory: If I was able to check my code for these cases, I could speed up the compilation. The check for the most vexing parse would be nice in clang-tidy to achieve this target. By refactoring the findings I plan to speed up the compile times. Is it worth it? What do you think?

0

There are 0 best solutions below