tools/clang-tidy/test/performance-inefficient-algorithm.cpp

   1 namespace std {
   2 template <typename T> struct less {
   3   bool operator()(const T &lhs, const T &rhs) { return lhs < rhs; }
   4 };
   5
   6 template <typename T> struct greater {
   7   bool operator()(const T &lhs, const T &rhs) { return lhs > rhs; }
   8 };
   9
  10 struct iterator_type {};
  11
  12 template <typename K, typename Cmp = less<K>> struct set {
  13   typedef iterator_type iterator;
  14   iterator find(const K &k);
  15   unsigned count(const K &k);
  16
  17   iterator begin();
  18   iterator end();
  19   iterator begin() const;
  20   iterator end() const;
  21 };
  22
  23 template <typename FwIt, typename K>
  24 FwIt find(FwIt, FwIt end, const K &) { return end; }
  25 }
  26
  27 template <typename T> void f(const T &t) {
  28   std::set<int> s;
  29   find(s.begin(), s.end(), 46);
  30 }