summaryrefslogtreecommitdiff
path: root/src/util/utility.h
diff options
context:
space:
mode:
authorMathias Preiner <mathias.preiner@gmail.com>2021-02-23 15:56:16 -0800
committerGitHub <noreply@github.com>2021-02-23 15:56:16 -0800
commit4c0dbb8ec7871ff114a9e66233cd8c8dd853f0b4 (patch)
tree3c2544cba74aed61ec65f1d06f5430a8874d5e11 /src/util/utility.h
parenteeb74f13bdf16aeda2e4d5fe7b4880cb17702fe4 (diff)
Switch to C++17. (#5959)
Co-authored-by: Gereon Kremer <nafur42@gmail.com>
Diffstat (limited to 'src/util/utility.h')
-rw-r--r--src/util/utility.h24
1 files changed, 0 insertions, 24 deletions
diff --git a/src/util/utility.h b/src/util/utility.h
index 6cf8bb3f4..549b98d66 100644
--- a/src/util/utility.h
+++ b/src/util/utility.h
@@ -30,30 +30,6 @@ namespace CVC4 {
/**
- * Like std::equal_to<>, but tests equality between the first element
- * of a pair and an element.
- */
-template <class T, class U>
-struct first_equal_to : std::binary_function<std::pair<T, U>, T, bool> {
- bool operator()(const std::pair<T, U>& pr, const T& x) const {
- return pr.first == x;
- }
-};/* struct first_equal_to<T> */
-
-
-/**
- * Like std::equal_to<>, but tests equality between the second element
- * of a pair and an element.
- */
-template <class T, class U>
-struct second_equal_to : std::binary_function<std::pair<T, U>, U, bool> {
- bool operator()(const std::pair<T, U>& pr, const U& x) const {
- return pr.second == x;
- }
-};/* struct first_equal_to<T> */
-
-
-/**
* Using std::find_if(), finds the first iterator in [first,last)
* range that satisfies predicate. If none, return last; otherwise,
* search for a second one. If there IS a second one, return last,
generated by cgit on debian on lair
contact matthew@masot.net with questions or feedback