|  | //===--- InefficientAlgorithmCheck.h - clang-tidy----------------*- C++ -*-===// | 
|  | // | 
|  | // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. | 
|  | // See https://llvm.org/LICENSE.txt for license information. | 
|  | // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception | 
|  | // | 
|  | //===----------------------------------------------------------------------===// | 
|  |  | 
|  | #ifndef LLVM_CLANG_TOOLS_EXTRA_CLANG_TIDY_PERFORMANCE_INEFFICIENTALGORITHMCHECK_H | 
|  | #define LLVM_CLANG_TOOLS_EXTRA_CLANG_TIDY_PERFORMANCE_INEFFICIENTALGORITHMCHECK_H | 
|  |  | 
|  | #include "../ClangTidyCheck.h" | 
|  |  | 
|  | namespace clang::tidy::performance { | 
|  |  | 
|  | /// Warns on inefficient use of STL algorithms on associative containers. | 
|  | /// | 
|  | /// Associative containers implements some of the algorithms as methods which | 
|  | /// should be preferred to the algorithms in the algorithm header. The methods | 
|  | /// can take advantage of the order of the elements. | 
|  | class InefficientAlgorithmCheck : public ClangTidyCheck { | 
|  | public: | 
|  | InefficientAlgorithmCheck(StringRef Name, ClangTidyContext *Context) | 
|  | : ClangTidyCheck(Name, Context) {} | 
|  | bool isLanguageVersionSupported(const LangOptions &LangOpts) const override { | 
|  | return LangOpts.CPlusPlus; | 
|  | } | 
|  | void registerMatchers(ast_matchers::MatchFinder *Finder) override; | 
|  | void check(const ast_matchers::MatchFinder::MatchResult &Result) override; | 
|  | std::optional<TraversalKind> getCheckTraversalKind() const override { | 
|  | return TK_IgnoreUnlessSpelledInSource; | 
|  | } | 
|  | }; | 
|  |  | 
|  | } // namespace clang::tidy::performance | 
|  |  | 
|  | #endif // LLVM_CLANG_TOOLS_EXTRA_CLANG_TIDY_PERFORMANCE_INEFFICIENTALGORITHMCHECK_H |