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