1 // Copyright 2007, Google Inc. 2 // All rights reserved. 3 // 4 // Redistribution and use in source and binary forms, with or without 5 // modification, are permitted provided that the following conditions are 6 // met: 7 // 8 // * Redistributions of source code must retain the above copyright 9 // notice, this list of conditions and the following disclaimer. 10 // * Redistributions in binary form must reproduce the above 11 // copyright notice, this list of conditions and the following disclaimer 12 // in the documentation and/or other materials provided with the 13 // distribution. 14 // * Neither the name of Google Inc. nor the names of its 15 // contributors may be used to endorse or promote products derived from 16 // this software without specific prior written permission. 17 // 18 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS 19 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT 20 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR 21 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT 22 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, 23 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT 24 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 25 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 26 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 27 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 28 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 29 // 30 // Author: wan (at) google.com (Zhanyong Wan) 31 32 // Google Mock - a framework for writing C++ mock classes. 33 // 34 // This file implements Matcher<const string&>, Matcher<string>, and 35 // utilities for defining matchers. 36 37 #include "gmock/gmock-matchers.h" 38 #include "gmock/gmock-generated-matchers.h" 39 40 #include <string.h> 41 #include <sstream> 42 #include <string> 43 44 namespace testing { 45 46 // Constructs a matcher that matches a const string& whose value is 47 // equal to s. 48 Matcher<const internal::string&>::Matcher(const internal::string& s) { 49 *this = Eq(s); 50 } 51 52 // Constructs a matcher that matches a const string& whose value is 53 // equal to s. 54 Matcher<const internal::string&>::Matcher(const char* s) { 55 *this = Eq(internal::string(s)); 56 } 57 58 // Constructs a matcher that matches a string whose value is equal to s. 59 Matcher<internal::string>::Matcher(const internal::string& s) { *this = Eq(s); } 60 61 // Constructs a matcher that matches a string whose value is equal to s. 62 Matcher<internal::string>::Matcher(const char* s) { 63 *this = Eq(internal::string(s)); 64 } 65 66 namespace internal { 67 68 // Joins a vector of strings as if they are fields of a tuple; returns 69 // the joined string. 70 string JoinAsTuple(const Strings& fields) { 71 switch (fields.size()) { 72 case 0: 73 return ""; 74 case 1: 75 return fields[0]; 76 default: 77 string result = "(" + fields[0]; 78 for (size_t i = 1; i < fields.size(); i++) { 79 result += ", "; 80 result += fields[i]; 81 } 82 result += ")"; 83 return result; 84 } 85 } 86 87 // Returns the description for a matcher defined using the MATCHER*() 88 // macro where the user-supplied description string is "", if 89 // 'negation' is false; otherwise returns the description of the 90 // negation of the matcher. 'param_values' contains a list of strings 91 // that are the print-out of the matcher's parameters. 92 string FormatMatcherDescription(bool negation, const char* matcher_name, 93 const Strings& param_values) { 94 string result = ConvertIdentifierNameToWords(matcher_name); 95 if (param_values.size() >= 1) 96 result += " " + JoinAsTuple(param_values); 97 return negation ? "not (" + result + ")" : result; 98 } 99 100 } // namespace internal 101 } // namespace testing 102
