2008-12-10 08:08:54 +03:00
|
|
|
// 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 tests the built-in matchers generated by a script.
|
|
|
|
|
|
|
|
#include <gmock/gmock-generated-matchers.h>
|
|
|
|
|
|
|
|
#include <list>
|
|
|
|
#include <sstream>
|
|
|
|
#include <string>
|
|
|
|
#include <vector>
|
|
|
|
|
|
|
|
#include <gmock/gmock.h>
|
|
|
|
#include <gtest/gtest.h>
|
2009-02-12 04:34:27 +03:00
|
|
|
#include <gtest/gtest-spi.h>
|
2008-12-10 08:08:54 +03:00
|
|
|
|
|
|
|
namespace {
|
|
|
|
|
|
|
|
using std::list;
|
|
|
|
using std::stringstream;
|
|
|
|
using std::vector;
|
|
|
|
using testing::_;
|
|
|
|
using testing::ElementsAre;
|
|
|
|
using testing::ElementsAreArray;
|
|
|
|
using testing::Eq;
|
|
|
|
using testing::Ge;
|
|
|
|
using testing::Gt;
|
|
|
|
using testing::MakeMatcher;
|
|
|
|
using testing::Matcher;
|
|
|
|
using testing::MatcherInterface;
|
|
|
|
using testing::Ne;
|
|
|
|
using testing::Not;
|
|
|
|
using testing::Pointee;
|
|
|
|
using testing::Ref;
|
2009-02-12 04:34:27 +03:00
|
|
|
using testing::StaticAssertTypeEq;
|
2008-12-10 08:08:54 +03:00
|
|
|
using testing::StrEq;
|
|
|
|
using testing::internal::string;
|
|
|
|
|
|
|
|
// Returns the description of the given matcher.
|
|
|
|
template <typename T>
|
|
|
|
string Describe(const Matcher<T>& m) {
|
|
|
|
stringstream ss;
|
|
|
|
m.DescribeTo(&ss);
|
|
|
|
return ss.str();
|
|
|
|
}
|
|
|
|
|
|
|
|
// Returns the description of the negation of the given matcher.
|
|
|
|
template <typename T>
|
|
|
|
string DescribeNegation(const Matcher<T>& m) {
|
|
|
|
stringstream ss;
|
|
|
|
m.DescribeNegationTo(&ss);
|
|
|
|
return ss.str();
|
|
|
|
}
|
|
|
|
|
|
|
|
// Returns the reason why x matches, or doesn't match, m.
|
|
|
|
template <typename MatcherType, typename Value>
|
|
|
|
string Explain(const MatcherType& m, const Value& x) {
|
|
|
|
stringstream ss;
|
|
|
|
m.ExplainMatchResultTo(x, &ss);
|
|
|
|
return ss.str();
|
|
|
|
}
|
|
|
|
|
|
|
|
// For testing ExplainMatchResultTo().
|
|
|
|
class GreaterThanMatcher : public MatcherInterface<int> {
|
|
|
|
public:
|
|
|
|
explicit GreaterThanMatcher(int rhs) : rhs_(rhs) {}
|
|
|
|
|
|
|
|
virtual bool Matches(int lhs) const { return lhs > rhs_; }
|
|
|
|
|
|
|
|
virtual void DescribeTo(::std::ostream* os) const {
|
|
|
|
*os << "is greater than " << rhs_;
|
|
|
|
}
|
|
|
|
|
|
|
|
virtual void ExplainMatchResultTo(int lhs, ::std::ostream* os) const {
|
|
|
|
const int diff = lhs - rhs_;
|
|
|
|
if (diff > 0) {
|
|
|
|
*os << "is " << diff << " more than " << rhs_;
|
|
|
|
} else if (diff == 0) {
|
|
|
|
*os << "is the same as " << rhs_;
|
|
|
|
} else {
|
|
|
|
*os << "is " << -diff << " less than " << rhs_;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
private:
|
|
|
|
const int rhs_;
|
|
|
|
};
|
|
|
|
|
|
|
|
Matcher<int> GreaterThan(int n) {
|
|
|
|
return MakeMatcher(new GreaterThanMatcher(n));
|
|
|
|
}
|
|
|
|
|
|
|
|
// Tests for ElementsAre().
|
|
|
|
|
|
|
|
// Evaluates to the number of elements in 'array'.
|
|
|
|
#define GMOCK_ARRAY_SIZE_(array) (sizeof(array)/sizeof(array[0]))
|
|
|
|
|
|
|
|
TEST(ElementsAreTest, CanDescribeExpectingNoElement) {
|
|
|
|
Matcher<const vector<int>&> m = ElementsAre();
|
|
|
|
EXPECT_EQ("is empty", Describe(m));
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST(ElementsAreTest, CanDescribeExpectingOneElement) {
|
|
|
|
Matcher<vector<int> > m = ElementsAre(Gt(5));
|
|
|
|
EXPECT_EQ("has 1 element that is greater than 5", Describe(m));
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST(ElementsAreTest, CanDescribeExpectingManyElements) {
|
|
|
|
Matcher<list<string> > m = ElementsAre(StrEq("one"), "two");
|
|
|
|
EXPECT_EQ("has 2 elements where\n"
|
|
|
|
"element 0 is equal to \"one\",\n"
|
|
|
|
"element 1 is equal to \"two\"", Describe(m));
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST(ElementsAreTest, CanDescribeNegationOfExpectingNoElement) {
|
|
|
|
Matcher<vector<int> > m = ElementsAre();
|
|
|
|
EXPECT_EQ("is not empty", DescribeNegation(m));
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST(ElementsAreTest, CanDescribeNegationOfExpectingOneElment) {
|
|
|
|
Matcher<const list<int>& > m = ElementsAre(Gt(5));
|
|
|
|
EXPECT_EQ("does not have 1 element, or\n"
|
|
|
|
"element 0 is not greater than 5", DescribeNegation(m));
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST(ElementsAreTest, CanDescribeNegationOfExpectingManyElements) {
|
|
|
|
Matcher<const list<string>& > m = ElementsAre("one", "two");
|
|
|
|
EXPECT_EQ("does not have 2 elements, or\n"
|
|
|
|
"element 0 is not equal to \"one\", or\n"
|
|
|
|
"element 1 is not equal to \"two\"", DescribeNegation(m));
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST(ElementsAreTest, DoesNotExplainTrivialMatch) {
|
|
|
|
Matcher<const list<int>& > m = ElementsAre(1, Ne(2));
|
|
|
|
|
|
|
|
list<int> test_list;
|
|
|
|
test_list.push_back(1);
|
|
|
|
test_list.push_back(3);
|
|
|
|
EXPECT_EQ("", Explain(m, test_list)); // No need to explain anything.
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST(ElementsAreTest, ExplainsNonTrivialMatch) {
|
|
|
|
Matcher<const vector<int>& > m =
|
|
|
|
ElementsAre(GreaterThan(1), 0, GreaterThan(2));
|
|
|
|
|
|
|
|
const int a[] = { 10, 0, 100 };
|
|
|
|
vector<int> test_vector(a, a + GMOCK_ARRAY_SIZE_(a));
|
|
|
|
EXPECT_EQ("element 0 is 9 more than 1,\n"
|
|
|
|
"element 2 is 98 more than 2", Explain(m, test_vector));
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST(ElementsAreTest, CanExplainMismatchWrongSize) {
|
|
|
|
Matcher<const list<int>& > m = ElementsAre(1, 3);
|
|
|
|
|
|
|
|
list<int> test_list;
|
|
|
|
// No need to explain when the container is empty.
|
|
|
|
EXPECT_EQ("", Explain(m, test_list));
|
|
|
|
|
|
|
|
test_list.push_back(1);
|
|
|
|
EXPECT_EQ("has 1 element", Explain(m, test_list));
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST(ElementsAreTest, CanExplainMismatchRightSize) {
|
|
|
|
Matcher<const vector<int>& > m = ElementsAre(1, GreaterThan(5));
|
|
|
|
|
|
|
|
vector<int> v;
|
|
|
|
v.push_back(2);
|
|
|
|
v.push_back(1);
|
|
|
|
EXPECT_EQ("element 0 doesn't match", Explain(m, v));
|
|
|
|
|
|
|
|
v[0] = 1;
|
|
|
|
EXPECT_EQ("element 1 doesn't match (is 4 less than 5)", Explain(m, v));
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST(ElementsAreTest, MatchesOneElementVector) {
|
|
|
|
vector<string> test_vector;
|
|
|
|
test_vector.push_back("test string");
|
|
|
|
|
|
|
|
EXPECT_THAT(test_vector, ElementsAre(StrEq("test string")));
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST(ElementsAreTest, MatchesOneElementList) {
|
|
|
|
list<string> test_list;
|
|
|
|
test_list.push_back("test string");
|
|
|
|
|
|
|
|
EXPECT_THAT(test_list, ElementsAre("test string"));
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST(ElementsAreTest, MatchesThreeElementVector) {
|
|
|
|
vector<string> test_vector;
|
|
|
|
test_vector.push_back("one");
|
|
|
|
test_vector.push_back("two");
|
|
|
|
test_vector.push_back("three");
|
|
|
|
|
|
|
|
EXPECT_THAT(test_vector, ElementsAre("one", StrEq("two"), _));
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST(ElementsAreTest, MatchesOneElementEqMatcher) {
|
|
|
|
vector<int> test_vector;
|
|
|
|
test_vector.push_back(4);
|
|
|
|
|
|
|
|
EXPECT_THAT(test_vector, ElementsAre(Eq(4)));
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST(ElementsAreTest, MatchesOneElementAnyMatcher) {
|
|
|
|
vector<int> test_vector;
|
|
|
|
test_vector.push_back(4);
|
|
|
|
|
|
|
|
EXPECT_THAT(test_vector, ElementsAre(_));
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST(ElementsAreTest, MatchesOneElementValue) {
|
|
|
|
vector<int> test_vector;
|
|
|
|
test_vector.push_back(4);
|
|
|
|
|
|
|
|
EXPECT_THAT(test_vector, ElementsAre(4));
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST(ElementsAreTest, MatchesThreeElementsMixedMatchers) {
|
|
|
|
vector<int> test_vector;
|
|
|
|
test_vector.push_back(1);
|
|
|
|
test_vector.push_back(2);
|
|
|
|
test_vector.push_back(3);
|
|
|
|
|
|
|
|
EXPECT_THAT(test_vector, ElementsAre(1, Eq(2), _));
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST(ElementsAreTest, MatchesTenElementVector) {
|
|
|
|
const int a[] = { 0, 1, 2, 3, 4, 5, 6, 7, 8, 9 };
|
|
|
|
vector<int> test_vector(a, a + GMOCK_ARRAY_SIZE_(a));
|
|
|
|
|
|
|
|
EXPECT_THAT(test_vector,
|
|
|
|
// The element list can contain values and/or matchers
|
|
|
|
// of different types.
|
|
|
|
ElementsAre(0, Ge(0), _, 3, 4, Ne(2), Eq(6), 7, 8, _));
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST(ElementsAreTest, DoesNotMatchWrongSize) {
|
|
|
|
vector<string> test_vector;
|
|
|
|
test_vector.push_back("test string");
|
|
|
|
test_vector.push_back("test string");
|
|
|
|
|
|
|
|
Matcher<vector<string> > m = ElementsAre(StrEq("test string"));
|
|
|
|
EXPECT_FALSE(m.Matches(test_vector));
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST(ElementsAreTest, DoesNotMatchWrongValue) {
|
|
|
|
vector<string> test_vector;
|
|
|
|
test_vector.push_back("other string");
|
|
|
|
|
|
|
|
Matcher<vector<string> > m = ElementsAre(StrEq("test string"));
|
|
|
|
EXPECT_FALSE(m.Matches(test_vector));
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST(ElementsAreTest, DoesNotMatchWrongOrder) {
|
|
|
|
vector<string> test_vector;
|
|
|
|
test_vector.push_back("one");
|
|
|
|
test_vector.push_back("three");
|
|
|
|
test_vector.push_back("two");
|
|
|
|
|
|
|
|
Matcher<vector<string> > m = ElementsAre(
|
|
|
|
StrEq("one"), StrEq("two"), StrEq("three"));
|
|
|
|
EXPECT_FALSE(m.Matches(test_vector));
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST(ElementsAreTest, WorksForNestedContainer) {
|
|
|
|
const char* strings[] = {
|
|
|
|
"Hi",
|
|
|
|
"world"
|
|
|
|
};
|
|
|
|
|
|
|
|
vector<list<char> > nested;
|
|
|
|
for (int i = 0; i < GMOCK_ARRAY_SIZE_(strings); i++) {
|
|
|
|
nested.push_back(list<char>(strings[i], strings[i] + strlen(strings[i])));
|
|
|
|
}
|
|
|
|
|
|
|
|
EXPECT_THAT(nested, ElementsAre(ElementsAre('H', Ne('e')),
|
|
|
|
ElementsAre('w', 'o', _, _, 'd')));
|
|
|
|
EXPECT_THAT(nested, Not(ElementsAre(ElementsAre('H', 'e'),
|
|
|
|
ElementsAre('w', 'o', _, _, 'd'))));
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST(ElementsAreTest, WorksWithByRefElementMatchers) {
|
|
|
|
int a[] = { 0, 1, 2 };
|
|
|
|
vector<int> v(a, a + GMOCK_ARRAY_SIZE_(a));
|
|
|
|
|
|
|
|
EXPECT_THAT(v, ElementsAre(Ref(v[0]), Ref(v[1]), Ref(v[2])));
|
|
|
|
EXPECT_THAT(v, Not(ElementsAre(Ref(v[0]), Ref(v[1]), Ref(a[2]))));
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST(ElementsAreTest, WorksWithContainerPointerUsingPointee) {
|
|
|
|
int a[] = { 0, 1, 2 };
|
|
|
|
vector<int> v(a, a + GMOCK_ARRAY_SIZE_(a));
|
|
|
|
|
|
|
|
EXPECT_THAT(&v, Pointee(ElementsAre(0, 1, _)));
|
|
|
|
EXPECT_THAT(&v, Not(Pointee(ElementsAre(0, _, 3))));
|
|
|
|
}
|
|
|
|
|
|
|
|
// Tests for ElementsAreArray(). Since ElementsAreArray() shares most
|
|
|
|
// of the implementation with ElementsAre(), we don't test it as
|
|
|
|
// thoroughly here.
|
|
|
|
|
|
|
|
TEST(ElementsAreArrayTest, CanBeCreatedWithValueArray) {
|
|
|
|
const int a[] = { 1, 2, 3 };
|
|
|
|
|
|
|
|
vector<int> test_vector(a, a + GMOCK_ARRAY_SIZE_(a));
|
|
|
|
EXPECT_THAT(test_vector, ElementsAreArray(a));
|
|
|
|
|
|
|
|
test_vector[2] = 0;
|
|
|
|
EXPECT_THAT(test_vector, Not(ElementsAreArray(a)));
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST(ElementsAreArrayTest, CanBeCreatedWithArraySize) {
|
|
|
|
const char* a[] = { "one", "two", "three" };
|
|
|
|
|
|
|
|
vector<string> test_vector(a, a + GMOCK_ARRAY_SIZE_(a));
|
|
|
|
EXPECT_THAT(test_vector, ElementsAreArray(a, GMOCK_ARRAY_SIZE_(a)));
|
|
|
|
|
|
|
|
const char** p = a;
|
|
|
|
test_vector[0] = "1";
|
|
|
|
EXPECT_THAT(test_vector, Not(ElementsAreArray(p, GMOCK_ARRAY_SIZE_(a))));
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST(ElementsAreArrayTest, CanBeCreatedWithoutArraySize) {
|
|
|
|
const char* a[] = { "one", "two", "three" };
|
|
|
|
|
|
|
|
vector<string> test_vector(a, a + GMOCK_ARRAY_SIZE_(a));
|
|
|
|
EXPECT_THAT(test_vector, ElementsAreArray(a));
|
|
|
|
|
|
|
|
test_vector[0] = "1";
|
|
|
|
EXPECT_THAT(test_vector, Not(ElementsAreArray(a)));
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST(ElementsAreArrayTest, CanBeCreatedWithMatcherArray) {
|
|
|
|
const Matcher<string> kMatcherArray[] =
|
|
|
|
{ StrEq("one"), StrEq("two"), StrEq("three") };
|
|
|
|
|
|
|
|
vector<string> test_vector;
|
|
|
|
test_vector.push_back("one");
|
|
|
|
test_vector.push_back("two");
|
|
|
|
test_vector.push_back("three");
|
|
|
|
EXPECT_THAT(test_vector, ElementsAreArray(kMatcherArray));
|
|
|
|
|
|
|
|
test_vector.push_back("three");
|
|
|
|
EXPECT_THAT(test_vector, Not(ElementsAreArray(kMatcherArray)));
|
|
|
|
}
|
|
|
|
|
2009-02-12 04:34:27 +03:00
|
|
|
// Tests for the MATCHER*() macro family.
|
|
|
|
|
|
|
|
// Tests that a simple MATCHER() definition works.
|
|
|
|
|
|
|
|
MATCHER(IsEven, "") { return (arg % 2) == 0; }
|
|
|
|
|
|
|
|
TEST(MatcherMacroTest, Works) {
|
|
|
|
const Matcher<int> m = IsEven();
|
|
|
|
EXPECT_TRUE(m.Matches(6));
|
|
|
|
EXPECT_FALSE(m.Matches(7));
|
|
|
|
|
|
|
|
EXPECT_EQ("is even", Describe(m));
|
|
|
|
EXPECT_EQ("not (is even)", DescribeNegation(m));
|
|
|
|
EXPECT_EQ("", Explain(m, 6));
|
|
|
|
EXPECT_EQ("", Explain(m, 7));
|
|
|
|
}
|
|
|
|
|
|
|
|
// Tests that the description string supplied to MATCHER() must be
|
2009-02-19 03:36:44 +03:00
|
|
|
// valid.
|
2009-02-12 04:34:27 +03:00
|
|
|
|
2009-02-19 03:36:44 +03:00
|
|
|
MATCHER(HasBadDescription, "Invalid%") { return true; }
|
2009-02-12 04:34:27 +03:00
|
|
|
|
|
|
|
TEST(MatcherMacroTest,
|
|
|
|
CreatingMatcherWithBadDescriptionGeneratesNonfatalFailure) {
|
2009-02-19 03:36:44 +03:00
|
|
|
EXPECT_NONFATAL_FAILURE(
|
|
|
|
HasBadDescription(),
|
|
|
|
"Syntax error at index 7 in matcher description \"Invalid%\": "
|
|
|
|
"use \"%%\" instead of \"%\" to print \"%\".");
|
|
|
|
}
|
|
|
|
|
|
|
|
MATCHER(HasGoodDescription, "good") { return true; }
|
|
|
|
|
|
|
|
TEST(MatcherMacroTest, AcceptsValidDescription) {
|
|
|
|
const Matcher<int> m = HasGoodDescription();
|
|
|
|
EXPECT_EQ("good", Describe(m));
|
2009-02-12 04:34:27 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
// Tests that the body of MATCHER() can reference the type of the
|
|
|
|
// value being matched.
|
|
|
|
|
|
|
|
MATCHER(IsEmptyString, "") {
|
|
|
|
StaticAssertTypeEq< ::std::string, arg_type>();
|
|
|
|
return arg == "";
|
|
|
|
}
|
|
|
|
|
|
|
|
MATCHER(IsEmptyStringByRef, "") {
|
|
|
|
StaticAssertTypeEq<const ::std::string&, arg_type>();
|
|
|
|
return arg == "";
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST(MatcherMacroTest, CanReferenceArgType) {
|
|
|
|
const Matcher< ::std::string> m1 = IsEmptyString();
|
|
|
|
EXPECT_TRUE(m1.Matches(""));
|
|
|
|
|
|
|
|
const Matcher<const ::std::string&> m2 = IsEmptyStringByRef();
|
|
|
|
EXPECT_TRUE(m2.Matches(""));
|
|
|
|
}
|
|
|
|
|
|
|
|
// Tests that MATCHER() can be used in a namespace.
|
|
|
|
|
|
|
|
namespace matcher_test {
|
|
|
|
MATCHER(IsOdd, "") { return (arg % 2) != 0; }
|
|
|
|
} // namespace matcher_test
|
|
|
|
|
|
|
|
TEST(MatcherTest, WorksInNamespace) {
|
|
|
|
Matcher<int> m = matcher_test::IsOdd();
|
|
|
|
EXPECT_FALSE(m.Matches(4));
|
|
|
|
EXPECT_TRUE(m.Matches(5));
|
|
|
|
}
|
|
|
|
|
|
|
|
// Tests that a simple MATCHER_P() definition works.
|
|
|
|
|
|
|
|
MATCHER_P(IsGreaterThan32And, n, "") { return arg > 32 && arg > n; }
|
|
|
|
|
|
|
|
TEST(MatcherPMacroTest, Works) {
|
|
|
|
const Matcher<int> m = IsGreaterThan32And(5);
|
|
|
|
EXPECT_TRUE(m.Matches(36));
|
|
|
|
EXPECT_FALSE(m.Matches(5));
|
|
|
|
|
|
|
|
EXPECT_EQ("is greater than 32 and 5", Describe(m));
|
|
|
|
EXPECT_EQ("not (is greater than 32 and 5)", DescribeNegation(m));
|
|
|
|
EXPECT_EQ("", Explain(m, 36));
|
|
|
|
EXPECT_EQ("", Explain(m, 5));
|
|
|
|
}
|
|
|
|
|
|
|
|
// Tests that the description string supplied to MATCHER_P() must be
|
2009-02-19 03:36:44 +03:00
|
|
|
// valid.
|
2009-02-12 04:34:27 +03:00
|
|
|
|
2009-02-19 03:36:44 +03:00
|
|
|
MATCHER_P(HasBadDescription1, n, "not %(m)s good") {
|
2009-02-12 04:34:27 +03:00
|
|
|
return arg > n;
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST(MatcherPMacroTest,
|
|
|
|
CreatingMatcherWithBadDescriptionGeneratesNonfatalFailure) {
|
2009-02-19 03:36:44 +03:00
|
|
|
EXPECT_NONFATAL_FAILURE(
|
|
|
|
HasBadDescription1(2),
|
|
|
|
"Syntax error at index 6 in matcher description \"not %(m)s good\": "
|
|
|
|
"\"m\" is an invalid parameter name.");
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
MATCHER_P(HasGoodDescription1, n, "good %(n)s") { return true; }
|
|
|
|
|
|
|
|
TEST(MatcherPMacroTest, AcceptsValidDescription) {
|
|
|
|
const Matcher<int> m = HasGoodDescription1(5);
|
|
|
|
EXPECT_EQ("good 5", Describe(m));
|
2009-02-12 04:34:27 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
// Tests that the description is calculated correctly from the matcher name.
|
|
|
|
MATCHER_P(_is_Greater_Than32and_, n, "") { return arg > 32 && arg > n; }
|
|
|
|
|
|
|
|
TEST(MatcherPMacroTest, GeneratesCorrectDescription) {
|
|
|
|
const Matcher<int> m = _is_Greater_Than32and_(5);
|
|
|
|
|
|
|
|
EXPECT_EQ("is greater than 32 and 5", Describe(m));
|
|
|
|
EXPECT_EQ("not (is greater than 32 and 5)", DescribeNegation(m));
|
|
|
|
EXPECT_EQ("", Explain(m, 36));
|
|
|
|
EXPECT_EQ("", Explain(m, 5));
|
|
|
|
}
|
|
|
|
|
|
|
|
// Tests that a MATCHER_P matcher can be explicitly instantiated with
|
|
|
|
// a reference parameter type.
|
|
|
|
|
|
|
|
class UncopyableFoo {
|
|
|
|
public:
|
|
|
|
explicit UncopyableFoo(char value) : value_(value) {}
|
|
|
|
private:
|
|
|
|
UncopyableFoo(const UncopyableFoo&);
|
|
|
|
void operator=(const UncopyableFoo&);
|
|
|
|
|
|
|
|
char value_;
|
|
|
|
};
|
|
|
|
|
|
|
|
MATCHER_P(ReferencesUncopyable, variable, "") { return &arg == &variable; }
|
|
|
|
|
|
|
|
TEST(MatcherPMacroTest, WorksWhenExplicitlyInstantiatedWithReference) {
|
|
|
|
UncopyableFoo foo1('1'), foo2('2');
|
|
|
|
const Matcher<const UncopyableFoo&> m =
|
|
|
|
ReferencesUncopyable<const UncopyableFoo&>(foo1);
|
|
|
|
|
|
|
|
EXPECT_TRUE(m.Matches(foo1));
|
|
|
|
EXPECT_FALSE(m.Matches(foo2));
|
|
|
|
|
|
|
|
// We don't want the address of the parameter printed, as most
|
|
|
|
// likely it will just annoy the user. If the address is
|
|
|
|
// interesting, the user should consider passing the parameter by
|
|
|
|
// pointer instead.
|
|
|
|
EXPECT_EQ("references uncopyable 1-byte object <31>", Describe(m));
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
// Tests that the description string supplied to MATCHER_Pn() must be
|
2009-02-19 03:36:44 +03:00
|
|
|
// valid.
|
2009-02-12 04:34:27 +03:00
|
|
|
|
2009-02-19 03:36:44 +03:00
|
|
|
MATCHER_P2(HasBadDescription2, m, n, "not %(good") {
|
2009-02-12 04:34:27 +03:00
|
|
|
return arg > m + n;
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST(MatcherPnMacroTest,
|
|
|
|
CreatingMatcherWithBadDescriptionGeneratesNonfatalFailure) {
|
2009-02-19 03:36:44 +03:00
|
|
|
EXPECT_NONFATAL_FAILURE(
|
|
|
|
HasBadDescription2(3, 4),
|
|
|
|
"Syntax error at index 4 in matcher description \"not %(good\": "
|
|
|
|
"an interpolation must end with \")s\", but \"%(good\" does not.");
|
|
|
|
}
|
|
|
|
|
|
|
|
MATCHER_P2(HasComplexDescription, foo, bar,
|
|
|
|
"is as complex as %(foo)s %(bar)s (i.e. %(*)s or %%%(foo)s!)") {
|
|
|
|
return true;
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST(MatcherPnMacroTest, AcceptsValidDescription) {
|
|
|
|
Matcher<int> m = HasComplexDescription(100, "ducks");
|
|
|
|
EXPECT_EQ("is as complex as 100 \"ducks\" (i.e. (100, \"ducks\") or %100!)",
|
|
|
|
Describe(m));
|
2009-02-12 04:34:27 +03:00
|
|
|
}
|
|
|
|
|
|
|
|
// Tests that the body of MATCHER_Pn() can reference the parameter
|
|
|
|
// types.
|
|
|
|
|
|
|
|
MATCHER_P3(ParamTypesAreIntLongAndChar, foo, bar, baz, "") {
|
|
|
|
StaticAssertTypeEq<int, foo_type>();
|
|
|
|
StaticAssertTypeEq<long, bar_type>(); // NOLINT
|
|
|
|
StaticAssertTypeEq<char, baz_type>();
|
|
|
|
return arg == 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST(MatcherPnMacroTest, CanReferenceParamTypes) {
|
|
|
|
EXPECT_THAT(0, ParamTypesAreIntLongAndChar(10, 20L, 'a'));
|
|
|
|
}
|
|
|
|
|
|
|
|
// Tests that a MATCHER_Pn matcher can be explicitly instantiated with
|
|
|
|
// reference parameter types.
|
|
|
|
|
|
|
|
MATCHER_P2(ReferencesAnyOf, variable1, variable2, "") {
|
|
|
|
return &arg == &variable1 || &arg == &variable2;
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST(MatcherPnMacroTest, WorksWhenExplicitlyInstantiatedWithReferences) {
|
|
|
|
UncopyableFoo foo1('1'), foo2('2'), foo3('3');
|
|
|
|
const Matcher<const UncopyableFoo&> m =
|
|
|
|
ReferencesAnyOf<const UncopyableFoo&, const UncopyableFoo&>(foo1, foo2);
|
|
|
|
|
|
|
|
EXPECT_TRUE(m.Matches(foo1));
|
|
|
|
EXPECT_TRUE(m.Matches(foo2));
|
|
|
|
EXPECT_FALSE(m.Matches(foo3));
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST(MatcherPnMacroTest,
|
|
|
|
GeneratesCorretDescriptionWhenExplicitlyInstantiatedWithReferences) {
|
|
|
|
UncopyableFoo foo1('1'), foo2('2');
|
|
|
|
const Matcher<const UncopyableFoo&> m =
|
|
|
|
ReferencesAnyOf<const UncopyableFoo&, const UncopyableFoo&>(foo1, foo2);
|
|
|
|
|
|
|
|
// We don't want the addresses of the parameters printed, as most
|
|
|
|
// likely they will just annoy the user. If the addresses are
|
|
|
|
// interesting, the user should consider passing the parameters by
|
|
|
|
// pointers instead.
|
|
|
|
EXPECT_EQ("references any of (1-byte object <31>, 1-byte object <32>)",
|
|
|
|
Describe(m));
|
|
|
|
}
|
|
|
|
|
|
|
|
// Tests that a simple MATCHER_P2() definition works.
|
|
|
|
|
|
|
|
MATCHER_P2(IsNotInClosedRange, low, hi, "") { return arg < low || arg > hi; }
|
|
|
|
|
|
|
|
TEST(MatcherPnMacroTest, Works) {
|
|
|
|
const Matcher<const long&> m = IsNotInClosedRange(10, 20); // NOLINT
|
|
|
|
EXPECT_TRUE(m.Matches(36L));
|
|
|
|
EXPECT_FALSE(m.Matches(15L));
|
|
|
|
|
|
|
|
EXPECT_EQ("is not in closed range (10, 20)", Describe(m));
|
|
|
|
EXPECT_EQ("not (is not in closed range (10, 20))", DescribeNegation(m));
|
|
|
|
EXPECT_EQ("", Explain(m, 36L));
|
|
|
|
EXPECT_EQ("", Explain(m, 15L));
|
|
|
|
}
|
|
|
|
|
|
|
|
// Tests that MATCHER*() definitions can be overloaded on the number
|
|
|
|
// of parameters; also tests MATCHER_Pn() where n >= 3.
|
|
|
|
|
|
|
|
MATCHER(EqualsSumOf, "") { return arg == 0; }
|
|
|
|
MATCHER_P(EqualsSumOf, a, "") { return arg == a; }
|
|
|
|
MATCHER_P2(EqualsSumOf, a, b, "") { return arg == a + b; }
|
|
|
|
MATCHER_P3(EqualsSumOf, a, b, c, "") { return arg == a + b + c; }
|
|
|
|
MATCHER_P4(EqualsSumOf, a, b, c, d, "") { return arg == a + b + c + d; }
|
|
|
|
MATCHER_P5(EqualsSumOf, a, b, c, d, e, "") { return arg == a + b + c + d + e; }
|
|
|
|
MATCHER_P6(EqualsSumOf, a, b, c, d, e, f, "") {
|
|
|
|
return arg == a + b + c + d + e + f;
|
|
|
|
}
|
|
|
|
MATCHER_P7(EqualsSumOf, a, b, c, d, e, f, g, "") {
|
|
|
|
return arg == a + b + c + d + e + f + g;
|
|
|
|
}
|
|
|
|
MATCHER_P8(EqualsSumOf, a, b, c, d, e, f, g, h, "") {
|
|
|
|
return arg == a + b + c + d + e + f + g + h;
|
|
|
|
}
|
|
|
|
MATCHER_P9(EqualsSumOf, a, b, c, d, e, f, g, h, i, "") {
|
|
|
|
return arg == a + b + c + d + e + f + g + h + i;
|
|
|
|
}
|
|
|
|
MATCHER_P10(EqualsSumOf, a, b, c, d, e, f, g, h, i, j, "") {
|
|
|
|
return arg == a + b + c + d + e + f + g + h + i + j;
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST(MatcherPnMacroTest, CanBeOverloadedOnNumberOfParameters) {
|
|
|
|
EXPECT_THAT(0, EqualsSumOf());
|
|
|
|
EXPECT_THAT(1, EqualsSumOf(1));
|
|
|
|
EXPECT_THAT(12, EqualsSumOf(10, 2));
|
|
|
|
EXPECT_THAT(123, EqualsSumOf(100, 20, 3));
|
|
|
|
EXPECT_THAT(1234, EqualsSumOf(1000, 200, 30, 4));
|
|
|
|
EXPECT_THAT(12345, EqualsSumOf(10000, 2000, 300, 40, 5));
|
|
|
|
EXPECT_THAT("abcdef",
|
|
|
|
EqualsSumOf(::std::string("a"), 'b', 'c', "d", "e", 'f'));
|
|
|
|
EXPECT_THAT("abcdefg",
|
|
|
|
EqualsSumOf(::std::string("a"), 'b', 'c', "d", "e", 'f', 'g'));
|
|
|
|
EXPECT_THAT("abcdefgh",
|
|
|
|
EqualsSumOf(::std::string("a"), 'b', 'c', "d", "e", 'f', 'g',
|
|
|
|
"h"));
|
|
|
|
EXPECT_THAT("abcdefghi",
|
|
|
|
EqualsSumOf(::std::string("a"), 'b', 'c', "d", "e", 'f', 'g',
|
|
|
|
"h", 'i'));
|
|
|
|
EXPECT_THAT("abcdefghij",
|
|
|
|
EqualsSumOf(::std::string("a"), 'b', 'c', "d", "e", 'f', 'g',
|
|
|
|
"h", 'i', ::std::string("j")));
|
|
|
|
|
|
|
|
EXPECT_THAT(1, Not(EqualsSumOf()));
|
|
|
|
EXPECT_THAT(-1, Not(EqualsSumOf(1)));
|
|
|
|
EXPECT_THAT(-12, Not(EqualsSumOf(10, 2)));
|
|
|
|
EXPECT_THAT(-123, Not(EqualsSumOf(100, 20, 3)));
|
|
|
|
EXPECT_THAT(-1234, Not(EqualsSumOf(1000, 200, 30, 4)));
|
|
|
|
EXPECT_THAT(-12345, Not(EqualsSumOf(10000, 2000, 300, 40, 5)));
|
|
|
|
EXPECT_THAT("abcdef ",
|
|
|
|
Not(EqualsSumOf(::std::string("a"), 'b', 'c', "d", "e", 'f')));
|
|
|
|
EXPECT_THAT("abcdefg ",
|
|
|
|
Not(EqualsSumOf(::std::string("a"), 'b', 'c', "d", "e", 'f',
|
|
|
|
'g')));
|
|
|
|
EXPECT_THAT("abcdefgh ",
|
|
|
|
Not(EqualsSumOf(::std::string("a"), 'b', 'c', "d", "e", 'f', 'g',
|
|
|
|
"h")));
|
|
|
|
EXPECT_THAT("abcdefghi ",
|
|
|
|
Not(EqualsSumOf(::std::string("a"), 'b', 'c', "d", "e", 'f', 'g',
|
|
|
|
"h", 'i')));
|
|
|
|
EXPECT_THAT("abcdefghij ",
|
|
|
|
Not(EqualsSumOf(::std::string("a"), 'b', 'c', "d", "e", 'f', 'g',
|
|
|
|
"h", 'i', ::std::string("j"))));
|
|
|
|
}
|
|
|
|
|
|
|
|
// Tests that a MATCHER_Pn() definition can be instantiated with any
|
|
|
|
// compatible parameter types.
|
|
|
|
TEST(MatcherPnMacroTest, WorksForDifferentParameterTypes) {
|
|
|
|
EXPECT_THAT(123, EqualsSumOf(100L, 20, static_cast<char>(3)));
|
|
|
|
EXPECT_THAT("abcd", EqualsSumOf(::std::string("a"), "b", 'c', "d"));
|
|
|
|
|
|
|
|
EXPECT_THAT(124, Not(EqualsSumOf(100L, 20, static_cast<char>(3))));
|
|
|
|
EXPECT_THAT("abcde", Not(EqualsSumOf(::std::string("a"), "b", 'c', "d")));
|
|
|
|
}
|
|
|
|
|
|
|
|
// Tests that the matcher body can promote the parameter types.
|
|
|
|
|
|
|
|
MATCHER_P2(EqConcat, prefix, suffix, "") {
|
|
|
|
// The following lines promote the two parameters to desired types.
|
|
|
|
std::string prefix_str(prefix);
|
|
|
|
char suffix_char(suffix);
|
|
|
|
return arg == prefix_str + suffix_char;
|
|
|
|
}
|
|
|
|
|
|
|
|
TEST(MatcherPnMacroTest, SimpleTypePromotion) {
|
|
|
|
Matcher<std::string> no_promo =
|
|
|
|
EqConcat(std::string("foo"), 't');
|
|
|
|
Matcher<const std::string&> promo =
|
|
|
|
EqConcat("foo", static_cast<int>('t'));
|
|
|
|
EXPECT_FALSE(no_promo.Matches("fool"));
|
|
|
|
EXPECT_FALSE(promo.Matches("fool"));
|
|
|
|
EXPECT_TRUE(no_promo.Matches("foot"));
|
|
|
|
EXPECT_TRUE(promo.Matches("foot"));
|
|
|
|
}
|
|
|
|
|
|
|
|
// Verifies the type of a MATCHER*.
|
|
|
|
|
|
|
|
TEST(MatcherPnMacroTest, TypesAreCorrect) {
|
|
|
|
// EqualsSumOf() must be assignable to a EqualsSumOfMatcher variable.
|
|
|
|
EqualsSumOfMatcher a0 = EqualsSumOf();
|
|
|
|
|
|
|
|
// EqualsSumOf(1) must be assignable to a EqualsSumOfMatcherP variable.
|
|
|
|
EqualsSumOfMatcherP<int> a1 = EqualsSumOf(1);
|
|
|
|
|
|
|
|
// EqualsSumOf(p1, ..., pk) must be assignable to a EqualsSumOfMatcherPk
|
|
|
|
// variable, and so on.
|
|
|
|
EqualsSumOfMatcherP2<int, char> a2 = EqualsSumOf(1, '2');
|
|
|
|
EqualsSumOfMatcherP3<int, int, char> a3 = EqualsSumOf(1, 2, '3');
|
|
|
|
EqualsSumOfMatcherP4<int, int, int, char> a4 = EqualsSumOf(1, 2, 3, '4');
|
|
|
|
EqualsSumOfMatcherP5<int, int, int, int, char> a5 =
|
|
|
|
EqualsSumOf(1, 2, 3, 4, '5');
|
|
|
|
EqualsSumOfMatcherP6<int, int, int, int, int, char> a6 =
|
|
|
|
EqualsSumOf(1, 2, 3, 4, 5, '6');
|
|
|
|
EqualsSumOfMatcherP7<int, int, int, int, int, int, char> a7 =
|
|
|
|
EqualsSumOf(1, 2, 3, 4, 5, 6, '7');
|
|
|
|
EqualsSumOfMatcherP8<int, int, int, int, int, int, int, char> a8 =
|
|
|
|
EqualsSumOf(1, 2, 3, 4, 5, 6, 7, '8');
|
|
|
|
EqualsSumOfMatcherP9<int, int, int, int, int, int, int, int, char> a9 =
|
|
|
|
EqualsSumOf(1, 2, 3, 4, 5, 6, 7, 8, '9');
|
|
|
|
EqualsSumOfMatcherP10<int, int, int, int, int, int, int, int, int, char> a10 =
|
|
|
|
EqualsSumOf(1, 2, 3, 4, 5, 6, 7, 8, 9, '0');
|
|
|
|
}
|
|
|
|
|
2008-12-10 08:08:54 +03:00
|
|
|
} // namespace
|