!QSet::intersects() is much much faster
Git commit f88cee2a4193b8250e9745f1ce22192d225251c7 by Sergio Martins. Committed on 06/12/2015 at 12:28. Pushed by smartins into branch 'master'. Introduce qset-intersects check QSet::intersects() is much faster than QSet::interect().isEmpty(). The later allocates memory and does a full iteration. The former bails our early and doesn't allocate. This check is hidden while Qt 5.6 isn't released. M +1 -0 CMakeLists.txt A +7 -0 checks/README-qset-intersects A +70 -0 checks/qset-intersects.cpp [License: GPL (v2+) (+Qt exception)] A +47 -0 checks/qset-intersects.h [License: GPL (v2+) (+Qt exception)] M +11 -11 tests/clazy/test_requested_checks.sh.expected A +8 -0 tests/qset-intersects/config.json A +8 -0 tests/qset-intersects/main.cpp [License: UNKNOWN] * A +1 -0 tests/qset-intersects/main.cpp.expected The files marked with a * at the end have a non valid license. Please read: http://techbase.kde.org/Policies/Licensing_Policy and use the headers which are listed at that page. http://commits.kde.org/clazy/f88cee2a4193b8250e9745f1ce22192d225251c7