Gabor Horvath | 3880bee | 2015-02-07 19:54:19 +0000 | [diff] [blame^] | 1 | //===--- InefficientAlgorithmCheck.h - clang-tidy----------------*- C++ -*-===// |
| 2 | // |
| 3 | // The LLVM Compiler Infrastructure |
| 4 | // |
| 5 | // This file is distributed under the University of Illinois Open Source |
| 6 | // License. See LICENSE.TXT for details. |
| 7 | // |
| 8 | //===----------------------------------------------------------------------===// |
| 9 | |
| 10 | #ifndef LLVM_CLANG_TOOLS_EXTRA_CLANG_TIDY_MISC_INEFFICIENT_ALGORITHM_H |
| 11 | #define LLVM_CLANG_TOOLS_EXTRA_CLANG_TIDY_MISC_INEFFICIENT_ALGORITHM_H |
| 12 | |
| 13 | #include "../ClangTidy.h" |
| 14 | |
| 15 | namespace clang { |
| 16 | namespace tidy { |
| 17 | |
| 18 | /// \brief Warns on inefficient use of STL algorithms on associative containers. |
| 19 | /// |
| 20 | /// Associative containers implements some of the algorithms as methods which |
| 21 | /// should be preferred to the algorithms in the algorithm header. The methods |
| 22 | /// can take advanatage of the order of the elements. |
| 23 | class InefficientAlgorithmCheck : public ClangTidyCheck { |
| 24 | public: |
| 25 | InefficientAlgorithmCheck(StringRef Name, ClangTidyContext *Context) |
| 26 | : ClangTidyCheck(Name, Context) {} |
| 27 | void registerMatchers(ast_matchers::MatchFinder *Finder) override; |
| 28 | void check(const ast_matchers::MatchFinder::MatchResult &Result) override; |
| 29 | }; |
| 30 | |
| 31 | } // namespace tidy |
| 32 | } // namespace clang |
| 33 | |
| 34 | #endif // LLVM_CLANG_TOOLS_EXTRA_CLANG_TIDY_MISC_INEFFICIENT_ALGORITHM_H |