2008-12-10 05:08:54 +00:00
|
|
|
// This file was GENERATED by a script. DO NOT EDIT BY HAND!!!
|
|
|
|
|
|
|
|
// Copyright 2008, Google Inc.
|
|
|
|
// All rights reserved.
|
|
|
|
//
|
|
|
|
// Redistribution and use in source and binary forms, with or without
|
|
|
|
// modification, are permitted provided that the following conditions are
|
|
|
|
// met:
|
|
|
|
//
|
|
|
|
// * Redistributions of source code must retain the above copyright
|
|
|
|
// notice, this list of conditions and the following disclaimer.
|
|
|
|
// * Redistributions in binary form must reproduce the above
|
|
|
|
// copyright notice, this list of conditions and the following disclaimer
|
|
|
|
// in the documentation and/or other materials provided with the
|
|
|
|
// distribution.
|
|
|
|
// * Neither the name of Google Inc. nor the names of its
|
|
|
|
// contributors may be used to endorse or promote products derived from
|
|
|
|
// this software without specific prior written permission.
|
|
|
|
//
|
|
|
|
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
|
|
// "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
|
|
// LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
|
|
// A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
|
|
|
// OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
|
|
|
// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
|
|
|
// LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
|
|
|
// DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
|
|
|
// THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
|
|
|
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
|
|
|
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
|
|
|
|
// Google Mock - a framework for writing C++ mock classes.
|
|
|
|
//
|
|
|
|
// This file implements some commonly used variadic matchers.
|
|
|
|
|
|
|
|
#ifndef GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_MATCHERS_H_
|
|
|
|
#define GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_MATCHERS_H_
|
|
|
|
|
|
|
|
#include <sstream>
|
|
|
|
#include <string>
|
|
|
|
#include <vector>
|
|
|
|
#include <gmock/gmock-matchers.h>
|
|
|
|
|
|
|
|
namespace testing {
|
|
|
|
namespace internal {
|
|
|
|
|
2009-02-12 01:34:27 +00:00
|
|
|
// Generates a non-fatal failure iff 'description' is not a valid
|
|
|
|
// matcher description.
|
|
|
|
inline void ValidateMatcherDescription(const char* description) {
|
|
|
|
EXPECT_STREQ("", description)
|
|
|
|
<< "The description string in a MATCHER*() macro must be \"\" "
|
|
|
|
"at this moment. We will implement custom description string soon.";
|
|
|
|
}
|
|
|
|
|
2008-12-10 05:08:54 +00:00
|
|
|
// Implements ElementsAre() and ElementsAreArray().
|
|
|
|
template <typename Container>
|
|
|
|
class ElementsAreMatcherImpl : public MatcherInterface<Container> {
|
|
|
|
public:
|
|
|
|
typedef GMOCK_REMOVE_CONST(GMOCK_REMOVE_REFERENCE(Container)) RawContainer;
|
|
|
|
typedef typename RawContainer::value_type Element;
|
|
|
|
|
|
|
|
// Constructs the matcher from a sequence of element values or
|
|
|
|
// element matchers.
|
|
|
|
template <typename InputIter>
|
|
|
|
ElementsAreMatcherImpl(InputIter first, size_t count) {
|
|
|
|
matchers_.reserve(count);
|
|
|
|
InputIter it = first;
|
|
|
|
for (size_t i = 0; i != count; ++i, ++it) {
|
|
|
|
matchers_.push_back(MatcherCast<const Element&>(*it));
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Returns true iff 'container' matches.
|
|
|
|
virtual bool Matches(Container container) const {
|
|
|
|
if (container.size() != count())
|
|
|
|
return false;
|
|
|
|
|
|
|
|
typename RawContainer::const_iterator container_iter = container.begin();
|
|
|
|
for (size_t i = 0; i != count(); ++container_iter, ++i) {
|
|
|
|
if (!matchers_[i].Matches(*container_iter))
|
|
|
|
return false;
|
|
|
|
}
|
|
|
|
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
// Describes what this matcher does.
|
|
|
|
virtual void DescribeTo(::std::ostream* os) const {
|
|
|
|
if (count() == 0) {
|
|
|
|
*os << "is empty";
|
|
|
|
} else if (count() == 1) {
|
|
|
|
*os << "has 1 element that ";
|
|
|
|
matchers_[0].DescribeTo(os);
|
|
|
|
} else {
|
|
|
|
*os << "has " << Elements(count()) << " where\n";
|
|
|
|
for (size_t i = 0; i != count(); ++i) {
|
|
|
|
*os << "element " << i << " ";
|
|
|
|
matchers_[i].DescribeTo(os);
|
|
|
|
if (i + 1 < count()) {
|
|
|
|
*os << ",\n";
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Describes what the negation of this matcher does.
|
|
|
|
virtual void DescribeNegationTo(::std::ostream* os) const {
|
|
|
|
if (count() == 0) {
|
|
|
|
*os << "is not empty";
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
*os << "does not have " << Elements(count()) << ", or\n";
|
|
|
|
for (size_t i = 0; i != count(); ++i) {
|
|
|
|
*os << "element " << i << " ";
|
|
|
|
matchers_[i].DescribeNegationTo(os);
|
|
|
|
if (i + 1 < count()) {
|
|
|
|
*os << ", or\n";
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// Explains why 'container' matches, or doesn't match, this matcher.
|
|
|
|
virtual void ExplainMatchResultTo(Container container,
|
|
|
|
::std::ostream* os) const {
|
|
|
|
if (Matches(container)) {
|
|
|
|
// We need to explain why *each* element matches (the obvious
|
|
|
|
// ones can be skipped).
|
|
|
|
|
|
|
|
bool reason_printed = false;
|
|
|
|
typename RawContainer::const_iterator container_iter = container.begin();
|
|
|
|
for (size_t i = 0; i != count(); ++container_iter, ++i) {
|
|
|
|
::std::stringstream ss;
|
|
|
|
matchers_[i].ExplainMatchResultTo(*container_iter, &ss);
|
|
|
|
|
|
|
|
const string s = ss.str();
|
|
|
|
if (!s.empty()) {
|
|
|
|
if (reason_printed) {
|
|
|
|
*os << ",\n";
|
|
|
|
}
|
|
|
|
*os << "element " << i << " " << s;
|
|
|
|
reason_printed = true;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
} else {
|
|
|
|
// We need to explain why the container doesn't match.
|
|
|
|
const size_t actual_count = container.size();
|
|
|
|
if (actual_count != count()) {
|
|
|
|
// The element count doesn't match. If the container is
|
|
|
|
// empty, there's no need to explain anything as Google Mock
|
|
|
|
// already prints the empty container. Otherwise we just need
|
|
|
|
// to show how many elements there actually are.
|
|
|
|
if (actual_count != 0) {
|
|
|
|
*os << "has " << Elements(actual_count);
|
|
|
|
}
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
// The container has the right size but at least one element
|
|
|
|
// doesn't match expectation. We need to find this element and
|
|
|
|
// explain why it doesn't match.
|
|
|
|
typename RawContainer::const_iterator container_iter = container.begin();
|
|
|
|
for (size_t i = 0; i != count(); ++container_iter, ++i) {
|
|
|
|
if (matchers_[i].Matches(*container_iter)) {
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
*os << "element " << i << " doesn't match";
|
|
|
|
|
|
|
|
::std::stringstream ss;
|
|
|
|
matchers_[i].ExplainMatchResultTo(*container_iter, &ss);
|
|
|
|
const string s = ss.str();
|
|
|
|
if (!s.empty()) {
|
|
|
|
*os << " (" << s << ")";
|
|
|
|
}
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
static Message Elements(size_t count) {
|
|
|
|
return Message() << count << (count == 1 ? " element" : " elements");
|
|
|
|
}
|
|
|
|
|
|
|
|
size_t count() const { return matchers_.size(); }
|
|
|
|
std::vector<Matcher<const Element&> > matchers_;
|
|
|
|
};
|
|
|
|
|
|
|
|
// Implements ElementsAre() of 0-10 arguments.
|
|
|
|
|
|
|
|
class ElementsAreMatcher0 {
|
|
|
|
public:
|
|
|
|
ElementsAreMatcher0() {}
|
|
|
|
|
|
|
|
template <typename Container>
|
|
|
|
operator Matcher<Container>() const {
|
|
|
|
typedef GMOCK_REMOVE_CONST(GMOCK_REMOVE_REFERENCE(Container)) RawContainer;
|
|
|
|
typedef typename RawContainer::value_type Element;
|
|
|
|
|
|
|
|
const Matcher<const Element&>* const matchers = NULL;
|
|
|
|
return MakeMatcher(new ElementsAreMatcherImpl<Container>(matchers, 0));
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
|
|
|
template <typename T1>
|
|
|
|
class ElementsAreMatcher1 {
|
|
|
|
public:
|
|
|
|
explicit ElementsAreMatcher1(const T1& e1) : e1_(e1) {}
|
|
|
|
|
|
|
|
template <typename Container>
|
|
|
|
operator Matcher<Container>() const {
|
|
|
|
typedef GMOCK_REMOVE_CONST(GMOCK_REMOVE_REFERENCE(Container)) RawContainer;
|
|
|
|
typedef typename RawContainer::value_type Element;
|
|
|
|
|
|
|
|
const Matcher<const Element&> matchers[] = {
|
|
|
|
MatcherCast<const Element&>(e1_),
|
|
|
|
};
|
|
|
|
|
|
|
|
return MakeMatcher(new ElementsAreMatcherImpl<Container>(matchers, 1));
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
const T1& e1_;
|
|
|
|
};
|
|
|
|
|
|
|
|
template <typename T1, typename T2>
|
|
|
|
class ElementsAreMatcher2 {
|
|
|
|
public:
|
|
|
|
ElementsAreMatcher2(const T1& e1, const T2& e2) : e1_(e1), e2_(e2) {}
|
|
|
|
|
|
|
|
template <typename Container>
|
|
|
|
operator Matcher<Container>() const {
|
|
|
|
typedef GMOCK_REMOVE_CONST(GMOCK_REMOVE_REFERENCE(Container)) RawContainer;
|
|
|
|
typedef typename RawContainer::value_type Element;
|
|
|
|
|
|
|
|
const Matcher<const Element&> matchers[] = {
|
|
|
|
MatcherCast<const Element&>(e1_),
|
|
|
|
MatcherCast<const Element&>(e2_),
|
|
|
|
};
|
|
|
|
|
|
|
|
return MakeMatcher(new ElementsAreMatcherImpl<Container>(matchers, 2));
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
const T1& e1_;
|
|
|
|
const T2& e2_;
|
|
|
|
};
|
|
|
|
|
|
|
|
template <typename T1, typename T2, typename T3>
|
|
|
|
class ElementsAreMatcher3 {
|
|
|
|
public:
|
|
|
|
ElementsAreMatcher3(const T1& e1, const T2& e2, const T3& e3) : e1_(e1),
|
|
|
|
e2_(e2), e3_(e3) {}
|
|
|
|
|
|
|
|
template <typename Container>
|
|
|
|
operator Matcher<Container>() const {
|
|
|
|
typedef GMOCK_REMOVE_CONST(GMOCK_REMOVE_REFERENCE(Container)) RawContainer;
|
|
|
|
typedef typename RawContainer::value_type Element;
|
|
|
|
|
|
|
|
const Matcher<const Element&> matchers[] = {
|
|
|
|
MatcherCast<const Element&>(e1_),
|
|
|
|
MatcherCast<const Element&>(e2_),
|
|
|
|
MatcherCast<const Element&>(e3_),
|
|
|
|
};
|
|
|
|
|
|
|
|
return MakeMatcher(new ElementsAreMatcherImpl<Container>(matchers, 3));
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
const T1& e1_;
|
|
|
|
const T2& e2_;
|
|
|
|
const T3& e3_;
|
|
|
|
};
|
|
|
|
|
|
|
|
template <typename T1, typename T2, typename T3, typename T4>
|
|
|
|
class ElementsAreMatcher4 {
|
|
|
|
public:
|
|
|
|
ElementsAreMatcher4(const T1& e1, const T2& e2, const T3& e3,
|
|
|
|
const T4& e4) : e1_(e1), e2_(e2), e3_(e3), e4_(e4) {}
|
|
|
|
|
|
|
|
template <typename Container>
|
|
|
|
operator Matcher<Container>() const {
|
|
|
|
typedef GMOCK_REMOVE_CONST(GMOCK_REMOVE_REFERENCE(Container)) RawContainer;
|
|
|
|
typedef typename RawContainer::value_type Element;
|
|
|
|
|
|
|
|
const Matcher<const Element&> matchers[] = {
|
|
|
|
MatcherCast<const Element&>(e1_),
|
|
|
|
MatcherCast<const Element&>(e2_),
|
|
|
|
MatcherCast<const Element&>(e3_),
|
|
|
|
MatcherCast<const Element&>(e4_),
|
|
|
|
};
|
|
|
|
|
|
|
|
return MakeMatcher(new ElementsAreMatcherImpl<Container>(matchers, 4));
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
const T1& e1_;
|
|
|
|
const T2& e2_;
|
|
|
|
const T3& e3_;
|
|
|
|
const T4& e4_;
|
|
|
|
};
|
|
|
|
|
|
|
|
template <typename T1, typename T2, typename T3, typename T4, typename T5>
|
|
|
|
class ElementsAreMatcher5 {
|
|
|
|
public:
|
|
|
|
ElementsAreMatcher5(const T1& e1, const T2& e2, const T3& e3, const T4& e4,
|
|
|
|
const T5& e5) : e1_(e1), e2_(e2), e3_(e3), e4_(e4), e5_(e5) {}
|
|
|
|
|
|
|
|
template <typename Container>
|
|
|
|
operator Matcher<Container>() const {
|
|
|
|
typedef GMOCK_REMOVE_CONST(GMOCK_REMOVE_REFERENCE(Container)) RawContainer;
|
|
|
|
typedef typename RawContainer::value_type Element;
|
|
|
|
|
|
|
|
const Matcher<const Element&> matchers[] = {
|
|
|
|
MatcherCast<const Element&>(e1_),
|
|
|
|
MatcherCast<const Element&>(e2_),
|
|
|
|
MatcherCast<const Element&>(e3_),
|
|
|
|
MatcherCast<const Element&>(e4_),
|
|
|
|
MatcherCast<const Element&>(e5_),
|
|
|
|
};
|
|
|
|
|
|
|
|
return MakeMatcher(new ElementsAreMatcherImpl<Container>(matchers, 5));
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
const T1& e1_;
|
|
|
|
const T2& e2_;
|
|
|
|
const T3& e3_;
|
|
|
|
const T4& e4_;
|
|
|
|
const T5& e5_;
|
|
|
|
};
|
|
|
|
|
|
|
|
template <typename T1, typename T2, typename T3, typename T4, typename T5,
|
|
|
|
typename T6>
|
|
|
|
class ElementsAreMatcher6 {
|
|
|
|
public:
|
|
|
|
ElementsAreMatcher6(const T1& e1, const T2& e2, const T3& e3, const T4& e4,
|
|
|
|
const T5& e5, const T6& e6) : e1_(e1), e2_(e2), e3_(e3), e4_(e4),
|
|
|
|
e5_(e5), e6_(e6) {}
|
|
|
|
|
|
|
|
template <typename Container>
|
|
|
|
operator Matcher<Container>() const {
|
|
|
|
typedef GMOCK_REMOVE_CONST(GMOCK_REMOVE_REFERENCE(Container)) RawContainer;
|
|
|
|
typedef typename RawContainer::value_type Element;
|
|
|
|
|
|
|
|
const Matcher<const Element&> matchers[] = {
|
|
|
|
MatcherCast<const Element&>(e1_),
|
|
|
|
MatcherCast<const Element&>(e2_),
|
|
|
|
MatcherCast<const Element&>(e3_),
|
|
|
|
MatcherCast<const Element&>(e4_),
|
|
|
|
MatcherCast<const Element&>(e5_),
|
|
|
|
MatcherCast<const Element&>(e6_),
|
|
|
|
};
|
|
|
|
|
|
|
|
return MakeMatcher(new ElementsAreMatcherImpl<Container>(matchers, 6));
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
const T1& e1_;
|
|
|
|
const T2& e2_;
|
|
|
|
const T3& e3_;
|
|
|
|
const T4& e4_;
|
|
|
|
const T5& e5_;
|
|
|
|
const T6& e6_;
|
|
|
|
};
|
|
|
|
|
|
|
|
template <typename T1, typename T2, typename T3, typename T4, typename T5,
|
|
|
|
typename T6, typename T7>
|
|
|
|
class ElementsAreMatcher7 {
|
|
|
|
public:
|
|
|
|
ElementsAreMatcher7(const T1& e1, const T2& e2, const T3& e3, const T4& e4,
|
|
|
|
const T5& e5, const T6& e6, const T7& e7) : e1_(e1), e2_(e2), e3_(e3),
|
|
|
|
e4_(e4), e5_(e5), e6_(e6), e7_(e7) {}
|
|
|
|
|
|
|
|
template <typename Container>
|
|
|
|
operator Matcher<Container>() const {
|
|
|
|
typedef GMOCK_REMOVE_CONST(GMOCK_REMOVE_REFERENCE(Container)) RawContainer;
|
|
|
|
typedef typename RawContainer::value_type Element;
|
|
|
|
|
|
|
|
const Matcher<const Element&> matchers[] = {
|
|
|
|
MatcherCast<const Element&>(e1_),
|
|
|
|
MatcherCast<const Element&>(e2_),
|
|
|
|
MatcherCast<const Element&>(e3_),
|
|
|
|
MatcherCast<const Element&>(e4_),
|
|
|
|
MatcherCast<const Element&>(e5_),
|
|
|
|
MatcherCast<const Element&>(e6_),
|
|
|
|
MatcherCast<const Element&>(e7_),
|
|
|
|
};
|
|
|
|
|
|
|
|
return MakeMatcher(new ElementsAreMatcherImpl<Container>(matchers, 7));
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
const T1& e1_;
|
|
|
|
const T2& e2_;
|
|
|
|
const T3& e3_;
|
|
|
|
const T4& e4_;
|
|
|
|
const T5& e5_;
|
|
|
|
const T6& e6_;
|
|
|
|
const T7& e7_;
|
|
|
|
};
|
|
|
|
|
|
|
|
template <typename T1, typename T2, typename T3, typename T4, typename T5,
|
|
|
|
typename T6, typename T7, typename T8>
|
|
|
|
class ElementsAreMatcher8 {
|
|
|
|
public:
|
|
|
|
ElementsAreMatcher8(const T1& e1, const T2& e2, const T3& e3, const T4& e4,
|
|
|
|
const T5& e5, const T6& e6, const T7& e7, const T8& e8) : e1_(e1),
|
|
|
|
e2_(e2), e3_(e3), e4_(e4), e5_(e5), e6_(e6), e7_(e7), e8_(e8) {}
|
|
|
|
|
|
|
|
template <typename Container>
|
|
|
|
operator Matcher<Container>() const {
|
|
|
|
typedef GMOCK_REMOVE_CONST(GMOCK_REMOVE_REFERENCE(Container)) RawContainer;
|
|
|
|
typedef typename RawContainer::value_type Element;
|
|
|
|
|
|
|
|
const Matcher<const Element&> matchers[] = {
|
|
|
|
MatcherCast<const Element&>(e1_),
|
|
|
|
MatcherCast<const Element&>(e2_),
|
|
|
|
MatcherCast<const Element&>(e3_),
|
|
|
|
MatcherCast<const Element&>(e4_),
|
|
|
|
MatcherCast<const Element&>(e5_),
|
|
|
|
MatcherCast<const Element&>(e6_),
|
|
|
|
MatcherCast<const Element&>(e7_),
|
|
|
|
MatcherCast<const Element&>(e8_),
|
|
|
|
};
|
|
|
|
|
|
|
|
return MakeMatcher(new ElementsAreMatcherImpl<Container>(matchers, 8));
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
const T1& e1_;
|
|
|
|
const T2& e2_;
|
|
|
|
const T3& e3_;
|
|
|
|
const T4& e4_;
|
|
|
|
const T5& e5_;
|
|
|
|
const T6& e6_;
|
|
|
|
const T7& e7_;
|
|
|
|
const T8& e8_;
|
|
|
|
};
|
|
|
|
|
|
|
|
template <typename T1, typename T2, typename T3, typename T4, typename T5,
|
|
|
|
typename T6, typename T7, typename T8, typename T9>
|
|
|
|
class ElementsAreMatcher9 {
|
|
|
|
public:
|
|
|
|
ElementsAreMatcher9(const T1& e1, const T2& e2, const T3& e3, const T4& e4,
|
|
|
|
const T5& e5, const T6& e6, const T7& e7, const T8& e8,
|
|
|
|
const T9& e9) : e1_(e1), e2_(e2), e3_(e3), e4_(e4), e5_(e5), e6_(e6),
|
|
|
|
e7_(e7), e8_(e8), e9_(e9) {}
|
|
|
|
|
|
|
|
template <typename Container>
|
|
|
|
operator Matcher<Container>() const {
|
|
|
|
typedef GMOCK_REMOVE_CONST(GMOCK_REMOVE_REFERENCE(Container)) RawContainer;
|
|
|
|
typedef typename RawContainer::value_type Element;
|
|
|
|
|
|
|
|
const Matcher<const Element&> matchers[] = {
|
|
|
|
MatcherCast<const Element&>(e1_),
|
|
|
|
MatcherCast<const Element&>(e2_),
|
|
|
|
MatcherCast<const Element&>(e3_),
|
|
|
|
MatcherCast<const Element&>(e4_),
|
|
|
|
MatcherCast<const Element&>(e5_),
|
|
|
|
MatcherCast<const Element&>(e6_),
|
|
|
|
MatcherCast<const Element&>(e7_),
|
|
|
|
MatcherCast<const Element&>(e8_),
|
|
|
|
MatcherCast<const Element&>(e9_),
|
|
|
|
};
|
|
|
|
|
|
|
|
return MakeMatcher(new ElementsAreMatcherImpl<Container>(matchers, 9));
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
const T1& e1_;
|
|
|
|
const T2& e2_;
|
|
|
|
const T3& e3_;
|
|
|
|
const T4& e4_;
|
|
|
|
const T5& e5_;
|
|
|
|
const T6& e6_;
|
|
|
|
const T7& e7_;
|
|
|
|
const T8& e8_;
|
|
|
|
const T9& e9_;
|
|
|
|
};
|
|
|
|
|
|
|
|
template <typename T1, typename T2, typename T3, typename T4, typename T5,
|
|
|
|
typename T6, typename T7, typename T8, typename T9, typename T10>
|
|
|
|
class ElementsAreMatcher10 {
|
|
|
|
public:
|
|
|
|
ElementsAreMatcher10(const T1& e1, const T2& e2, const T3& e3, const T4& e4,
|
|
|
|
const T5& e5, const T6& e6, const T7& e7, const T8& e8, const T9& e9,
|
|
|
|
const T10& e10) : e1_(e1), e2_(e2), e3_(e3), e4_(e4), e5_(e5), e6_(e6),
|
|
|
|
e7_(e7), e8_(e8), e9_(e9), e10_(e10) {}
|
|
|
|
|
|
|
|
template <typename Container>
|
|
|
|
operator Matcher<Container>() const {
|
|
|
|
typedef GMOCK_REMOVE_CONST(GMOCK_REMOVE_REFERENCE(Container)) RawContainer;
|
|
|
|
typedef typename RawContainer::value_type Element;
|
|
|
|
|
|
|
|
const Matcher<const Element&> matchers[] = {
|
|
|
|
MatcherCast<const Element&>(e1_),
|
|
|
|
MatcherCast<const Element&>(e2_),
|
|
|
|
MatcherCast<const Element&>(e3_),
|
|
|
|
MatcherCast<const Element&>(e4_),
|
|
|
|
MatcherCast<const Element&>(e5_),
|
|
|
|
MatcherCast<const Element&>(e6_),
|
|
|
|
MatcherCast<const Element&>(e7_),
|
|
|
|
MatcherCast<const Element&>(e8_),
|
|
|
|
MatcherCast<const Element&>(e9_),
|
|
|
|
MatcherCast<const Element&>(e10_),
|
|
|
|
};
|
|
|
|
|
|
|
|
return MakeMatcher(new ElementsAreMatcherImpl<Container>(matchers, 10));
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
const T1& e1_;
|
|
|
|
const T2& e2_;
|
|
|
|
const T3& e3_;
|
|
|
|
const T4& e4_;
|
|
|
|
const T5& e5_;
|
|
|
|
const T6& e6_;
|
|
|
|
const T7& e7_;
|
|
|
|
const T8& e8_;
|
|
|
|
const T9& e9_;
|
|
|
|
const T10& e10_;
|
|
|
|
};
|
|
|
|
|
|
|
|
// Implements ElementsAreArray().
|
|
|
|
template <typename T>
|
|
|
|
class ElementsAreArrayMatcher {
|
|
|
|
public:
|
|
|
|
ElementsAreArrayMatcher(const T* first, size_t count) :
|
|
|
|
first_(first), count_(count) {}
|
|
|
|
|
|
|
|
template <typename Container>
|
|
|
|
operator Matcher<Container>() const {
|
|
|
|
typedef GMOCK_REMOVE_CONST(GMOCK_REMOVE_REFERENCE(Container)) RawContainer;
|
|
|
|
typedef typename RawContainer::value_type Element;
|
|
|
|
|
|
|
|
return MakeMatcher(new ElementsAreMatcherImpl<Container>(first_, count_));
|
|
|
|
}
|
|
|
|
|
|
|
|
private:
|
|
|
|
const T* const first_;
|
|
|
|
const size_t count_;
|
|
|
|
};
|
|
|
|
|
|
|
|
} // namespace internal
|
|
|
|
|
|
|
|
// ElementsAre(e0, e1, ..., e_n) matches an STL-style container with
|
|
|
|
// (n + 1) elements, where the i-th element in the container must
|
|
|
|
// match the i-th argument in the list. Each argument of
|
|
|
|
// ElementsAre() can be either a value or a matcher. We support up to
|
|
|
|
// 10 arguments.
|
|
|
|
//
|
|
|
|
// NOTE: Since ElementsAre() cares about the order of the elements, it
|
|
|
|
// must not be used with containers whose elements's order is
|
|
|
|
// undefined (e.g. hash_map).
|
|
|
|
|
|
|
|
inline internal::ElementsAreMatcher0 ElementsAre() {
|
|
|
|
return internal::ElementsAreMatcher0();
|
|
|
|
}
|
|
|
|
|
|
|
|
template <typename T1>
|
|
|
|
inline internal::ElementsAreMatcher1<T1> ElementsAre(const T1& e1) {
|
|
|
|
return internal::ElementsAreMatcher1<T1>(e1);
|
|
|
|
}
|
|
|
|
|
|
|
|
template <typename T1, typename T2>
|
|
|
|
inline internal::ElementsAreMatcher2<T1, T2> ElementsAre(const T1& e1,
|
|
|
|
const T2& e2) {
|
|
|
|
return internal::ElementsAreMatcher2<T1, T2>(e1, e2);
|
|
|
|
}
|
|
|
|
|
|
|
|
template <typename T1, typename T2, typename T3>
|
|
|
|
inline internal::ElementsAreMatcher3<T1, T2, T3> ElementsAre(const T1& e1,
|
|
|
|
const T2& e2, const T3& e3) {
|
|
|
|
return internal::ElementsAreMatcher3<T1, T2, T3>(e1, e2, e3);
|
|
|
|
}
|
|
|
|
|
|
|
|
template <typename T1, typename T2, typename T3, typename T4>
|
|
|
|
inline internal::ElementsAreMatcher4<T1, T2, T3, T4> ElementsAre(const T1& e1,
|
|
|
|
const T2& e2, const T3& e3, const T4& e4) {
|
|
|
|
return internal::ElementsAreMatcher4<T1, T2, T3, T4>(e1, e2, e3, e4);
|
|
|
|
}
|
|
|
|
|
|
|
|
template <typename T1, typename T2, typename T3, typename T4, typename T5>
|
|
|
|
inline internal::ElementsAreMatcher5<T1, T2, T3, T4,
|
|
|
|
T5> ElementsAre(const T1& e1, const T2& e2, const T3& e3, const T4& e4,
|
|
|
|
const T5& e5) {
|
|
|
|
return internal::ElementsAreMatcher5<T1, T2, T3, T4, T5>(e1, e2, e3, e4, e5);
|
|
|
|
}
|
|
|
|
|
|
|
|
template <typename T1, typename T2, typename T3, typename T4, typename T5,
|
|
|
|
typename T6>
|
|
|
|
inline internal::ElementsAreMatcher6<T1, T2, T3, T4, T5,
|
|
|
|
T6> ElementsAre(const T1& e1, const T2& e2, const T3& e3, const T4& e4,
|
|
|
|
const T5& e5, const T6& e6) {
|
|
|
|
return internal::ElementsAreMatcher6<T1, T2, T3, T4, T5, T6>(e1, e2, e3, e4,
|
|
|
|
e5, e6);
|
|
|
|
}
|
|
|
|
|
|
|
|
template <typename T1, typename T2, typename T3, typename T4, typename T5,
|
|
|
|
typename T6, typename T7>
|
|
|
|
inline internal::ElementsAreMatcher7<T1, T2, T3, T4, T5, T6,
|
|
|
|
T7> ElementsAre(const T1& e1, const T2& e2, const T3& e3, const T4& e4,
|
|
|
|
const T5& e5, const T6& e6, const T7& e7) {
|
|
|
|
return internal::ElementsAreMatcher7<T1, T2, T3, T4, T5, T6, T7>(e1, e2, e3,
|
|
|
|
e4, e5, e6, e7);
|
|
|
|
}
|
|
|
|
|
|
|
|
template <typename T1, typename T2, typename T3, typename T4, typename T5,
|
|
|
|
typename T6, typename T7, typename T8>
|
|
|
|
inline internal::ElementsAreMatcher8<T1, T2, T3, T4, T5, T6, T7,
|
|
|
|
T8> ElementsAre(const T1& e1, const T2& e2, const T3& e3, const T4& e4,
|
|
|
|
const T5& e5, const T6& e6, const T7& e7, const T8& e8) {
|
|
|
|
return internal::ElementsAreMatcher8<T1, T2, T3, T4, T5, T6, T7, T8>(e1, e2,
|
|
|
|
e3, e4, e5, e6, e7, e8);
|
|
|
|
}
|
|
|
|
|
|
|
|
template <typename T1, typename T2, typename T3, typename T4, typename T5,
|
|
|
|
typename T6, typename T7, typename T8, typename T9>
|
|
|
|
inline internal::ElementsAreMatcher9<T1, T2, T3, T4, T5, T6, T7, T8,
|
|
|
|
T9> ElementsAre(const T1& e1, const T2& e2, const T3& e3, const T4& e4,
|
|
|
|
const T5& e5, const T6& e6, const T7& e7, const T8& e8, const T9& e9) {
|
|
|
|
return internal::ElementsAreMatcher9<T1, T2, T3, T4, T5, T6, T7, T8, T9>(e1,
|
|
|
|
e2, e3, e4, e5, e6, e7, e8, e9);
|
|
|
|
}
|
|
|
|
|
|
|
|
template <typename T1, typename T2, typename T3, typename T4, typename T5,
|
|
|
|
typename T6, typename T7, typename T8, typename T9, typename T10>
|
|
|
|
inline internal::ElementsAreMatcher10<T1, T2, T3, T4, T5, T6, T7, T8, T9,
|
|
|
|
T10> ElementsAre(const T1& e1, const T2& e2, const T3& e3, const T4& e4,
|
|
|
|
const T5& e5, const T6& e6, const T7& e7, const T8& e8, const T9& e9,
|
|
|
|
const T10& e10) {
|
|
|
|
return internal::ElementsAreMatcher10<T1, T2, T3, T4, T5, T6, T7, T8, T9,
|
|
|
|
T10>(e1, e2, e3, e4, e5, e6, e7, e8, e9, e10);
|
|
|
|
}
|
|
|
|
|
|
|
|
// ElementsAreArray(array) and ElementAreArray(array, count) are like
|
|
|
|
// ElementsAre(), except that they take an array of values or
|
|
|
|
// matchers. The former form infers the size of 'array', which must
|
|
|
|
// be a static C-style array. In the latter form, 'array' can either
|
|
|
|
// be a static array or a pointer to a dynamically created array.
|
|
|
|
|
|
|
|
template <typename T>
|
|
|
|
inline internal::ElementsAreArrayMatcher<T> ElementsAreArray(
|
|
|
|
const T* first, size_t count) {
|
|
|
|
return internal::ElementsAreArrayMatcher<T>(first, count);
|
|
|
|
}
|
|
|
|
|
|
|
|
template <typename T, size_t N>
|
|
|
|
inline internal::ElementsAreArrayMatcher<T>
|
|
|
|
ElementsAreArray(const T (&array)[N]) {
|
|
|
|
return internal::ElementsAreArrayMatcher<T>(array, N);
|
|
|
|
}
|
|
|
|
|
|
|
|
} // namespace testing
|
|
|
|
|
2009-02-12 01:34:27 +00:00
|
|
|
// The MATCHER* family of macros can be used in a namespace scope to
|
|
|
|
// define custom matchers easily. The syntax:
|
|
|
|
//
|
|
|
|
// MATCHER(name, description_string) { statements; }
|
|
|
|
//
|
|
|
|
// will define a matcher with the given name that executes the
|
|
|
|
// statements, which must return a bool to indicate if the match
|
|
|
|
// succeeds. For now, the description_string must be "", but we'll
|
|
|
|
// allow other values soon. Inside the statements, you can refer to
|
|
|
|
// the value being matched by 'arg', and refer to its type by
|
|
|
|
// 'arg_type'. For example:
|
|
|
|
//
|
|
|
|
// MATCHER(IsEven, "") { return (arg % 2) == 0; }
|
|
|
|
//
|
|
|
|
// allows you to write
|
|
|
|
//
|
|
|
|
// // Expects mock_foo.Bar(n) to be called where n is even.
|
|
|
|
// EXPECT_CALL(mock_foo, Bar(IsEven()));
|
|
|
|
//
|
|
|
|
// or,
|
|
|
|
//
|
|
|
|
// // Verifies that the value of some_expression is even.
|
|
|
|
// EXPECT_THAT(some_expression, IsEven());
|
|
|
|
//
|
|
|
|
// If the above assertion fails, it will print something like:
|
|
|
|
//
|
|
|
|
// Value of: some_expression
|
|
|
|
// Expected: is even
|
|
|
|
// Actual: 7
|
|
|
|
//
|
|
|
|
// where the description "is even" is automatically calculated from the
|
|
|
|
// matcher name IsEven.
|
|
|
|
//
|
|
|
|
// Note that the type of the value being matched (arg_type) is
|
|
|
|
// determined by the context in which you use the matcher and is
|
|
|
|
// supplied to you by the compiler, so you don't need to worry about
|
|
|
|
// declaring it (nor can you). This allows the matcher to be
|
|
|
|
// polymorphic. For example, IsEven() can be used to match any type
|
|
|
|
// where the value of "(arg % 2) == 0" can be implicitly converted to
|
|
|
|
// a bool. In the "Bar(IsEven())" example above, if method Bar()
|
|
|
|
// takes an int, 'arg_type' will be int; if it takes an unsigned long,
|
|
|
|
// 'arg_type' will be unsigned long; and so on.
|
|
|
|
//
|
|
|
|
// Sometimes you'll want to parameterize the matcher. For that you
|
|
|
|
// can use another macro:
|
|
|
|
//
|
|
|
|
// MATCHER_P(name, param_name, description_string) { statements; }
|
|
|
|
//
|
|
|
|
// For example:
|
|
|
|
//
|
|
|
|
// MATCHER_P(HasAbsoluteValue, value, "") { return abs(arg) == value; }
|
|
|
|
//
|
|
|
|
// will allow you to write:
|
|
|
|
//
|
|
|
|
// EXPECT_THAT(Blah("a"), HasAbsoluteValue(n));
|
|
|
|
//
|
|
|
|
// which may lead to this message (assuming n is 10):
|
|
|
|
//
|
|
|
|
// Value of: Blah("a")
|
|
|
|
// Expected: has absolute value 10
|
|
|
|
// Actual: -9
|
|
|
|
//
|
|
|
|
// Note that both the matcher description and its parameter are
|
|
|
|
// printed, making the message human-friendly.
|
|
|
|
//
|
|
|
|
// In the matcher definition body, you can write 'foo_type' to
|
|
|
|
// reference the type of a parameter named 'foo'. For example, in the
|
|
|
|
// body of MATCHER_P(HasAbsoluteValue, value) above, you can write
|
|
|
|
// 'value_type' to refer to the type of 'value'.
|
|
|
|
//
|
|
|
|
// We also provide MATCHER_P2, MATCHER_P3, ..., up to MATCHER_P10 to
|
|
|
|
// support multi-parameter matchers.
|
|
|
|
//
|
|
|
|
// For the purpose of typing, you can view
|
|
|
|
//
|
|
|
|
// MATCHER_Pk(Foo, p1, ..., pk, description_string) { ... }
|
|
|
|
//
|
|
|
|
// as shorthand for
|
|
|
|
//
|
|
|
|
// template <typename p1_type, ..., typename pk_type>
|
|
|
|
// FooMatcherPk<p1_type, ..., pk_type>
|
|
|
|
// Foo(p1_type p1, ..., pk_type pk) { ... }
|
|
|
|
//
|
|
|
|
// When you write Foo(v1, ..., vk), the compiler infers the types of
|
|
|
|
// the parameters v1, ..., and vk for you. If you are not happy with
|
|
|
|
// the result of the type inference, you can specify the types by
|
|
|
|
// explicitly instantiating the template, as in Foo<long, bool>(5,
|
|
|
|
// false). As said earlier, you don't get to (or need to) specify
|
|
|
|
// 'arg_type' as that's determined by the context in which the matcher
|
|
|
|
// is used. You can assign the result of expression Foo(p1, ..., pk)
|
|
|
|
// to a variable of type FooMatcherPk<p1_type, ..., pk_type>. This
|
|
|
|
// can be useful when composing matchers.
|
|
|
|
//
|
|
|
|
// While you can instantiate a matcher template with reference types,
|
|
|
|
// passing the parameters by pointer usually makes your code more
|
|
|
|
// readable. If, however, you still want to pass a parameter by
|
|
|
|
// reference, be aware that in the failure message generated by the
|
|
|
|
// matcher you will see the value of the referenced object but not its
|
|
|
|
// address.
|
|
|
|
//
|
|
|
|
// You can overload matchers with different numbers of parameters:
|
|
|
|
//
|
|
|
|
// MATCHER_P(Blah, a, description_string1) { ... }
|
|
|
|
// MATCHER_P2(Blah, a, b, description_string2) { ... }
|
|
|
|
//
|
|
|
|
// While it's tempting to always use the MATCHER* macros when defining
|
|
|
|
// a new matcher, you should also consider implementing
|
|
|
|
// MatcherInterface or using MakePolymorphicMatcher() instead,
|
|
|
|
// especially if you need to use the matcher a lot. While these
|
|
|
|
// approaches require more work, they give you more control on the
|
|
|
|
// types of the value being matched and the matcher parameters, which
|
|
|
|
// in general leads to better compiler error messages that pay off in
|
|
|
|
// the long run. They also allow overloading matchers based on
|
|
|
|
// parameter types (as opposed to just based on the number of
|
|
|
|
// parameters).
|
|
|
|
//
|
|
|
|
// CAVEAT:
|
|
|
|
//
|
|
|
|
// MATCHER*() can only be used in a namespace scope. The reason is
|
|
|
|
// that C++ doesn't yet allow function-local types to be used to
|
|
|
|
// instantiate templates. The up-coming C++0x standard will fix this.
|
|
|
|
// Once that's done, we'll consider supporting using MATCHER*() inside
|
|
|
|
// a function.
|
|
|
|
//
|
|
|
|
// MORE INFORMATION:
|
|
|
|
//
|
|
|
|
// To learn more about using these macros, please search for 'MATCHER'
|
|
|
|
// on http://code.google.com/p/googlemock/wiki/CookBook.
|
|
|
|
|
|
|
|
#define MATCHER(name, description)\
|
|
|
|
class name##Matcher {\
|
|
|
|
public:\
|
|
|
|
template <typename arg_type>\
|
|
|
|
class gmock_Impl : public ::testing::MatcherInterface<arg_type> {\
|
|
|
|
public:\
|
|
|
|
gmock_Impl() {}\
|
|
|
|
virtual bool Matches(arg_type arg) const;\
|
|
|
|
virtual void DescribeTo(::std::ostream* os) const {\
|
|
|
|
*os << ::testing::internal::ConvertIdentifierNameToWords(#name);\
|
|
|
|
}\
|
|
|
|
};\
|
|
|
|
template <typename arg_type>\
|
|
|
|
operator ::testing::Matcher<arg_type>() const {\
|
|
|
|
return ::testing::Matcher<arg_type>(new gmock_Impl<arg_type>());\
|
|
|
|
}\
|
|
|
|
name##Matcher() {\
|
|
|
|
::testing::internal::ValidateMatcherDescription(description);\
|
|
|
|
}\
|
|
|
|
};\
|
|
|
|
inline name##Matcher name() {\
|
|
|
|
return name##Matcher();\
|
|
|
|
}\
|
|
|
|
template <typename arg_type>\
|
|
|
|
bool name##Matcher::\
|
|
|
|
gmock_Impl<arg_type>::Matches(arg_type arg) const
|
|
|
|
|
|
|
|
#define MATCHER_P(name, p0, description)\
|
|
|
|
template <typename p0##_type>\
|
|
|
|
class name##MatcherP {\
|
|
|
|
public:\
|
|
|
|
template <typename arg_type>\
|
|
|
|
class gmock_Impl : public ::testing::MatcherInterface<arg_type> {\
|
|
|
|
public:\
|
|
|
|
explicit gmock_Impl(p0##_type gmock_p0) : p0(gmock_p0) {}\
|
|
|
|
virtual bool Matches(arg_type arg) const;\
|
|
|
|
virtual void DescribeTo(::std::ostream* os) const {\
|
|
|
|
*os << ::testing::internal::ConvertIdentifierNameToWords(#name);\
|
|
|
|
*os << " ";\
|
|
|
|
::testing::internal::UniversalPrint(p0, os);\
|
|
|
|
}\
|
|
|
|
p0##_type p0;\
|
|
|
|
};\
|
|
|
|
template <typename arg_type>\
|
|
|
|
operator ::testing::Matcher<arg_type>() const {\
|
|
|
|
return ::testing::Matcher<arg_type>(new gmock_Impl<arg_type>(p0));\
|
|
|
|
}\
|
|
|
|
name##MatcherP(p0##_type gmock_p0) : p0(gmock_p0) {\
|
|
|
|
::testing::internal::ValidateMatcherDescription(description);\
|
|
|
|
}\
|
|
|
|
p0##_type p0;\
|
|
|
|
};\
|
|
|
|
template <typename p0##_type>\
|
|
|
|
inline name##MatcherP<p0##_type> name(p0##_type p0) {\
|
|
|
|
return name##MatcherP<p0##_type>(p0);\
|
|
|
|
}\
|
|
|
|
template <typename p0##_type>\
|
|
|
|
template <typename arg_type>\
|
|
|
|
bool name##MatcherP<p0##_type>::\
|
|
|
|
gmock_Impl<arg_type>::Matches(arg_type arg) const
|
|
|
|
|
|
|
|
#define MATCHER_P2(name, p0, p1, description)\
|
|
|
|
template <typename p0##_type, typename p1##_type>\
|
|
|
|
class name##MatcherP2 {\
|
|
|
|
public:\
|
|
|
|
template <typename arg_type>\
|
|
|
|
class gmock_Impl : public ::testing::MatcherInterface<arg_type> {\
|
|
|
|
public:\
|
|
|
|
gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1) : p0(gmock_p0), \
|
|
|
|
p1(gmock_p1) {}\
|
|
|
|
virtual bool Matches(arg_type arg) const;\
|
|
|
|
virtual void DescribeTo(::std::ostream* os) const {\
|
|
|
|
*os << ::testing::internal::ConvertIdentifierNameToWords(#name);\
|
|
|
|
*os << " (";\
|
|
|
|
::testing::internal::UniversalPrint(p0, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p1, os);\
|
|
|
|
*os << ")";\
|
|
|
|
}\
|
|
|
|
p0##_type p0;\
|
|
|
|
p1##_type p1;\
|
|
|
|
};\
|
|
|
|
template <typename arg_type>\
|
|
|
|
operator ::testing::Matcher<arg_type>() const {\
|
|
|
|
return ::testing::Matcher<arg_type>(new gmock_Impl<arg_type>(p0, p1));\
|
|
|
|
}\
|
|
|
|
name##MatcherP2(p0##_type gmock_p0, p1##_type gmock_p1) : p0(gmock_p0), \
|
|
|
|
p1(gmock_p1) {\
|
|
|
|
::testing::internal::ValidateMatcherDescription(description);\
|
|
|
|
}\
|
|
|
|
p0##_type p0;\
|
|
|
|
p1##_type p1;\
|
|
|
|
};\
|
|
|
|
template <typename p0##_type, typename p1##_type>\
|
|
|
|
inline name##MatcherP2<p0##_type, p1##_type> name(p0##_type p0, \
|
|
|
|
p1##_type p1) {\
|
|
|
|
return name##MatcherP2<p0##_type, p1##_type>(p0, p1);\
|
|
|
|
}\
|
|
|
|
template <typename p0##_type, typename p1##_type>\
|
|
|
|
template <typename arg_type>\
|
|
|
|
bool name##MatcherP2<p0##_type, p1##_type>::\
|
|
|
|
gmock_Impl<arg_type>::Matches(arg_type arg) const
|
|
|
|
|
|
|
|
#define MATCHER_P3(name, p0, p1, p2, description)\
|
|
|
|
template <typename p0##_type, typename p1##_type, typename p2##_type>\
|
|
|
|
class name##MatcherP3 {\
|
|
|
|
public:\
|
|
|
|
template <typename arg_type>\
|
|
|
|
class gmock_Impl : public ::testing::MatcherInterface<arg_type> {\
|
|
|
|
public:\
|
|
|
|
gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1, \
|
|
|
|
p2##_type gmock_p2) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2) {}\
|
|
|
|
virtual bool Matches(arg_type arg) const;\
|
|
|
|
virtual void DescribeTo(::std::ostream* os) const {\
|
|
|
|
*os << ::testing::internal::ConvertIdentifierNameToWords(#name);\
|
|
|
|
*os << " (";\
|
|
|
|
::testing::internal::UniversalPrint(p0, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p1, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p2, os);\
|
|
|
|
*os << ")";\
|
|
|
|
}\
|
|
|
|
p0##_type p0;\
|
|
|
|
p1##_type p1;\
|
|
|
|
p2##_type p2;\
|
|
|
|
};\
|
|
|
|
template <typename arg_type>\
|
|
|
|
operator ::testing::Matcher<arg_type>() const {\
|
|
|
|
return ::testing::Matcher<arg_type>(new gmock_Impl<arg_type>(p0, p1, \
|
|
|
|
p2));\
|
|
|
|
}\
|
|
|
|
name##MatcherP3(p0##_type gmock_p0, p1##_type gmock_p1, \
|
|
|
|
p2##_type gmock_p2) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2) {\
|
|
|
|
::testing::internal::ValidateMatcherDescription(description);\
|
|
|
|
}\
|
|
|
|
p0##_type p0;\
|
|
|
|
p1##_type p1;\
|
|
|
|
p2##_type p2;\
|
|
|
|
};\
|
|
|
|
template <typename p0##_type, typename p1##_type, typename p2##_type>\
|
|
|
|
inline name##MatcherP3<p0##_type, p1##_type, p2##_type> name(p0##_type p0, \
|
|
|
|
p1##_type p1, p2##_type p2) {\
|
|
|
|
return name##MatcherP3<p0##_type, p1##_type, p2##_type>(p0, p1, p2);\
|
|
|
|
}\
|
|
|
|
template <typename p0##_type, typename p1##_type, typename p2##_type>\
|
|
|
|
template <typename arg_type>\
|
|
|
|
bool name##MatcherP3<p0##_type, p1##_type, p2##_type>::\
|
|
|
|
gmock_Impl<arg_type>::Matches(arg_type arg) const
|
|
|
|
|
|
|
|
#define MATCHER_P4(name, p0, p1, p2, p3, description)\
|
|
|
|
template <typename p0##_type, typename p1##_type, typename p2##_type, \
|
|
|
|
typename p3##_type>\
|
|
|
|
class name##MatcherP4 {\
|
|
|
|
public:\
|
|
|
|
template <typename arg_type>\
|
|
|
|
class gmock_Impl : public ::testing::MatcherInterface<arg_type> {\
|
|
|
|
public:\
|
|
|
|
gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \
|
|
|
|
p3##_type gmock_p3) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \
|
|
|
|
p3(gmock_p3) {}\
|
|
|
|
virtual bool Matches(arg_type arg) const;\
|
|
|
|
virtual void DescribeTo(::std::ostream* os) const {\
|
|
|
|
*os << ::testing::internal::ConvertIdentifierNameToWords(#name);\
|
|
|
|
*os << " (";\
|
|
|
|
::testing::internal::UniversalPrint(p0, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p1, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p2, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p3, os);\
|
|
|
|
*os << ")";\
|
|
|
|
}\
|
|
|
|
p0##_type p0;\
|
|
|
|
p1##_type p1;\
|
|
|
|
p2##_type p2;\
|
|
|
|
p3##_type p3;\
|
|
|
|
};\
|
|
|
|
template <typename arg_type>\
|
|
|
|
operator ::testing::Matcher<arg_type>() const {\
|
|
|
|
return ::testing::Matcher<arg_type>(new gmock_Impl<arg_type>(p0, p1, \
|
|
|
|
p2, p3));\
|
|
|
|
}\
|
|
|
|
name##MatcherP4(p0##_type gmock_p0, p1##_type gmock_p1, \
|
|
|
|
p2##_type gmock_p2, p3##_type gmock_p3) : p0(gmock_p0), p1(gmock_p1), \
|
|
|
|
p2(gmock_p2), p3(gmock_p3) {\
|
|
|
|
::testing::internal::ValidateMatcherDescription(description);\
|
|
|
|
}\
|
|
|
|
p0##_type p0;\
|
|
|
|
p1##_type p1;\
|
|
|
|
p2##_type p2;\
|
|
|
|
p3##_type p3;\
|
|
|
|
};\
|
|
|
|
template <typename p0##_type, typename p1##_type, typename p2##_type, \
|
|
|
|
typename p3##_type>\
|
|
|
|
inline name##MatcherP4<p0##_type, p1##_type, p2##_type, \
|
|
|
|
p3##_type> name(p0##_type p0, p1##_type p1, p2##_type p2, \
|
|
|
|
p3##_type p3) {\
|
|
|
|
return name##MatcherP4<p0##_type, p1##_type, p2##_type, p3##_type>(p0, \
|
|
|
|
p1, p2, p3);\
|
|
|
|
}\
|
|
|
|
template <typename p0##_type, typename p1##_type, typename p2##_type, \
|
|
|
|
typename p3##_type>\
|
|
|
|
template <typename arg_type>\
|
|
|
|
bool name##MatcherP4<p0##_type, p1##_type, p2##_type, p3##_type>::\
|
|
|
|
gmock_Impl<arg_type>::Matches(arg_type arg) const
|
|
|
|
|
|
|
|
#define MATCHER_P5(name, p0, p1, p2, p3, p4, description)\
|
|
|
|
template <typename p0##_type, typename p1##_type, typename p2##_type, \
|
|
|
|
typename p3##_type, typename p4##_type>\
|
|
|
|
class name##MatcherP5 {\
|
|
|
|
public:\
|
|
|
|
template <typename arg_type>\
|
|
|
|
class gmock_Impl : public ::testing::MatcherInterface<arg_type> {\
|
|
|
|
public:\
|
|
|
|
gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \
|
|
|
|
p3##_type gmock_p3, p4##_type gmock_p4) : p0(gmock_p0), \
|
|
|
|
p1(gmock_p1), p2(gmock_p2), p3(gmock_p3), p4(gmock_p4) {}\
|
|
|
|
virtual bool Matches(arg_type arg) const;\
|
|
|
|
virtual void DescribeTo(::std::ostream* os) const {\
|
|
|
|
*os << ::testing::internal::ConvertIdentifierNameToWords(#name);\
|
|
|
|
*os << " (";\
|
|
|
|
::testing::internal::UniversalPrint(p0, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p1, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p2, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p3, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p4, os);\
|
|
|
|
*os << ")";\
|
|
|
|
}\
|
|
|
|
p0##_type p0;\
|
|
|
|
p1##_type p1;\
|
|
|
|
p2##_type p2;\
|
|
|
|
p3##_type p3;\
|
|
|
|
p4##_type p4;\
|
|
|
|
};\
|
|
|
|
template <typename arg_type>\
|
|
|
|
operator ::testing::Matcher<arg_type>() const {\
|
|
|
|
return ::testing::Matcher<arg_type>(new gmock_Impl<arg_type>(p0, p1, \
|
|
|
|
p2, p3, p4));\
|
|
|
|
}\
|
|
|
|
name##MatcherP5(p0##_type gmock_p0, p1##_type gmock_p1, \
|
|
|
|
p2##_type gmock_p2, p3##_type gmock_p3, \
|
|
|
|
p4##_type gmock_p4) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \
|
|
|
|
p3(gmock_p3), p4(gmock_p4) {\
|
|
|
|
::testing::internal::ValidateMatcherDescription(description);\
|
|
|
|
}\
|
|
|
|
p0##_type p0;\
|
|
|
|
p1##_type p1;\
|
|
|
|
p2##_type p2;\
|
|
|
|
p3##_type p3;\
|
|
|
|
p4##_type p4;\
|
|
|
|
};\
|
|
|
|
template <typename p0##_type, typename p1##_type, typename p2##_type, \
|
|
|
|
typename p3##_type, typename p4##_type>\
|
|
|
|
inline name##MatcherP5<p0##_type, p1##_type, p2##_type, p3##_type, \
|
|
|
|
p4##_type> name(p0##_type p0, p1##_type p1, p2##_type p2, p3##_type p3, \
|
|
|
|
p4##_type p4) {\
|
|
|
|
return name##MatcherP5<p0##_type, p1##_type, p2##_type, p3##_type, \
|
|
|
|
p4##_type>(p0, p1, p2, p3, p4);\
|
|
|
|
}\
|
|
|
|
template <typename p0##_type, typename p1##_type, typename p2##_type, \
|
|
|
|
typename p3##_type, typename p4##_type>\
|
|
|
|
template <typename arg_type>\
|
|
|
|
bool name##MatcherP5<p0##_type, p1##_type, p2##_type, p3##_type, p4##_type>::\
|
|
|
|
gmock_Impl<arg_type>::Matches(arg_type arg) const
|
|
|
|
|
|
|
|
#define MATCHER_P6(name, p0, p1, p2, p3, p4, p5, description)\
|
|
|
|
template <typename p0##_type, typename p1##_type, typename p2##_type, \
|
|
|
|
typename p3##_type, typename p4##_type, typename p5##_type>\
|
|
|
|
class name##MatcherP6 {\
|
|
|
|
public:\
|
|
|
|
template <typename arg_type>\
|
|
|
|
class gmock_Impl : public ::testing::MatcherInterface<arg_type> {\
|
|
|
|
public:\
|
|
|
|
gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \
|
|
|
|
p3##_type gmock_p3, p4##_type gmock_p4, \
|
|
|
|
p5##_type gmock_p5) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \
|
|
|
|
p3(gmock_p3), p4(gmock_p4), p5(gmock_p5) {}\
|
|
|
|
virtual bool Matches(arg_type arg) const;\
|
|
|
|
virtual void DescribeTo(::std::ostream* os) const {\
|
|
|
|
*os << ::testing::internal::ConvertIdentifierNameToWords(#name);\
|
|
|
|
*os << " (";\
|
|
|
|
::testing::internal::UniversalPrint(p0, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p1, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p2, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p3, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p4, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p5, os);\
|
|
|
|
*os << ")";\
|
|
|
|
}\
|
|
|
|
p0##_type p0;\
|
|
|
|
p1##_type p1;\
|
|
|
|
p2##_type p2;\
|
|
|
|
p3##_type p3;\
|
|
|
|
p4##_type p4;\
|
|
|
|
p5##_type p5;\
|
|
|
|
};\
|
|
|
|
template <typename arg_type>\
|
|
|
|
operator ::testing::Matcher<arg_type>() const {\
|
|
|
|
return ::testing::Matcher<arg_type>(new gmock_Impl<arg_type>(p0, p1, \
|
|
|
|
p2, p3, p4, p5));\
|
|
|
|
}\
|
|
|
|
name##MatcherP6(p0##_type gmock_p0, p1##_type gmock_p1, \
|
|
|
|
p2##_type gmock_p2, p3##_type gmock_p3, p4##_type gmock_p4, \
|
|
|
|
p5##_type gmock_p5) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \
|
|
|
|
p3(gmock_p3), p4(gmock_p4), p5(gmock_p5) {\
|
|
|
|
::testing::internal::ValidateMatcherDescription(description);\
|
|
|
|
}\
|
|
|
|
p0##_type p0;\
|
|
|
|
p1##_type p1;\
|
|
|
|
p2##_type p2;\
|
|
|
|
p3##_type p3;\
|
|
|
|
p4##_type p4;\
|
|
|
|
p5##_type p5;\
|
|
|
|
};\
|
|
|
|
template <typename p0##_type, typename p1##_type, typename p2##_type, \
|
|
|
|
typename p3##_type, typename p4##_type, typename p5##_type>\
|
|
|
|
inline name##MatcherP6<p0##_type, p1##_type, p2##_type, p3##_type, \
|
|
|
|
p4##_type, p5##_type> name(p0##_type p0, p1##_type p1, p2##_type p2, \
|
|
|
|
p3##_type p3, p4##_type p4, p5##_type p5) {\
|
|
|
|
return name##MatcherP6<p0##_type, p1##_type, p2##_type, p3##_type, \
|
|
|
|
p4##_type, p5##_type>(p0, p1, p2, p3, p4, p5);\
|
|
|
|
}\
|
|
|
|
template <typename p0##_type, typename p1##_type, typename p2##_type, \
|
|
|
|
typename p3##_type, typename p4##_type, typename p5##_type>\
|
|
|
|
template <typename arg_type>\
|
|
|
|
bool name##MatcherP6<p0##_type, p1##_type, p2##_type, p3##_type, p4##_type, \
|
|
|
|
p5##_type>::\
|
|
|
|
gmock_Impl<arg_type>::Matches(arg_type arg) const
|
|
|
|
|
|
|
|
#define MATCHER_P7(name, p0, p1, p2, p3, p4, p5, p6, description)\
|
|
|
|
template <typename p0##_type, typename p1##_type, typename p2##_type, \
|
|
|
|
typename p3##_type, typename p4##_type, typename p5##_type, \
|
|
|
|
typename p6##_type>\
|
|
|
|
class name##MatcherP7 {\
|
|
|
|
public:\
|
|
|
|
template <typename arg_type>\
|
|
|
|
class gmock_Impl : public ::testing::MatcherInterface<arg_type> {\
|
|
|
|
public:\
|
|
|
|
gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \
|
|
|
|
p3##_type gmock_p3, p4##_type gmock_p4, p5##_type gmock_p5, \
|
|
|
|
p6##_type gmock_p6) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \
|
|
|
|
p3(gmock_p3), p4(gmock_p4), p5(gmock_p5), p6(gmock_p6) {}\
|
|
|
|
virtual bool Matches(arg_type arg) const;\
|
|
|
|
virtual void DescribeTo(::std::ostream* os) const {\
|
|
|
|
*os << ::testing::internal::ConvertIdentifierNameToWords(#name);\
|
|
|
|
*os << " (";\
|
|
|
|
::testing::internal::UniversalPrint(p0, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p1, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p2, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p3, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p4, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p5, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p6, os);\
|
|
|
|
*os << ")";\
|
|
|
|
}\
|
|
|
|
p0##_type p0;\
|
|
|
|
p1##_type p1;\
|
|
|
|
p2##_type p2;\
|
|
|
|
p3##_type p3;\
|
|
|
|
p4##_type p4;\
|
|
|
|
p5##_type p5;\
|
|
|
|
p6##_type p6;\
|
|
|
|
};\
|
|
|
|
template <typename arg_type>\
|
|
|
|
operator ::testing::Matcher<arg_type>() const {\
|
|
|
|
return ::testing::Matcher<arg_type>(new gmock_Impl<arg_type>(p0, p1, \
|
|
|
|
p2, p3, p4, p5, p6));\
|
|
|
|
}\
|
|
|
|
name##MatcherP7(p0##_type gmock_p0, p1##_type gmock_p1, \
|
|
|
|
p2##_type gmock_p2, p3##_type gmock_p3, p4##_type gmock_p4, \
|
|
|
|
p5##_type gmock_p5, p6##_type gmock_p6) : p0(gmock_p0), p1(gmock_p1), \
|
|
|
|
p2(gmock_p2), p3(gmock_p3), p4(gmock_p4), p5(gmock_p5), \
|
|
|
|
p6(gmock_p6) {\
|
|
|
|
::testing::internal::ValidateMatcherDescription(description);\
|
|
|
|
}\
|
|
|
|
p0##_type p0;\
|
|
|
|
p1##_type p1;\
|
|
|
|
p2##_type p2;\
|
|
|
|
p3##_type p3;\
|
|
|
|
p4##_type p4;\
|
|
|
|
p5##_type p5;\
|
|
|
|
p6##_type p6;\
|
|
|
|
};\
|
|
|
|
template <typename p0##_type, typename p1##_type, typename p2##_type, \
|
|
|
|
typename p3##_type, typename p4##_type, typename p5##_type, \
|
|
|
|
typename p6##_type>\
|
|
|
|
inline name##MatcherP7<p0##_type, p1##_type, p2##_type, p3##_type, \
|
|
|
|
p4##_type, p5##_type, p6##_type> name(p0##_type p0, p1##_type p1, \
|
|
|
|
p2##_type p2, p3##_type p3, p4##_type p4, p5##_type p5, \
|
|
|
|
p6##_type p6) {\
|
|
|
|
return name##MatcherP7<p0##_type, p1##_type, p2##_type, p3##_type, \
|
|
|
|
p4##_type, p5##_type, p6##_type>(p0, p1, p2, p3, p4, p5, p6);\
|
|
|
|
}\
|
|
|
|
template <typename p0##_type, typename p1##_type, typename p2##_type, \
|
|
|
|
typename p3##_type, typename p4##_type, typename p5##_type, \
|
|
|
|
typename p6##_type>\
|
|
|
|
template <typename arg_type>\
|
|
|
|
bool name##MatcherP7<p0##_type, p1##_type, p2##_type, p3##_type, p4##_type, \
|
|
|
|
p5##_type, p6##_type>::\
|
|
|
|
gmock_Impl<arg_type>::Matches(arg_type arg) const
|
|
|
|
|
|
|
|
#define MATCHER_P8(name, p0, p1, p2, p3, p4, p5, p6, p7, description)\
|
|
|
|
template <typename p0##_type, typename p1##_type, typename p2##_type, \
|
|
|
|
typename p3##_type, typename p4##_type, typename p5##_type, \
|
|
|
|
typename p6##_type, typename p7##_type>\
|
|
|
|
class name##MatcherP8 {\
|
|
|
|
public:\
|
|
|
|
template <typename arg_type>\
|
|
|
|
class gmock_Impl : public ::testing::MatcherInterface<arg_type> {\
|
|
|
|
public:\
|
|
|
|
gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \
|
|
|
|
p3##_type gmock_p3, p4##_type gmock_p4, p5##_type gmock_p5, \
|
|
|
|
p6##_type gmock_p6, p7##_type gmock_p7) : p0(gmock_p0), \
|
|
|
|
p1(gmock_p1), p2(gmock_p2), p3(gmock_p3), p4(gmock_p4), \
|
|
|
|
p5(gmock_p5), p6(gmock_p6), p7(gmock_p7) {}\
|
|
|
|
virtual bool Matches(arg_type arg) const;\
|
|
|
|
virtual void DescribeTo(::std::ostream* os) const {\
|
|
|
|
*os << ::testing::internal::ConvertIdentifierNameToWords(#name);\
|
|
|
|
*os << " (";\
|
|
|
|
::testing::internal::UniversalPrint(p0, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p1, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p2, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p3, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p4, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p5, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p6, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p7, os);\
|
|
|
|
*os << ")";\
|
|
|
|
}\
|
|
|
|
p0##_type p0;\
|
|
|
|
p1##_type p1;\
|
|
|
|
p2##_type p2;\
|
|
|
|
p3##_type p3;\
|
|
|
|
p4##_type p4;\
|
|
|
|
p5##_type p5;\
|
|
|
|
p6##_type p6;\
|
|
|
|
p7##_type p7;\
|
|
|
|
};\
|
|
|
|
template <typename arg_type>\
|
|
|
|
operator ::testing::Matcher<arg_type>() const {\
|
|
|
|
return ::testing::Matcher<arg_type>(new gmock_Impl<arg_type>(p0, p1, \
|
|
|
|
p2, p3, p4, p5, p6, p7));\
|
|
|
|
}\
|
|
|
|
name##MatcherP8(p0##_type gmock_p0, p1##_type gmock_p1, \
|
|
|
|
p2##_type gmock_p2, p3##_type gmock_p3, p4##_type gmock_p4, \
|
|
|
|
p5##_type gmock_p5, p6##_type gmock_p6, \
|
|
|
|
p7##_type gmock_p7) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \
|
|
|
|
p3(gmock_p3), p4(gmock_p4), p5(gmock_p5), p6(gmock_p6), \
|
|
|
|
p7(gmock_p7) {\
|
|
|
|
::testing::internal::ValidateMatcherDescription(description);\
|
|
|
|
}\
|
|
|
|
p0##_type p0;\
|
|
|
|
p1##_type p1;\
|
|
|
|
p2##_type p2;\
|
|
|
|
p3##_type p3;\
|
|
|
|
p4##_type p4;\
|
|
|
|
p5##_type p5;\
|
|
|
|
p6##_type p6;\
|
|
|
|
p7##_type p7;\
|
|
|
|
};\
|
|
|
|
template <typename p0##_type, typename p1##_type, typename p2##_type, \
|
|
|
|
typename p3##_type, typename p4##_type, typename p5##_type, \
|
|
|
|
typename p6##_type, typename p7##_type>\
|
|
|
|
inline name##MatcherP8<p0##_type, p1##_type, p2##_type, p3##_type, \
|
|
|
|
p4##_type, p5##_type, p6##_type, p7##_type> name(p0##_type p0, \
|
|
|
|
p1##_type p1, p2##_type p2, p3##_type p3, p4##_type p4, p5##_type p5, \
|
|
|
|
p6##_type p6, p7##_type p7) {\
|
|
|
|
return name##MatcherP8<p0##_type, p1##_type, p2##_type, p3##_type, \
|
|
|
|
p4##_type, p5##_type, p6##_type, p7##_type>(p0, p1, p2, p3, p4, p5, \
|
|
|
|
p6, p7);\
|
|
|
|
}\
|
|
|
|
template <typename p0##_type, typename p1##_type, typename p2##_type, \
|
|
|
|
typename p3##_type, typename p4##_type, typename p5##_type, \
|
|
|
|
typename p6##_type, typename p7##_type>\
|
|
|
|
template <typename arg_type>\
|
|
|
|
bool name##MatcherP8<p0##_type, p1##_type, p2##_type, p3##_type, p4##_type, \
|
|
|
|
p5##_type, p6##_type, p7##_type>::\
|
|
|
|
gmock_Impl<arg_type>::Matches(arg_type arg) const
|
|
|
|
|
|
|
|
#define MATCHER_P9(name, p0, p1, p2, p3, p4, p5, p6, p7, p8, description)\
|
|
|
|
template <typename p0##_type, typename p1##_type, typename p2##_type, \
|
|
|
|
typename p3##_type, typename p4##_type, typename p5##_type, \
|
|
|
|
typename p6##_type, typename p7##_type, typename p8##_type>\
|
|
|
|
class name##MatcherP9 {\
|
|
|
|
public:\
|
|
|
|
template <typename arg_type>\
|
|
|
|
class gmock_Impl : public ::testing::MatcherInterface<arg_type> {\
|
|
|
|
public:\
|
|
|
|
gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \
|
|
|
|
p3##_type gmock_p3, p4##_type gmock_p4, p5##_type gmock_p5, \
|
|
|
|
p6##_type gmock_p6, p7##_type gmock_p7, \
|
|
|
|
p8##_type gmock_p8) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \
|
|
|
|
p3(gmock_p3), p4(gmock_p4), p5(gmock_p5), p6(gmock_p6), \
|
|
|
|
p7(gmock_p7), p8(gmock_p8) {}\
|
|
|
|
virtual bool Matches(arg_type arg) const;\
|
|
|
|
virtual void DescribeTo(::std::ostream* os) const {\
|
|
|
|
*os << ::testing::internal::ConvertIdentifierNameToWords(#name);\
|
|
|
|
*os << " (";\
|
|
|
|
::testing::internal::UniversalPrint(p0, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p1, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p2, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p3, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p4, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p5, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p6, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p7, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p8, os);\
|
|
|
|
*os << ")";\
|
|
|
|
}\
|
|
|
|
p0##_type p0;\
|
|
|
|
p1##_type p1;\
|
|
|
|
p2##_type p2;\
|
|
|
|
p3##_type p3;\
|
|
|
|
p4##_type p4;\
|
|
|
|
p5##_type p5;\
|
|
|
|
p6##_type p6;\
|
|
|
|
p7##_type p7;\
|
|
|
|
p8##_type p8;\
|
|
|
|
};\
|
|
|
|
template <typename arg_type>\
|
|
|
|
operator ::testing::Matcher<arg_type>() const {\
|
|
|
|
return ::testing::Matcher<arg_type>(new gmock_Impl<arg_type>(p0, p1, \
|
|
|
|
p2, p3, p4, p5, p6, p7, p8));\
|
|
|
|
}\
|
|
|
|
name##MatcherP9(p0##_type gmock_p0, p1##_type gmock_p1, \
|
|
|
|
p2##_type gmock_p2, p3##_type gmock_p3, p4##_type gmock_p4, \
|
|
|
|
p5##_type gmock_p5, p6##_type gmock_p6, p7##_type gmock_p7, \
|
|
|
|
p8##_type gmock_p8) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \
|
|
|
|
p3(gmock_p3), p4(gmock_p4), p5(gmock_p5), p6(gmock_p6), p7(gmock_p7), \
|
|
|
|
p8(gmock_p8) {\
|
|
|
|
::testing::internal::ValidateMatcherDescription(description);\
|
|
|
|
}\
|
|
|
|
p0##_type p0;\
|
|
|
|
p1##_type p1;\
|
|
|
|
p2##_type p2;\
|
|
|
|
p3##_type p3;\
|
|
|
|
p4##_type p4;\
|
|
|
|
p5##_type p5;\
|
|
|
|
p6##_type p6;\
|
|
|
|
p7##_type p7;\
|
|
|
|
p8##_type p8;\
|
|
|
|
};\
|
|
|
|
template <typename p0##_type, typename p1##_type, typename p2##_type, \
|
|
|
|
typename p3##_type, typename p4##_type, typename p5##_type, \
|
|
|
|
typename p6##_type, typename p7##_type, typename p8##_type>\
|
|
|
|
inline name##MatcherP9<p0##_type, p1##_type, p2##_type, p3##_type, \
|
|
|
|
p4##_type, p5##_type, p6##_type, p7##_type, \
|
|
|
|
p8##_type> name(p0##_type p0, p1##_type p1, p2##_type p2, p3##_type p3, \
|
|
|
|
p4##_type p4, p5##_type p5, p6##_type p6, p7##_type p7, \
|
|
|
|
p8##_type p8) {\
|
|
|
|
return name##MatcherP9<p0##_type, p1##_type, p2##_type, p3##_type, \
|
|
|
|
p4##_type, p5##_type, p6##_type, p7##_type, p8##_type>(p0, p1, p2, \
|
|
|
|
p3, p4, p5, p6, p7, p8);\
|
|
|
|
}\
|
|
|
|
template <typename p0##_type, typename p1##_type, typename p2##_type, \
|
|
|
|
typename p3##_type, typename p4##_type, typename p5##_type, \
|
|
|
|
typename p6##_type, typename p7##_type, typename p8##_type>\
|
|
|
|
template <typename arg_type>\
|
|
|
|
bool name##MatcherP9<p0##_type, p1##_type, p2##_type, p3##_type, p4##_type, \
|
|
|
|
p5##_type, p6##_type, p7##_type, p8##_type>::\
|
|
|
|
gmock_Impl<arg_type>::Matches(arg_type arg) const
|
|
|
|
|
|
|
|
#define MATCHER_P10(name, p0, p1, p2, p3, p4, p5, p6, p7, p8, p9, description)\
|
|
|
|
template <typename p0##_type, typename p1##_type, typename p2##_type, \
|
|
|
|
typename p3##_type, typename p4##_type, typename p5##_type, \
|
|
|
|
typename p6##_type, typename p7##_type, typename p8##_type, \
|
|
|
|
typename p9##_type>\
|
|
|
|
class name##MatcherP10 {\
|
|
|
|
public:\
|
|
|
|
template <typename arg_type>\
|
|
|
|
class gmock_Impl : public ::testing::MatcherInterface<arg_type> {\
|
|
|
|
public:\
|
|
|
|
gmock_Impl(p0##_type gmock_p0, p1##_type gmock_p1, p2##_type gmock_p2, \
|
|
|
|
p3##_type gmock_p3, p4##_type gmock_p4, p5##_type gmock_p5, \
|
|
|
|
p6##_type gmock_p6, p7##_type gmock_p7, p8##_type gmock_p8, \
|
|
|
|
p9##_type gmock_p9) : p0(gmock_p0), p1(gmock_p1), p2(gmock_p2), \
|
|
|
|
p3(gmock_p3), p4(gmock_p4), p5(gmock_p5), p6(gmock_p6), \
|
|
|
|
p7(gmock_p7), p8(gmock_p8), p9(gmock_p9) {}\
|
|
|
|
virtual bool Matches(arg_type arg) const;\
|
|
|
|
virtual void DescribeTo(::std::ostream* os) const {\
|
|
|
|
*os << ::testing::internal::ConvertIdentifierNameToWords(#name);\
|
|
|
|
*os << " (";\
|
|
|
|
::testing::internal::UniversalPrint(p0, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p1, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p2, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p3, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p4, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p5, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p6, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p7, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p8, os);\
|
|
|
|
*os << ", ";\
|
|
|
|
::testing::internal::UniversalPrint(p9, os);\
|
|
|
|
*os << ")";\
|
|
|
|
}\
|
|
|
|
p0##_type p0;\
|
|
|
|
p1##_type p1;\
|
|
|
|
p2##_type p2;\
|
|
|
|
p3##_type p3;\
|
|
|
|
p4##_type p4;\
|
|
|
|
p5##_type p5;\
|
|
|
|
p6##_type p6;\
|
|
|
|
p7##_type p7;\
|
|
|
|
p8##_type p8;\
|
|
|
|
p9##_type p9;\
|
|
|
|
};\
|
|
|
|
template <typename arg_type>\
|
|
|
|
operator ::testing::Matcher<arg_type>() const {\
|
|
|
|
return ::testing::Matcher<arg_type>(new gmock_Impl<arg_type>(p0, p1, \
|
|
|
|
p2, p3, p4, p5, p6, p7, p8, p9));\
|
|
|
|
}\
|
|
|
|
name##MatcherP10(p0##_type gmock_p0, p1##_type gmock_p1, \
|
|
|
|
p2##_type gmock_p2, p3##_type gmock_p3, p4##_type gmock_p4, \
|
|
|
|
p5##_type gmock_p5, p6##_type gmock_p6, p7##_type gmock_p7, \
|
|
|
|
p8##_type gmock_p8, p9##_type gmock_p9) : p0(gmock_p0), p1(gmock_p1), \
|
|
|
|
p2(gmock_p2), p3(gmock_p3), p4(gmock_p4), p5(gmock_p5), p6(gmock_p6), \
|
|
|
|
p7(gmock_p7), p8(gmock_p8), p9(gmock_p9) {\
|
|
|
|
::testing::internal::ValidateMatcherDescription(description);\
|
|
|
|
}\
|
|
|
|
p0##_type p0;\
|
|
|
|
p1##_type p1;\
|
|
|
|
p2##_type p2;\
|
|
|
|
p3##_type p3;\
|
|
|
|
p4##_type p4;\
|
|
|
|
p5##_type p5;\
|
|
|
|
p6##_type p6;\
|
|
|
|
p7##_type p7;\
|
|
|
|
p8##_type p8;\
|
|
|
|
p9##_type p9;\
|
|
|
|
};\
|
|
|
|
template <typename p0##_type, typename p1##_type, typename p2##_type, \
|
|
|
|
typename p3##_type, typename p4##_type, typename p5##_type, \
|
|
|
|
typename p6##_type, typename p7##_type, typename p8##_type, \
|
|
|
|
typename p9##_type>\
|
|
|
|
inline name##MatcherP10<p0##_type, p1##_type, p2##_type, p3##_type, \
|
|
|
|
p4##_type, p5##_type, p6##_type, p7##_type, p8##_type, \
|
|
|
|
p9##_type> name(p0##_type p0, p1##_type p1, p2##_type p2, p3##_type p3, \
|
|
|
|
p4##_type p4, p5##_type p5, p6##_type p6, p7##_type p7, p8##_type p8, \
|
|
|
|
p9##_type p9) {\
|
|
|
|
return name##MatcherP10<p0##_type, p1##_type, p2##_type, p3##_type, \
|
|
|
|
p4##_type, p5##_type, p6##_type, p7##_type, p8##_type, p9##_type>(p0, \
|
|
|
|
p1, p2, p3, p4, p5, p6, p7, p8, p9);\
|
|
|
|
}\
|
|
|
|
template <typename p0##_type, typename p1##_type, typename p2##_type, \
|
|
|
|
typename p3##_type, typename p4##_type, typename p5##_type, \
|
|
|
|
typename p6##_type, typename p7##_type, typename p8##_type, \
|
|
|
|
typename p9##_type>\
|
|
|
|
template <typename arg_type>\
|
|
|
|
bool name##MatcherP10<p0##_type, p1##_type, p2##_type, p3##_type, \
|
|
|
|
p4##_type, p5##_type, p6##_type, p7##_type, p8##_type, p9##_type>::\
|
|
|
|
gmock_Impl<arg_type>::Matches(arg_type arg) const
|
|
|
|
|
2008-12-10 05:08:54 +00:00
|
|
|
#endif // GMOCK_INCLUDE_GMOCK_GMOCK_GENERATED_MATCHERS_H_
|