bc933768a6
test/std/containers/Emplaceable.h test/std/containers/NotConstructible.h test/support/counting_predicates.hpp Replace unary_function/binary_function inheritance with typedefs. test/std/depr/depr.function.objects/depr.base/binary_function.pass.cpp test/std/depr/depr.function.objects/depr.base/unary_function.pass.cpp test/std/utilities/function.objects/func.require/binary_function.pass.cpp test/std/utilities/function.objects/func.require/unary_function.pass.cpp Mark these tests as requiring 98/03/11/14 because 17 removed unary_function/binary_function. test/std/thread/futures/futures.task/futures.task.members/ctor_func_alloc.pass.cpp test/std/thread/futures/futures.task/futures.task.nonmembers/uses_allocator.pass.cpp Mark these tests as requiring 11/14 because 17 removed packaged_task allocator support. test/std/utilities/function.objects/func.wrap/func.wrap.func/derive_from.pass.cpp This test doesn't need to be skipped in C++17 mode. Only the construction of std::function from an allocator needs to be skipped in C++17 mode. test/std/utilities/function.objects/refwrap/refwrap.access/conversion.pass.cpp test/std/utilities/function.objects/refwrap/refwrap.assign/copy_assign.pass.cpp test/std/utilities/function.objects/refwrap/refwrap.const/copy_ctor.pass.cpp test/std/utilities/function.objects/refwrap/refwrap.const/type_ctor.pass.cpp When testing these reference_wrapper features, unary_function inheritance is totally irrelevant. test/std/utilities/function.objects/refwrap/weak_result.pass.cpp Define and use my_unary_function/my_binary_function to test the weak result type machinery (which is still present in C++17, although deprecated). test/support/msvc_stdlib_force_include.hpp Now we can test C++17 strictly, without enabling removed features. Fixes D36503. llvm-svn: 311705
53 lines
1.4 KiB
C++
53 lines
1.4 KiB
C++
//===----------------------------------------------------------------------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is dual licensed under the MIT and the University of Illinois Open
|
|
// Source Licenses. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#ifndef __COUNTING_PREDICATES_H
|
|
#define __COUNTING_PREDICATES_H
|
|
|
|
|
|
template <typename Predicate, typename Arg>
|
|
struct unary_counting_predicate {
|
|
public:
|
|
typedef Arg argument_type;
|
|
typedef bool result_type;
|
|
|
|
unary_counting_predicate(Predicate p) : p_(p), count_(0) {}
|
|
~unary_counting_predicate() {}
|
|
|
|
bool operator () (const Arg &a) const { ++count_; return p_(a); }
|
|
size_t count() const { return count_; }
|
|
void reset() { count_ = 0; }
|
|
|
|
private:
|
|
Predicate p_;
|
|
mutable size_t count_;
|
|
};
|
|
|
|
|
|
template <typename Predicate, typename Arg1, typename Arg2=Arg1>
|
|
struct binary_counting_predicate {
|
|
public:
|
|
typedef Arg1 first_argument_type;
|
|
typedef Arg2 second_argument_type;
|
|
typedef bool result_type;
|
|
|
|
binary_counting_predicate ( Predicate p ) : p_(p), count_(0) {}
|
|
~binary_counting_predicate() {}
|
|
|
|
bool operator () (const Arg1 &a1, const Arg2 &a2) const { ++count_; return p_(a1, a2); }
|
|
size_t count() const { return count_; }
|
|
void reset() { count_ = 0; }
|
|
|
|
private:
|
|
Predicate p_;
|
|
mutable size_t count_;
|
|
};
|
|
|
|
#endif // __COUNTING_PREDICATES_H
|