std::greater by second (tools/greater_by_second.hpp)

• View this file on GitHub
• View document part on GitHub
• Last update: 2021-03-29 00:30:01+09:00
• Include: #include "tools/greater_by_second.hpp"

It compares two pairs by the second element.

Usage

std::vector<std::pair<int, int>> a;
std::sort(a.begin(), a.end(), tools::greater_by_second());

License

• CC0

Author

• anqooqie

Constructor

tools::greater_by_second comp();

It creates a comparator.

Constraints

• None

Time Complexity

• $O(1)$

operator()

template <typename T1, typename T2>
bool comp(std::pair<T1, T2> x, std::pair<T1, T2> y);

It returns true if x.second > y.second. Otherwise, it returns false.

Constraints

• None

Time Complexity

• $O(1)$

Required by

• Dijkstra's algorithm (tools/dijkstra.hpp)
• Solver of minimum-cost flow problem (tools/mcf_graph.hpp)
• Minimum Steiner tree (tools/minimum_steiner_tree.hpp)
• Matching on weighted bipartite graph (tools/weighted_bipartite_matching.hpp)

Verified with

• tests/dijkstra/directed.test.cpp
• tests/dijkstra/undirected.test.cpp
• tests/minimum_steiner_tree/no_restore.test.cpp
• tests/minimum_steiner_tree/restore.test.cpp
• tests/persistent_stack.test.cpp
• tests/weighted_bipartite_matching/maximize.test.cpp
• tests/weighted_bipartite_matching/minimize.test.cpp
• tests/weighted_bipartite_matching/multiple_calls.test.cpp

Code

#ifndef TOOLS_GREATER_BY_SECOND_HPP
#define TOOLS_GREATER_BY_SECOND_HPP

#include <utility>

namespace tools {

  class greater_by_second {
  public:
    template <class T1, class T2>
    bool operator()(const ::std::pair<T1, T2>& x, const ::std::pair<T1, T2>& y) const {
      return x.second > y.second;
    }
  };
}

#endif

#line 1 "tools/greater_by_second.hpp"



#include <utility>

namespace tools {

  class greater_by_second {
  public:
    template <class T1, class T2>
    bool operator()(const ::std::pair<T1, T2>& x, const ::std::pair<T1, T2>& y) const {
      return x.second > y.second;
    }
  };
}

Back to top page