You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
SQA-Homework/gcov & lcov/output/usr/include/gtest/internal/gtest-internal.h.gcov.html

1416 lines
168 KiB

<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html lang="en">
<head>
<meta http-equiv="Content-Type" content="text/html; charset=UTF-8">
<title>LCOV - test.info - /usr/include/gtest/internal/gtest-internal.h</title>
<link rel="stylesheet" type="text/css" href="../../../../gcov.css">
</head>
<body>
<table width="100%" border=0 cellspacing=0 cellpadding=0>
<tr><td class="title">LCOV - code coverage report</td></tr>
<tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
<tr>
<td width="100%">
<table cellpadding=1 border=0 width="100%">
<tr>
<td width="10%" class="headerItem">Current view:</td>
<td width="35%" class="headerValue"><a href="../../../../index.html">top level</a> - <a href="index.html">usr/include/gtest/internal</a> - gtest-internal.h<span style="font-size: 80%;"> (source / <a href="gtest-internal.h.func-sort-c.html">functions</a>)</span></td>
<td width="5%"></td>
<td width="15%"></td>
<td width="10%" class="headerCovTableHead">Hit</td>
<td width="10%" class="headerCovTableHead">Total</td>
<td width="15%" class="headerCovTableHead">Coverage</td>
</tr>
<tr>
<td class="headerItem">Test:</td>
<td class="headerValue">test.info</td>
<td></td>
<td class="headerItem">Lines:</td>
<td class="headerCovTableEntry">5</td>
<td class="headerCovTableEntry">5</td>
<td class="headerCovTableEntryHi">100.0 %</td>
</tr>
<tr>
<td class="headerItem">Date:</td>
<td class="headerValue">2022-06-07 00:30:42</td>
<td></td>
<td class="headerItem">Functions:</td>
<td class="headerCovTableEntry">58</td>
<td class="headerCovTableEntry">59</td>
<td class="headerCovTableEntryHi">98.3 %</td>
</tr>
<tr>
<td></td>
<td></td>
<td></td>
<td class="headerItem">Branches:</td>
<td class="headerCovTableEntry">1</td>
<td class="headerCovTableEntry">2</td>
<td class="headerCovTableEntryLo">50.0 %</td>
</tr>
<tr><td><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
</table>
</td>
</tr>
<tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
</table>
<table cellpadding=0 cellspacing=0 border=0>
<tr>
<td><br></td>
</tr>
<tr>
<td>
<pre class="sourceHeading"> Branch data Line data Source code</pre>
<pre class="source">
<a name="1"><span class="lineNum"> 1 </span> : : // Copyright 2005, Google Inc.</a>
<a name="2"><span class="lineNum"> 2 </span> : : // All rights reserved.</a>
<a name="3"><span class="lineNum"> 3 </span> : : //</a>
<a name="4"><span class="lineNum"> 4 </span> : : // Redistribution and use in source and binary forms, with or without</a>
<a name="5"><span class="lineNum"> 5 </span> : : // modification, are permitted provided that the following conditions are</a>
<a name="6"><span class="lineNum"> 6 </span> : : // met:</a>
<a name="7"><span class="lineNum"> 7 </span> : : //</a>
<a name="8"><span class="lineNum"> 8 </span> : : // * Redistributions of source code must retain the above copyright</a>
<a name="9"><span class="lineNum"> 9 </span> : : // notice, this list of conditions and the following disclaimer.</a>
<a name="10"><span class="lineNum"> 10 </span> : : // * Redistributions in binary form must reproduce the above</a>
<a name="11"><span class="lineNum"> 11 </span> : : // copyright notice, this list of conditions and the following disclaimer</a>
<a name="12"><span class="lineNum"> 12 </span> : : // in the documentation and/or other materials provided with the</a>
<a name="13"><span class="lineNum"> 13 </span> : : // distribution.</a>
<a name="14"><span class="lineNum"> 14 </span> : : // * Neither the name of Google Inc. nor the names of its</a>
<a name="15"><span class="lineNum"> 15 </span> : : // contributors may be used to endorse or promote products derived from</a>
<a name="16"><span class="lineNum"> 16 </span> : : // this software without specific prior written permission.</a>
<a name="17"><span class="lineNum"> 17 </span> : : //</a>
<a name="18"><span class="lineNum"> 18 </span> : : // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS</a>
<a name="19"><span class="lineNum"> 19 </span> : : // &quot;AS IS&quot; AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT</a>
<a name="20"><span class="lineNum"> 20 </span> : : // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR</a>
<a name="21"><span class="lineNum"> 21 </span> : : // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT</a>
<a name="22"><span class="lineNum"> 22 </span> : : // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,</a>
<a name="23"><span class="lineNum"> 23 </span> : : // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT</a>
<a name="24"><span class="lineNum"> 24 </span> : : // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,</a>
<a name="25"><span class="lineNum"> 25 </span> : : // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY</a>
<a name="26"><span class="lineNum"> 26 </span> : : // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT</a>
<a name="27"><span class="lineNum"> 27 </span> : : // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE</a>
<a name="28"><span class="lineNum"> 28 </span> : : // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.</a>
<a name="29"><span class="lineNum"> 29 </span> : : //</a>
<a name="30"><span class="lineNum"> 30 </span> : : // The Google C++ Testing and Mocking Framework (Google Test)</a>
<a name="31"><span class="lineNum"> 31 </span> : : //</a>
<a name="32"><span class="lineNum"> 32 </span> : : // This header file declares functions and macros used internally by</a>
<a name="33"><span class="lineNum"> 33 </span> : : // Google Test. They are subject to change without notice.</a>
<a name="34"><span class="lineNum"> 34 </span> : : </a>
<a name="35"><span class="lineNum"> 35 </span> : : // GOOGLETEST_CM0001 DO NOT DELETE</a>
<a name="36"><span class="lineNum"> 36 </span> : : </a>
<a name="37"><span class="lineNum"> 37 </span> : : #ifndef GTEST_INCLUDE_GTEST_INTERNAL_GTEST_INTERNAL_H_</a>
<a name="38"><span class="lineNum"> 38 </span> : : #define GTEST_INCLUDE_GTEST_INTERNAL_GTEST_INTERNAL_H_</a>
<a name="39"><span class="lineNum"> 39 </span> : : </a>
<a name="40"><span class="lineNum"> 40 </span> : : #include &quot;gtest/internal/gtest-port.h&quot;</a>
<a name="41"><span class="lineNum"> 41 </span> : : </a>
<a name="42"><span class="lineNum"> 42 </span> : : #if GTEST_OS_LINUX</a>
<a name="43"><span class="lineNum"> 43 </span> : : # include &lt;stdlib.h&gt;</a>
<a name="44"><span class="lineNum"> 44 </span> : : # include &lt;sys/types.h&gt;</a>
<a name="45"><span class="lineNum"> 45 </span> : : # include &lt;sys/wait.h&gt;</a>
<a name="46"><span class="lineNum"> 46 </span> : : # include &lt;unistd.h&gt;</a>
<a name="47"><span class="lineNum"> 47 </span> : : #endif // GTEST_OS_LINUX</a>
<a name="48"><span class="lineNum"> 48 </span> : : </a>
<a name="49"><span class="lineNum"> 49 </span> : : #if GTEST_HAS_EXCEPTIONS</a>
<a name="50"><span class="lineNum"> 50 </span> : : # include &lt;stdexcept&gt;</a>
<a name="51"><span class="lineNum"> 51 </span> : : #endif</a>
<a name="52"><span class="lineNum"> 52 </span> : : </a>
<a name="53"><span class="lineNum"> 53 </span> : : #include &lt;ctype.h&gt;</a>
<a name="54"><span class="lineNum"> 54 </span> : : #include &lt;float.h&gt;</a>
<a name="55"><span class="lineNum"> 55 </span> : : #include &lt;string.h&gt;</a>
<a name="56"><span class="lineNum"> 56 </span> : : #include &lt;iomanip&gt;</a>
<a name="57"><span class="lineNum"> 57 </span> : : #include &lt;limits&gt;</a>
<a name="58"><span class="lineNum"> 58 </span> : : #include &lt;map&gt;</a>
<a name="59"><span class="lineNum"> 59 </span> : : #include &lt;set&gt;</a>
<a name="60"><span class="lineNum"> 60 </span> : : #include &lt;string&gt;</a>
<a name="61"><span class="lineNum"> 61 </span> : : #include &lt;vector&gt;</a>
<a name="62"><span class="lineNum"> 62 </span> : : </a>
<a name="63"><span class="lineNum"> 63 </span> : : #include &quot;gtest/gtest-message.h&quot;</a>
<a name="64"><span class="lineNum"> 64 </span> : : #include &quot;gtest/internal/gtest-filepath.h&quot;</a>
<a name="65"><span class="lineNum"> 65 </span> : : #include &quot;gtest/internal/gtest-string.h&quot;</a>
<a name="66"><span class="lineNum"> 66 </span> : : #include &quot;gtest/internal/gtest-type-util.h&quot;</a>
<a name="67"><span class="lineNum"> 67 </span> : : </a>
<a name="68"><span class="lineNum"> 68 </span> : : // Due to C++ preprocessor weirdness, we need double indirection to</a>
<a name="69"><span class="lineNum"> 69 </span> : : // concatenate two tokens when one of them is __LINE__. Writing</a>
<a name="70"><span class="lineNum"> 70 </span> : : //</a>
<a name="71"><span class="lineNum"> 71 </span> : : // foo ## __LINE__</a>
<a name="72"><span class="lineNum"> 72 </span> : : //</a>
<a name="73"><span class="lineNum"> 73 </span> : : // will result in the token foo__LINE__, instead of foo followed by</a>
<a name="74"><span class="lineNum"> 74 </span> : : // the current line number. For more details, see</a>
<a name="75"><span class="lineNum"> 75 </span> : : // http://www.parashift.com/c++-faq-lite/misc-technical-issues.html#faq-39.6</a>
<a name="76"><span class="lineNum"> 76 </span> : : #define GTEST_CONCAT_TOKEN_(foo, bar) GTEST_CONCAT_TOKEN_IMPL_(foo, bar)</a>
<a name="77"><span class="lineNum"> 77 </span> : : #define GTEST_CONCAT_TOKEN_IMPL_(foo, bar) foo ## bar</a>
<a name="78"><span class="lineNum"> 78 </span> : : </a>
<a name="79"><span class="lineNum"> 79 </span> : : // Stringifies its argument.</a>
<a name="80"><span class="lineNum"> 80 </span> : : #define GTEST_STRINGIFY_(name) #name</a>
<a name="81"><span class="lineNum"> 81 </span> : : </a>
<a name="82"><span class="lineNum"> 82 </span> : : class ProtocolMessage;</a>
<a name="83"><span class="lineNum"> 83 </span> : : namespace proto2 { class Message; }</a>
<a name="84"><span class="lineNum"> 84 </span> : : </a>
<a name="85"><span class="lineNum"> 85 </span> : : namespace testing {</a>
<a name="86"><span class="lineNum"> 86 </span> : : </a>
<a name="87"><span class="lineNum"> 87 </span> : : // Forward declarations.</a>
<a name="88"><span class="lineNum"> 88 </span> : : </a>
<a name="89"><span class="lineNum"> 89 </span> : : class AssertionResult; // Result of an assertion.</a>
<a name="90"><span class="lineNum"> 90 </span> : : class Message; // Represents a failure message.</a>
<a name="91"><span class="lineNum"> 91 </span> : : class Test; // Represents a test.</a>
<a name="92"><span class="lineNum"> 92 </span> : : class TestInfo; // Information about a test.</a>
<a name="93"><span class="lineNum"> 93 </span> : : class TestPartResult; // Result of a test part.</a>
<a name="94"><span class="lineNum"> 94 </span> : : class UnitTest; // A collection of test cases.</a>
<a name="95"><span class="lineNum"> 95 </span> : : </a>
<a name="96"><span class="lineNum"> 96 </span> : : template &lt;typename T&gt;</a>
<a name="97"><span class="lineNum"> 97 </span> : : ::std::string PrintToString(const T&amp; value);</a>
<a name="98"><span class="lineNum"> 98 </span> : : </a>
<a name="99"><span class="lineNum"> 99 </span> : : namespace internal {</a>
<a name="100"><span class="lineNum"> 100 </span> : : </a>
<a name="101"><span class="lineNum"> 101 </span> : : struct TraceInfo; // Information about a trace point.</a>
<a name="102"><span class="lineNum"> 102 </span> : : class TestInfoImpl; // Opaque implementation of TestInfo</a>
<a name="103"><span class="lineNum"> 103 </span> : : class UnitTestImpl; // Opaque implementation of UnitTest</a>
<a name="104"><span class="lineNum"> 104 </span> : : </a>
<a name="105"><span class="lineNum"> 105 </span> : : // The text used in failure messages to indicate the start of the</a>
<a name="106"><span class="lineNum"> 106 </span> : : // stack trace.</a>
<a name="107"><span class="lineNum"> 107 </span> : : GTEST_API_ extern const char kStackTraceMarker[];</a>
<a name="108"><span class="lineNum"> 108 </span> : : </a>
<a name="109"><span class="lineNum"> 109 </span> : : // Two overloaded helpers for checking at compile time whether an</a>
<a name="110"><span class="lineNum"> 110 </span> : : // expression is a null pointer literal (i.e. NULL or any 0-valued</a>
<a name="111"><span class="lineNum"> 111 </span> : : // compile-time integral constant). Their return values have</a>
<a name="112"><span class="lineNum"> 112 </span> : : // different sizes, so we can use sizeof() to test which version is</a>
<a name="113"><span class="lineNum"> 113 </span> : : // picked by the compiler. These helpers have no implementations, as</a>
<a name="114"><span class="lineNum"> 114 </span> : : // we only need their signatures.</a>
<a name="115"><span class="lineNum"> 115 </span> : : //</a>
<a name="116"><span class="lineNum"> 116 </span> : : // Given IsNullLiteralHelper(x), the compiler will pick the first</a>
<a name="117"><span class="lineNum"> 117 </span> : : // version if x can be implicitly converted to Secret*, and pick the</a>
<a name="118"><span class="lineNum"> 118 </span> : : // second version otherwise. Since Secret is a secret and incomplete</a>
<a name="119"><span class="lineNum"> 119 </span> : : // type, the only expression a user can write that has type Secret* is</a>
<a name="120"><span class="lineNum"> 120 </span> : : // a null pointer literal. Therefore, we know that x is a null</a>
<a name="121"><span class="lineNum"> 121 </span> : : // pointer literal if and only if the first version is picked by the</a>
<a name="122"><span class="lineNum"> 122 </span> : : // compiler.</a>
<a name="123"><span class="lineNum"> 123 </span> : : char IsNullLiteralHelper(Secret* p);</a>
<a name="124"><span class="lineNum"> 124 </span> : : char (&amp;IsNullLiteralHelper(...))[2]; // NOLINT</a>
<a name="125"><span class="lineNum"> 125 </span> : : </a>
<a name="126"><span class="lineNum"> 126 </span> : : // A compile-time bool constant that is true if and only if x is a</a>
<a name="127"><span class="lineNum"> 127 </span> : : // null pointer literal (i.e. NULL or any 0-valued compile-time</a>
<a name="128"><span class="lineNum"> 128 </span> : : // integral constant).</a>
<a name="129"><span class="lineNum"> 129 </span> : : #ifdef GTEST_ELLIPSIS_NEEDS_POD_</a>
<a name="130"><span class="lineNum"> 130 </span> : : // We lose support for NULL detection where the compiler doesn't like</a>
<a name="131"><span class="lineNum"> 131 </span> : : // passing non-POD classes through ellipsis (...).</a>
<a name="132"><span class="lineNum"> 132 </span> : : # define GTEST_IS_NULL_LITERAL_(x) false</a>
<a name="133"><span class="lineNum"> 133 </span> : : #else</a>
<a name="134"><span class="lineNum"> 134 </span> : : # define GTEST_IS_NULL_LITERAL_(x) \</a>
<a name="135"><span class="lineNum"> 135 </span> : : (sizeof(::testing::internal::IsNullLiteralHelper(x)) == 1)</a>
<a name="136"><span class="lineNum"> 136 </span> : : #endif // GTEST_ELLIPSIS_NEEDS_POD_</a>
<a name="137"><span class="lineNum"> 137 </span> : : </a>
<a name="138"><span class="lineNum"> 138 </span> : : // Appends the user-supplied message to the Google-Test-generated message.</a>
<a name="139"><span class="lineNum"> 139 </span> : : GTEST_API_ std::string AppendUserMessage(</a>
<a name="140"><span class="lineNum"> 140 </span> : : const std::string&amp; gtest_msg, const Message&amp; user_msg);</a>
<a name="141"><span class="lineNum"> 141 </span> : : </a>
<a name="142"><span class="lineNum"> 142 </span> : : #if GTEST_HAS_EXCEPTIONS</a>
<a name="143"><span class="lineNum"> 143 </span> : : </a>
<a name="144"><span class="lineNum"> 144 </span> : : GTEST_DISABLE_MSC_WARNINGS_PUSH_(4275 \</a>
<a name="145"><span class="lineNum"> 145 </span> : : /* an exported class was derived from a class that was not exported */)</a>
<a name="146"><span class="lineNum"> 146 </span> : : </a>
<a name="147"><span class="lineNum"> 147 </span> : : // This exception is thrown by (and only by) a failed Google Test</a>
<a name="148"><span class="lineNum"> 148 </span> : : // assertion when GTEST_FLAG(throw_on_failure) is true (if exceptions</a>
<a name="149"><span class="lineNum"> 149 </span> : : // are enabled). We derive it from std::runtime_error, which is for</a>
<a name="150"><span class="lineNum"> 150 </span> : : // errors presumably detectable only at run time. Since</a>
<a name="151"><span class="lineNum"> 151 </span> : : // std::runtime_error inherits from std::exception, many testing</a>
<a name="152"><span class="lineNum"> 152 </span> : : // frameworks know how to extract and print the message inside it.</a>
<a name="153"><span class="lineNum"> 153 </span> : : class GTEST_API_ GoogleTestFailureException : public ::std::runtime_error {</a>
<a name="154"><span class="lineNum"> 154 </span> : : public:</a>
<a name="155"><span class="lineNum"> 155 </span> : : explicit GoogleTestFailureException(const TestPartResult&amp; failure);</a>
<a name="156"><span class="lineNum"> 156 </span> : : };</a>
<a name="157"><span class="lineNum"> 157 </span> : : </a>
<a name="158"><span class="lineNum"> 158 </span> : : GTEST_DISABLE_MSC_WARNINGS_POP_() // 4275</a>
<a name="159"><span class="lineNum"> 159 </span> : : </a>
<a name="160"><span class="lineNum"> 160 </span> : : #endif // GTEST_HAS_EXCEPTIONS</a>
<a name="161"><span class="lineNum"> 161 </span> : : </a>
<a name="162"><span class="lineNum"> 162 </span> : : namespace edit_distance {</a>
<a name="163"><span class="lineNum"> 163 </span> : : // Returns the optimal edits to go from 'left' to 'right'.</a>
<a name="164"><span class="lineNum"> 164 </span> : : // All edits cost the same, with replace having lower priority than</a>
<a name="165"><span class="lineNum"> 165 </span> : : // add/remove.</a>
<a name="166"><span class="lineNum"> 166 </span> : : // Simple implementation of the Wagner-Fischer algorithm.</a>
<a name="167"><span class="lineNum"> 167 </span> : : // See http://en.wikipedia.org/wiki/Wagner-Fischer_algorithm</a>
<a name="168"><span class="lineNum"> 168 </span> : : enum EditType { kMatch, kAdd, kRemove, kReplace };</a>
<a name="169"><span class="lineNum"> 169 </span> : : GTEST_API_ std::vector&lt;EditType&gt; CalculateOptimalEdits(</a>
<a name="170"><span class="lineNum"> 170 </span> : : const std::vector&lt;size_t&gt;&amp; left, const std::vector&lt;size_t&gt;&amp; right);</a>
<a name="171"><span class="lineNum"> 171 </span> : : </a>
<a name="172"><span class="lineNum"> 172 </span> : : // Same as above, but the input is represented as strings.</a>
<a name="173"><span class="lineNum"> 173 </span> : : GTEST_API_ std::vector&lt;EditType&gt; CalculateOptimalEdits(</a>
<a name="174"><span class="lineNum"> 174 </span> : : const std::vector&lt;std::string&gt;&amp; left,</a>
<a name="175"><span class="lineNum"> 175 </span> : : const std::vector&lt;std::string&gt;&amp; right);</a>
<a name="176"><span class="lineNum"> 176 </span> : : </a>
<a name="177"><span class="lineNum"> 177 </span> : : // Create a diff of the input strings in Unified diff format.</a>
<a name="178"><span class="lineNum"> 178 </span> : : GTEST_API_ std::string CreateUnifiedDiff(const std::vector&lt;std::string&gt;&amp; left,</a>
<a name="179"><span class="lineNum"> 179 </span> : : const std::vector&lt;std::string&gt;&amp; right,</a>
<a name="180"><span class="lineNum"> 180 </span> : : size_t context = 2);</a>
<a name="181"><span class="lineNum"> 181 </span> : : </a>
<a name="182"><span class="lineNum"> 182 </span> : : } // namespace edit_distance</a>
<a name="183"><span class="lineNum"> 183 </span> : : </a>
<a name="184"><span class="lineNum"> 184 </span> : : // Calculate the diff between 'left' and 'right' and return it in unified diff</a>
<a name="185"><span class="lineNum"> 185 </span> : : // format.</a>
<a name="186"><span class="lineNum"> 186 </span> : : // If not null, stores in 'total_line_count' the total number of lines found</a>
<a name="187"><span class="lineNum"> 187 </span> : : // in left + right.</a>
<a name="188"><span class="lineNum"> 188 </span> : : GTEST_API_ std::string DiffStrings(const std::string&amp; left,</a>
<a name="189"><span class="lineNum"> 189 </span> : : const std::string&amp; right,</a>
<a name="190"><span class="lineNum"> 190 </span> : : size_t* total_line_count);</a>
<a name="191"><span class="lineNum"> 191 </span> : : </a>
<a name="192"><span class="lineNum"> 192 </span> : : // Constructs and returns the message for an equality assertion</a>
<a name="193"><span class="lineNum"> 193 </span> : : // (e.g. ASSERT_EQ, EXPECT_STREQ, etc) failure.</a>
<a name="194"><span class="lineNum"> 194 </span> : : //</a>
<a name="195"><span class="lineNum"> 195 </span> : : // The first four parameters are the expressions used in the assertion</a>
<a name="196"><span class="lineNum"> 196 </span> : : // and their values, as strings. For example, for ASSERT_EQ(foo, bar)</a>
<a name="197"><span class="lineNum"> 197 </span> : : // where foo is 5 and bar is 6, we have:</a>
<a name="198"><span class="lineNum"> 198 </span> : : //</a>
<a name="199"><span class="lineNum"> 199 </span> : : // expected_expression: &quot;foo&quot;</a>
<a name="200"><span class="lineNum"> 200 </span> : : // actual_expression: &quot;bar&quot;</a>
<a name="201"><span class="lineNum"> 201 </span> : : // expected_value: &quot;5&quot;</a>
<a name="202"><span class="lineNum"> 202 </span> : : // actual_value: &quot;6&quot;</a>
<a name="203"><span class="lineNum"> 203 </span> : : //</a>
<a name="204"><span class="lineNum"> 204 </span> : : // The ignoring_case parameter is true iff the assertion is a</a>
<a name="205"><span class="lineNum"> 205 </span> : : // *_STRCASEEQ*. When it's true, the string &quot; (ignoring case)&quot; will</a>
<a name="206"><span class="lineNum"> 206 </span> : : // be inserted into the message.</a>
<a name="207"><span class="lineNum"> 207 </span> : : GTEST_API_ AssertionResult EqFailure(const char* expected_expression,</a>
<a name="208"><span class="lineNum"> 208 </span> : : const char* actual_expression,</a>
<a name="209"><span class="lineNum"> 209 </span> : : const std::string&amp; expected_value,</a>
<a name="210"><span class="lineNum"> 210 </span> : : const std::string&amp; actual_value,</a>
<a name="211"><span class="lineNum"> 211 </span> : : bool ignoring_case);</a>
<a name="212"><span class="lineNum"> 212 </span> : : </a>
<a name="213"><span class="lineNum"> 213 </span> : : // Constructs a failure message for Boolean assertions such as EXPECT_TRUE.</a>
<a name="214"><span class="lineNum"> 214 </span> : : GTEST_API_ std::string GetBoolAssertionFailureMessage(</a>
<a name="215"><span class="lineNum"> 215 </span> : : const AssertionResult&amp; assertion_result,</a>
<a name="216"><span class="lineNum"> 216 </span> : : const char* expression_text,</a>
<a name="217"><span class="lineNum"> 217 </span> : : const char* actual_predicate_value,</a>
<a name="218"><span class="lineNum"> 218 </span> : : const char* expected_predicate_value);</a>
<a name="219"><span class="lineNum"> 219 </span> : : </a>
<a name="220"><span class="lineNum"> 220 </span> : : // This template class represents an IEEE floating-point number</a>
<a name="221"><span class="lineNum"> 221 </span> : : // (either single-precision or double-precision, depending on the</a>
<a name="222"><span class="lineNum"> 222 </span> : : // template parameters).</a>
<a name="223"><span class="lineNum"> 223 </span> : : //</a>
<a name="224"><span class="lineNum"> 224 </span> : : // The purpose of this class is to do more sophisticated number</a>
<a name="225"><span class="lineNum"> 225 </span> : : // comparison. (Due to round-off error, etc, it's very unlikely that</a>
<a name="226"><span class="lineNum"> 226 </span> : : // two floating-points will be equal exactly. Hence a naive</a>
<a name="227"><span class="lineNum"> 227 </span> : : // comparison by the == operation often doesn't work.)</a>
<a name="228"><span class="lineNum"> 228 </span> : : //</a>
<a name="229"><span class="lineNum"> 229 </span> : : // Format of IEEE floating-point:</a>
<a name="230"><span class="lineNum"> 230 </span> : : //</a>
<a name="231"><span class="lineNum"> 231 </span> : : // The most-significant bit being the leftmost, an IEEE</a>
<a name="232"><span class="lineNum"> 232 </span> : : // floating-point looks like</a>
<a name="233"><span class="lineNum"> 233 </span> : : //</a>
<a name="234"><span class="lineNum"> 234 </span> : : // sign_bit exponent_bits fraction_bits</a>
<a name="235"><span class="lineNum"> 235 </span> : : //</a>
<a name="236"><span class="lineNum"> 236 </span> : : // Here, sign_bit is a single bit that designates the sign of the</a>
<a name="237"><span class="lineNum"> 237 </span> : : // number.</a>
<a name="238"><span class="lineNum"> 238 </span> : : //</a>
<a name="239"><span class="lineNum"> 239 </span> : : // For float, there are 8 exponent bits and 23 fraction bits.</a>
<a name="240"><span class="lineNum"> 240 </span> : : //</a>
<a name="241"><span class="lineNum"> 241 </span> : : // For double, there are 11 exponent bits and 52 fraction bits.</a>
<a name="242"><span class="lineNum"> 242 </span> : : //</a>
<a name="243"><span class="lineNum"> 243 </span> : : // More details can be found at</a>
<a name="244"><span class="lineNum"> 244 </span> : : // http://en.wikipedia.org/wiki/IEEE_floating-point_standard.</a>
<a name="245"><span class="lineNum"> 245 </span> : : //</a>
<a name="246"><span class="lineNum"> 246 </span> : : // Template parameter:</a>
<a name="247"><span class="lineNum"> 247 </span> : : //</a>
<a name="248"><span class="lineNum"> 248 </span> : : // RawType: the raw floating-point type (either float or double)</a>
<a name="249"><span class="lineNum"> 249 </span> : : template &lt;typename RawType&gt;</a>
<a name="250"><span class="lineNum"> 250 </span> : : class FloatingPoint {</a>
<a name="251"><span class="lineNum"> 251 </span> : : public:</a>
<a name="252"><span class="lineNum"> 252 </span> : : // Defines the unsigned integer type that has the same size as the</a>
<a name="253"><span class="lineNum"> 253 </span> : : // floating point number.</a>
<a name="254"><span class="lineNum"> 254 </span> : : typedef typename TypeWithSize&lt;sizeof(RawType)&gt;::UInt Bits;</a>
<a name="255"><span class="lineNum"> 255 </span> : : </a>
<a name="256"><span class="lineNum"> 256 </span> : : // Constants.</a>
<a name="257"><span class="lineNum"> 257 </span> : : </a>
<a name="258"><span class="lineNum"> 258 </span> : : // # of bits in a number.</a>
<a name="259"><span class="lineNum"> 259 </span> : : static const size_t kBitCount = 8*sizeof(RawType);</a>
<a name="260"><span class="lineNum"> 260 </span> : : </a>
<a name="261"><span class="lineNum"> 261 </span> : : // # of fraction bits in a number.</a>
<a name="262"><span class="lineNum"> 262 </span> : : static const size_t kFractionBitCount =</a>
<a name="263"><span class="lineNum"> 263 </span> : : std::numeric_limits&lt;RawType&gt;::digits - 1;</a>
<a name="264"><span class="lineNum"> 264 </span> : : </a>
<a name="265"><span class="lineNum"> 265 </span> : : // # of exponent bits in a number.</a>
<a name="266"><span class="lineNum"> 266 </span> : : static const size_t kExponentBitCount = kBitCount - 1 - kFractionBitCount;</a>
<a name="267"><span class="lineNum"> 267 </span> : : </a>
<a name="268"><span class="lineNum"> 268 </span> : : // The mask for the sign bit.</a>
<a name="269"><span class="lineNum"> 269 </span> : : static const Bits kSignBitMask = static_cast&lt;Bits&gt;(1) &lt;&lt; (kBitCount - 1);</a>
<a name="270"><span class="lineNum"> 270 </span> : : </a>
<a name="271"><span class="lineNum"> 271 </span> : : // The mask for the fraction bits.</a>
<a name="272"><span class="lineNum"> 272 </span> : : static const Bits kFractionBitMask =</a>
<a name="273"><span class="lineNum"> 273 </span> : : ~static_cast&lt;Bits&gt;(0) &gt;&gt; (kExponentBitCount + 1);</a>
<a name="274"><span class="lineNum"> 274 </span> : : </a>
<a name="275"><span class="lineNum"> 275 </span> : : // The mask for the exponent bits.</a>
<a name="276"><span class="lineNum"> 276 </span> : : static const Bits kExponentBitMask = ~(kSignBitMask | kFractionBitMask);</a>
<a name="277"><span class="lineNum"> 277 </span> : : </a>
<a name="278"><span class="lineNum"> 278 </span> : : // How many ULP's (Units in the Last Place) we want to tolerate when</a>
<a name="279"><span class="lineNum"> 279 </span> : : // comparing two numbers. The larger the value, the more error we</a>
<a name="280"><span class="lineNum"> 280 </span> : : // allow. A 0 value means that two numbers must be exactly the same</a>
<a name="281"><span class="lineNum"> 281 </span> : : // to be considered equal.</a>
<a name="282"><span class="lineNum"> 282 </span> : : //</a>
<a name="283"><span class="lineNum"> 283 </span> : : // The maximum error of a single floating-point operation is 0.5</a>
<a name="284"><span class="lineNum"> 284 </span> : : // units in the last place. On Intel CPU's, all floating-point</a>
<a name="285"><span class="lineNum"> 285 </span> : : // calculations are done with 80-bit precision, while double has 64</a>
<a name="286"><span class="lineNum"> 286 </span> : : // bits. Therefore, 4 should be enough for ordinary use.</a>
<a name="287"><span class="lineNum"> 287 </span> : : //</a>
<a name="288"><span class="lineNum"> 288 </span> : : // See the following article for more details on ULP:</a>
<a name="289"><span class="lineNum"> 289 </span> : : // http://randomascii.wordpress.com/2012/02/25/comparing-floating-point-numbers-2012-edition/</a>
<a name="290"><span class="lineNum"> 290 </span> : : static const size_t kMaxUlps = 4;</a>
<a name="291"><span class="lineNum"> 291 </span> : : </a>
<a name="292"><span class="lineNum"> 292 </span> : : // Constructs a FloatingPoint from a raw floating-point number.</a>
<a name="293"><span class="lineNum"> 293 </span> : : //</a>
<a name="294"><span class="lineNum"> 294 </span> : : // On an Intel CPU, passing a non-normalized NAN (Not a Number)</a>
<a name="295"><span class="lineNum"> 295 </span> : : // around may change its bits, although the new value is guaranteed</a>
<a name="296"><span class="lineNum"> 296 </span> : : // to be also a NAN. Therefore, don't expect this constructor to</a>
<a name="297"><span class="lineNum"> 297 </span> : : // preserve the bits in x when x is a NAN.</a>
<a name="298"><span class="lineNum"> 298 </span> : : explicit FloatingPoint(const RawType&amp; x) { u_.value_ = x; }</a>
<a name="299"><span class="lineNum"> 299 </span> : : </a>
<a name="300"><span class="lineNum"> 300 </span> : : // Static methods</a>
<a name="301"><span class="lineNum"> 301 </span> : : </a>
<a name="302"><span class="lineNum"> 302 </span> : : // Reinterprets a bit pattern as a floating-point number.</a>
<a name="303"><span class="lineNum"> 303 </span> : : //</a>
<a name="304"><span class="lineNum"> 304 </span> : : // This function is needed to test the AlmostEquals() method.</a>
<a name="305"><span class="lineNum"> 305 </span> : : static RawType ReinterpretBits(const Bits bits) {</a>
<a name="306"><span class="lineNum"> 306 </span> : : FloatingPoint fp(0);</a>
<a name="307"><span class="lineNum"> 307 </span> : : fp.u_.bits_ = bits;</a>
<a name="308"><span class="lineNum"> 308 </span> : : return fp.u_.value_;</a>
<a name="309"><span class="lineNum"> 309 </span> : : }</a>
<a name="310"><span class="lineNum"> 310 </span> : : </a>
<a name="311"><span class="lineNum"> 311 </span> : : // Returns the floating-point number that represent positive infinity.</a>
<a name="312"><span class="lineNum"> 312 </span> : : static RawType Infinity() {</a>
<a name="313"><span class="lineNum"> 313 </span> : : return ReinterpretBits(kExponentBitMask);</a>
<a name="314"><span class="lineNum"> 314 </span> : : }</a>
<a name="315"><span class="lineNum"> 315 </span> : : </a>
<a name="316"><span class="lineNum"> 316 </span> : : // Returns the maximum representable finite floating-point number.</a>
<a name="317"><span class="lineNum"> 317 </span> : : static RawType Max();</a>
<a name="318"><span class="lineNum"> 318 </span> : : </a>
<a name="319"><span class="lineNum"> 319 </span> : : // Non-static methods</a>
<a name="320"><span class="lineNum"> 320 </span> : : </a>
<a name="321"><span class="lineNum"> 321 </span> : : // Returns the bits that represents this number.</a>
<a name="322"><span class="lineNum"> 322 </span> : : const Bits &amp;bits() const { return u_.bits_; }</a>
<a name="323"><span class="lineNum"> 323 </span> : : </a>
<a name="324"><span class="lineNum"> 324 </span> : : // Returns the exponent bits of this number.</a>
<a name="325"><span class="lineNum"> 325 </span> : : Bits exponent_bits() const { return kExponentBitMask &amp; u_.bits_; }</a>
<a name="326"><span class="lineNum"> 326 </span> : : </a>
<a name="327"><span class="lineNum"> 327 </span> : : // Returns the fraction bits of this number.</a>
<a name="328"><span class="lineNum"> 328 </span> : : Bits fraction_bits() const { return kFractionBitMask &amp; u_.bits_; }</a>
<a name="329"><span class="lineNum"> 329 </span> : : </a>
<a name="330"><span class="lineNum"> 330 </span> : : // Returns the sign bit of this number.</a>
<a name="331"><span class="lineNum"> 331 </span> : : Bits sign_bit() const { return kSignBitMask &amp; u_.bits_; }</a>
<a name="332"><span class="lineNum"> 332 </span> : : </a>
<a name="333"><span class="lineNum"> 333 </span> : : // Returns true iff this is NAN (not a number).</a>
<a name="334"><span class="lineNum"> 334 </span> : : bool is_nan() const {</a>
<a name="335"><span class="lineNum"> 335 </span> : : // It's a NAN if the exponent bits are all ones and the fraction</a>
<a name="336"><span class="lineNum"> 336 </span> : : // bits are not entirely zeros.</a>
<a name="337"><span class="lineNum"> 337 </span> : : return (exponent_bits() == kExponentBitMask) &amp;&amp; (fraction_bits() != 0);</a>
<a name="338"><span class="lineNum"> 338 </span> : : }</a>
<a name="339"><span class="lineNum"> 339 </span> : : </a>
<a name="340"><span class="lineNum"> 340 </span> : : // Returns true iff this number is at most kMaxUlps ULP's away from</a>
<a name="341"><span class="lineNum"> 341 </span> : : // rhs. In particular, this function:</a>
<a name="342"><span class="lineNum"> 342 </span> : : //</a>
<a name="343"><span class="lineNum"> 343 </span> : : // - returns false if either number is (or both are) NAN.</a>
<a name="344"><span class="lineNum"> 344 </span> : : // - treats really large numbers as almost equal to infinity.</a>
<a name="345"><span class="lineNum"> 345 </span> : : // - thinks +0.0 and -0.0 are 0 DLP's apart.</a>
<a name="346"><span class="lineNum"> 346 </span> : : bool AlmostEquals(const FloatingPoint&amp; rhs) const {</a>
<a name="347"><span class="lineNum"> 347 </span> : : // The IEEE standard says that any comparison operation involving</a>
<a name="348"><span class="lineNum"> 348 </span> : : // a NAN must return false.</a>
<a name="349"><span class="lineNum"> 349 </span> : : if (is_nan() || rhs.is_nan()) return false;</a>
<a name="350"><span class="lineNum"> 350 </span> : : </a>
<a name="351"><span class="lineNum"> 351 </span> : : return DistanceBetweenSignAndMagnitudeNumbers(u_.bits_, rhs.u_.bits_)</a>
<a name="352"><span class="lineNum"> 352 </span> : : &lt;= kMaxUlps;</a>
<a name="353"><span class="lineNum"> 353 </span> : : }</a>
<a name="354"><span class="lineNum"> 354 </span> : : </a>
<a name="355"><span class="lineNum"> 355 </span> : : private:</a>
<a name="356"><span class="lineNum"> 356 </span> : : // The data type used to store the actual floating-point number.</a>
<a name="357"><span class="lineNum"> 357 </span> : : union FloatingPointUnion {</a>
<a name="358"><span class="lineNum"> 358 </span> : : RawType value_; // The raw floating-point number.</a>
<a name="359"><span class="lineNum"> 359 </span> : : Bits bits_; // The bits that represent the number.</a>
<a name="360"><span class="lineNum"> 360 </span> : : };</a>
<a name="361"><span class="lineNum"> 361 </span> : : </a>
<a name="362"><span class="lineNum"> 362 </span> : : // Converts an integer from the sign-and-magnitude representation to</a>
<a name="363"><span class="lineNum"> 363 </span> : : // the biased representation. More precisely, let N be 2 to the</a>
<a name="364"><span class="lineNum"> 364 </span> : : // power of (kBitCount - 1), an integer x is represented by the</a>
<a name="365"><span class="lineNum"> 365 </span> : : // unsigned number x + N.</a>
<a name="366"><span class="lineNum"> 366 </span> : : //</a>
<a name="367"><span class="lineNum"> 367 </span> : : // For instance,</a>
<a name="368"><span class="lineNum"> 368 </span> : : //</a>
<a name="369"><span class="lineNum"> 369 </span> : : // -N + 1 (the most negative number representable using</a>
<a name="370"><span class="lineNum"> 370 </span> : : // sign-and-magnitude) is represented by 1;</a>
<a name="371"><span class="lineNum"> 371 </span> : : // 0 is represented by N; and</a>
<a name="372"><span class="lineNum"> 372 </span> : : // N - 1 (the biggest number representable using</a>
<a name="373"><span class="lineNum"> 373 </span> : : // sign-and-magnitude) is represented by 2N - 1.</a>
<a name="374"><span class="lineNum"> 374 </span> : : //</a>
<a name="375"><span class="lineNum"> 375 </span> : : // Read http://en.wikipedia.org/wiki/Signed_number_representations</a>
<a name="376"><span class="lineNum"> 376 </span> : : // for more details on signed number representations.</a>
<a name="377"><span class="lineNum"> 377 </span> : : static Bits SignAndMagnitudeToBiased(const Bits &amp;sam) {</a>
<a name="378"><span class="lineNum"> 378 </span> : : if (kSignBitMask &amp; sam) {</a>
<a name="379"><span class="lineNum"> 379 </span> : : // sam represents a negative number.</a>
<a name="380"><span class="lineNum"> 380 </span> : : return ~sam + 1;</a>
<a name="381"><span class="lineNum"> 381 </span> : : } else {</a>
<a name="382"><span class="lineNum"> 382 </span> : : // sam represents a positive number.</a>
<a name="383"><span class="lineNum"> 383 </span> : : return kSignBitMask | sam;</a>
<a name="384"><span class="lineNum"> 384 </span> : : }</a>
<a name="385"><span class="lineNum"> 385 </span> : : }</a>
<a name="386"><span class="lineNum"> 386 </span> : : </a>
<a name="387"><span class="lineNum"> 387 </span> : : // Given two numbers in the sign-and-magnitude representation,</a>
<a name="388"><span class="lineNum"> 388 </span> : : // returns the distance between them as an unsigned number.</a>
<a name="389"><span class="lineNum"> 389 </span> : : static Bits DistanceBetweenSignAndMagnitudeNumbers(const Bits &amp;sam1,</a>
<a name="390"><span class="lineNum"> 390 </span> : : const Bits &amp;sam2) {</a>
<a name="391"><span class="lineNum"> 391 </span> : : const Bits biased1 = SignAndMagnitudeToBiased(sam1);</a>
<a name="392"><span class="lineNum"> 392 </span> : : const Bits biased2 = SignAndMagnitudeToBiased(sam2);</a>
<a name="393"><span class="lineNum"> 393 </span> : : return (biased1 &gt;= biased2) ? (biased1 - biased2) : (biased2 - biased1);</a>
<a name="394"><span class="lineNum"> 394 </span> : : }</a>
<a name="395"><span class="lineNum"> 395 </span> : : </a>
<a name="396"><span class="lineNum"> 396 </span> : : FloatingPointUnion u_;</a>
<a name="397"><span class="lineNum"> 397 </span> : : };</a>
<a name="398"><span class="lineNum"> 398 </span> : : </a>
<a name="399"><span class="lineNum"> 399 </span> : : // We cannot use std::numeric_limits&lt;T&gt;::max() as it clashes with the max()</a>
<a name="400"><span class="lineNum"> 400 </span> : : // macro defined by &lt;windows.h&gt;.</a>
<a name="401"><span class="lineNum"> 401 </span> : : template &lt;&gt;</a>
<a name="402"><span class="lineNum"> 402 </span> : : inline float FloatingPoint&lt;float&gt;::Max() { return FLT_MAX; }</a>
<a name="403"><span class="lineNum"> 403 </span> : : template &lt;&gt;</a>
<a name="404"><span class="lineNum"> 404 </span> : : inline double FloatingPoint&lt;double&gt;::Max() { return DBL_MAX; }</a>
<a name="405"><span class="lineNum"> 405 </span> : : </a>
<a name="406"><span class="lineNum"> 406 </span> : : // Typedefs the instances of the FloatingPoint template class that we</a>
<a name="407"><span class="lineNum"> 407 </span> : : // care to use.</a>
<a name="408"><span class="lineNum"> 408 </span> : : typedef FloatingPoint&lt;float&gt; Float;</a>
<a name="409"><span class="lineNum"> 409 </span> : : typedef FloatingPoint&lt;double&gt; Double;</a>
<a name="410"><span class="lineNum"> 410 </span> : : </a>
<a name="411"><span class="lineNum"> 411 </span> : : // In order to catch the mistake of putting tests that use different</a>
<a name="412"><span class="lineNum"> 412 </span> : : // test fixture classes in the same test case, we need to assign</a>
<a name="413"><span class="lineNum"> 413 </span> : : // unique IDs to fixture classes and compare them. The TypeId type is</a>
<a name="414"><span class="lineNum"> 414 </span> : : // used to hold such IDs. The user should treat TypeId as an opaque</a>
<a name="415"><span class="lineNum"> 415 </span> : : // type: the only operation allowed on TypeId values is to compare</a>
<a name="416"><span class="lineNum"> 416 </span> : : // them for equality using the == operator.</a>
<a name="417"><span class="lineNum"> 417 </span> : : typedef const void* TypeId;</a>
<a name="418"><span class="lineNum"> 418 </span> : : </a>
<a name="419"><span class="lineNum"> 419 </span> : : template &lt;typename T&gt;</a>
<a name="420"><span class="lineNum"> 420 </span> : : class TypeIdHelper {</a>
<a name="421"><span class="lineNum"> 421 </span> : : public:</a>
<a name="422"><span class="lineNum"> 422 </span> : : // dummy_ must not have a const type. Otherwise an overly eager</a>
<a name="423"><span class="lineNum"> 423 </span> : : // compiler (e.g. MSVC 7.1 &amp; 8.0) may try to merge</a>
<a name="424"><span class="lineNum"> 424 </span> : : // TypeIdHelper&lt;T&gt;::dummy_ for different Ts as an &quot;optimization&quot;.</a>
<a name="425"><span class="lineNum"> 425 </span> : : static bool dummy_;</a>
<a name="426"><span class="lineNum"> 426 </span> : : };</a>
<a name="427"><span class="lineNum"> 427 </span> : : </a>
<a name="428"><span class="lineNum"> 428 </span> : : template &lt;typename T&gt;</a>
<a name="429"><span class="lineNum"> 429 </span> : : bool TypeIdHelper&lt;T&gt;::dummy_ = false;</a>
<a name="430"><span class="lineNum"> 430 </span> : : </a>
<a name="431"><span class="lineNum"> 431 </span> : : // GetTypeId&lt;T&gt;() returns the ID of type T. Different values will be</a>
<a name="432"><span class="lineNum"> 432 </span> : : // returned for different types. Calling the function twice with the</a>
<a name="433"><span class="lineNum"> 433 </span> : : // same type argument is guaranteed to return the same ID.</a>
<a name="434"><span class="lineNum"> 434 </span> : : template &lt;typename T&gt;</a>
<a name="435"><span class="lineNum"> 435 </span> : : TypeId GetTypeId() {</a>
<a name="436"><span class="lineNum"> 436 </span> : : // The compiler is required to allocate a different</a>
<a name="437"><span class="lineNum"> 437 </span> : : // TypeIdHelper&lt;T&gt;::dummy_ variable for each T used to instantiate</a>
<a name="438"><span class="lineNum"> 438 </span> : : // the template. Therefore, the address of dummy_ is guaranteed to</a>
<a name="439"><span class="lineNum"> 439 </span> : : // be unique.</a>
<a name="440"><span class="lineNum"> 440 </span> : : return &amp;(TypeIdHelper&lt;T&gt;::dummy_);</a>
<a name="441"><span class="lineNum"> 441 </span> : : }</a>
<a name="442"><span class="lineNum"> 442 </span> : : </a>
<a name="443"><span class="lineNum"> 443 </span> : : // Returns the type ID of ::testing::Test. Always call this instead</a>
<a name="444"><span class="lineNum"> 444 </span> : : // of GetTypeId&lt; ::testing::Test&gt;() to get the type ID of</a>
<a name="445"><span class="lineNum"> 445 </span> : : // ::testing::Test, as the latter may give the wrong result due to a</a>
<a name="446"><span class="lineNum"> 446 </span> : : // suspected linker bug when compiling Google Test as a Mac OS X</a>
<a name="447"><span class="lineNum"> 447 </span> : : // framework.</a>
<a name="448"><span class="lineNum"> 448 </span> : : GTEST_API_ TypeId GetTestTypeId();</a>
<a name="449"><span class="lineNum"> 449 </span> : : </a>
<a name="450"><span class="lineNum"> 450 </span> : : // Defines the abstract factory interface that creates instances</a>
<a name="451"><span class="lineNum"> 451 </span> : : // of a Test object.</a>
<a name="452"><span class="lineNum"> 452 </span> : : class TestFactoryBase {</a>
<a name="453"><span class="lineNum"> 453 </span> : : public:</a>
<a name="454"><span class="lineNum"> 454 </span> :<span class="lineCov"> 55 : virtual ~TestFactoryBase() {}</span></a>
<a name="455"><span class="lineNum"> 455 </span> : : </a>
<a name="456"><span class="lineNum"> 456 </span> : : // Creates a test instance to run. The instance is both created and destroyed</a>
<a name="457"><span class="lineNum"> 457 </span> : : // within TestInfoImpl::Run()</a>
<a name="458"><span class="lineNum"> 458 </span> : : virtual Test* CreateTest() = 0;</a>
<a name="459"><span class="lineNum"> 459 </span> : : </a>
<a name="460"><span class="lineNum"> 460 </span> : : protected:</a>
<a name="461"><span class="lineNum"> 461 </span> :<span class="lineCov"> 55 : TestFactoryBase() {}</span></a>
<a name="462"><span class="lineNum"> 462 </span> : : </a>
<a name="463"><span class="lineNum"> 463 </span> : : private:</a>
<a name="464"><span class="lineNum"> 464 </span> : : GTEST_DISALLOW_COPY_AND_ASSIGN_(TestFactoryBase);</a>
<a name="465"><span class="lineNum"> 465 </span> : : };</a>
<a name="466"><span class="lineNum"> 466 </span> : : </a>
<a name="467"><span class="lineNum"> 467 </span> : : // This class provides implementation of TeastFactoryBase interface.</a>
<a name="468"><span class="lineNum"> 468 </span> : : // It is used in TEST and TEST_F macros.</a>
<a name="469"><span class="lineNum"> 469 </span> : : template &lt;class TestClass&gt;</a>
<a name="470"><span class="lineNum"> 470 </span> : : class TestFactoryImpl : public TestFactoryBase {</a>
<a name="471"><span class="lineNum"> 471 </span> : : public:</a>
<a name="472"><span class="lineNum"> 472 </span> [<span class="branchCov" title="Branch 0 was taken 55 times"> + </span><span class="branchNoCov" title="Branch 1 was not taken"> - </span>]:<span class="lineCov"> 55 : virtual Test* CreateTest() { return new TestClass; }</span></a>
<a name="473"><span class="lineNum"> 473 </span> : : };</a>
<a name="474"><span class="lineNum"> 474 </span> : : </a>
<a name="475"><span class="lineNum"> 475 </span> : : #if GTEST_OS_WINDOWS</a>
<a name="476"><span class="lineNum"> 476 </span> : : </a>
<a name="477"><span class="lineNum"> 477 </span> : : // Predicate-formatters for implementing the HRESULT checking macros</a>
<a name="478"><span class="lineNum"> 478 </span> : : // {ASSERT|EXPECT}_HRESULT_{SUCCEEDED|FAILED}</a>
<a name="479"><span class="lineNum"> 479 </span> : : // We pass a long instead of HRESULT to avoid causing an</a>
<a name="480"><span class="lineNum"> 480 </span> : : // include dependency for the HRESULT type.</a>
<a name="481"><span class="lineNum"> 481 </span> : : GTEST_API_ AssertionResult IsHRESULTSuccess(const char* expr,</a>
<a name="482"><span class="lineNum"> 482 </span> : : long hr); // NOLINT</a>
<a name="483"><span class="lineNum"> 483 </span> : : GTEST_API_ AssertionResult IsHRESULTFailure(const char* expr,</a>
<a name="484"><span class="lineNum"> 484 </span> : : long hr); // NOLINT</a>
<a name="485"><span class="lineNum"> 485 </span> : : </a>
<a name="486"><span class="lineNum"> 486 </span> : : #endif // GTEST_OS_WINDOWS</a>
<a name="487"><span class="lineNum"> 487 </span> : : </a>
<a name="488"><span class="lineNum"> 488 </span> : : // Types of SetUpTestCase() and TearDownTestCase() functions.</a>
<a name="489"><span class="lineNum"> 489 </span> : : typedef void (*SetUpTestCaseFunc)();</a>
<a name="490"><span class="lineNum"> 490 </span> : : typedef void (*TearDownTestCaseFunc)();</a>
<a name="491"><span class="lineNum"> 491 </span> : : </a>
<a name="492"><span class="lineNum"> 492 </span> : : struct CodeLocation {</a>
<a name="493"><span class="lineNum"> 493 </span> :<span class="lineCov"> 55 : CodeLocation(const std::string&amp; a_file, int a_line)</span></a>
<a name="494"><span class="lineNum"> 494 </span> :<span class="lineCov"> 55 : : file(a_file), line(a_line) {}</span></a>
<a name="495"><span class="lineNum"> 495 </span> : : </a>
<a name="496"><span class="lineNum"> 496 </span> : : std::string file;</a>
<a name="497"><span class="lineNum"> 497 </span> : : int line;</a>
<a name="498"><span class="lineNum"> 498 </span> : : };</a>
<a name="499"><span class="lineNum"> 499 </span> : : </a>
<a name="500"><span class="lineNum"> 500 </span> : : // Creates a new TestInfo object and registers it with Google Test;</a>
<a name="501"><span class="lineNum"> 501 </span> : : // returns the created object.</a>
<a name="502"><span class="lineNum"> 502 </span> : : //</a>
<a name="503"><span class="lineNum"> 503 </span> : : // Arguments:</a>
<a name="504"><span class="lineNum"> 504 </span> : : //</a>
<a name="505"><span class="lineNum"> 505 </span> : : // test_case_name: name of the test case</a>
<a name="506"><span class="lineNum"> 506 </span> : : // name: name of the test</a>
<a name="507"><span class="lineNum"> 507 </span> : : // type_param the name of the test's type parameter, or NULL if</a>
<a name="508"><span class="lineNum"> 508 </span> : : // this is not a typed or a type-parameterized test.</a>
<a name="509"><span class="lineNum"> 509 </span> : : // value_param text representation of the test's value parameter,</a>
<a name="510"><span class="lineNum"> 510 </span> : : // or NULL if this is not a type-parameterized test.</a>
<a name="511"><span class="lineNum"> 511 </span> : : // code_location: code location where the test is defined</a>
<a name="512"><span class="lineNum"> 512 </span> : : // fixture_class_id: ID of the test fixture class</a>
<a name="513"><span class="lineNum"> 513 </span> : : // set_up_tc: pointer to the function that sets up the test case</a>
<a name="514"><span class="lineNum"> 514 </span> : : // tear_down_tc: pointer to the function that tears down the test case</a>
<a name="515"><span class="lineNum"> 515 </span> : : // factory: pointer to the factory that creates a test object.</a>
<a name="516"><span class="lineNum"> 516 </span> : : // The newly created TestInfo instance will assume</a>
<a name="517"><span class="lineNum"> 517 </span> : : // ownership of the factory object.</a>
<a name="518"><span class="lineNum"> 518 </span> : : GTEST_API_ TestInfo* MakeAndRegisterTestInfo(</a>
<a name="519"><span class="lineNum"> 519 </span> : : const char* test_case_name,</a>
<a name="520"><span class="lineNum"> 520 </span> : : const char* name,</a>
<a name="521"><span class="lineNum"> 521 </span> : : const char* type_param,</a>
<a name="522"><span class="lineNum"> 522 </span> : : const char* value_param,</a>
<a name="523"><span class="lineNum"> 523 </span> : : CodeLocation code_location,</a>
<a name="524"><span class="lineNum"> 524 </span> : : TypeId fixture_class_id,</a>
<a name="525"><span class="lineNum"> 525 </span> : : SetUpTestCaseFunc set_up_tc,</a>
<a name="526"><span class="lineNum"> 526 </span> : : TearDownTestCaseFunc tear_down_tc,</a>
<a name="527"><span class="lineNum"> 527 </span> : : TestFactoryBase* factory);</a>
<a name="528"><span class="lineNum"> 528 </span> : : </a>
<a name="529"><span class="lineNum"> 529 </span> : : // If *pstr starts with the given prefix, modifies *pstr to be right</a>
<a name="530"><span class="lineNum"> 530 </span> : : // past the prefix and returns true; otherwise leaves *pstr unchanged</a>
<a name="531"><span class="lineNum"> 531 </span> : : // and returns false. None of pstr, *pstr, and prefix can be NULL.</a>
<a name="532"><span class="lineNum"> 532 </span> : : GTEST_API_ bool SkipPrefix(const char* prefix, const char** pstr);</a>
<a name="533"><span class="lineNum"> 533 </span> : : </a>
<a name="534"><span class="lineNum"> 534 </span> : : #if GTEST_HAS_TYPED_TEST || GTEST_HAS_TYPED_TEST_P</a>
<a name="535"><span class="lineNum"> 535 </span> : : </a>
<a name="536"><span class="lineNum"> 536 </span> : : GTEST_DISABLE_MSC_WARNINGS_PUSH_(4251 \</a>
<a name="537"><span class="lineNum"> 537 </span> : : /* class A needs to have dll-interface to be used by clients of class B */)</a>
<a name="538"><span class="lineNum"> 538 </span> : : </a>
<a name="539"><span class="lineNum"> 539 </span> : : // State of the definition of a type-parameterized test case.</a>
<a name="540"><span class="lineNum"> 540 </span> : : class GTEST_API_ TypedTestCasePState {</a>
<a name="541"><span class="lineNum"> 541 </span> : : public:</a>
<a name="542"><span class="lineNum"> 542 </span> : : TypedTestCasePState() : registered_(false) {}</a>
<a name="543"><span class="lineNum"> 543 </span> : : </a>
<a name="544"><span class="lineNum"> 544 </span> : : // Adds the given test name to defined_test_names_ and return true</a>
<a name="545"><span class="lineNum"> 545 </span> : : // if the test case hasn't been registered; otherwise aborts the</a>
<a name="546"><span class="lineNum"> 546 </span> : : // program.</a>
<a name="547"><span class="lineNum"> 547 </span> : : bool AddTestName(const char* file, int line, const char* case_name,</a>
<a name="548"><span class="lineNum"> 548 </span> : : const char* test_name) {</a>
<a name="549"><span class="lineNum"> 549 </span> : : if (registered_) {</a>
<a name="550"><span class="lineNum"> 550 </span> : : fprintf(stderr, &quot;%s Test %s must be defined before &quot;</a>
<a name="551"><span class="lineNum"> 551 </span> : : &quot;REGISTER_TYPED_TEST_CASE_P(%s, ...).\n&quot;,</a>
<a name="552"><span class="lineNum"> 552 </span> : : FormatFileLocation(file, line).c_str(), test_name, case_name);</a>
<a name="553"><span class="lineNum"> 553 </span> : : fflush(stderr);</a>
<a name="554"><span class="lineNum"> 554 </span> : : posix::Abort();</a>
<a name="555"><span class="lineNum"> 555 </span> : : }</a>
<a name="556"><span class="lineNum"> 556 </span> : : registered_tests_.insert(</a>
<a name="557"><span class="lineNum"> 557 </span> : : ::std::make_pair(test_name, CodeLocation(file, line)));</a>
<a name="558"><span class="lineNum"> 558 </span> : : return true;</a>
<a name="559"><span class="lineNum"> 559 </span> : : }</a>
<a name="560"><span class="lineNum"> 560 </span> : : </a>
<a name="561"><span class="lineNum"> 561 </span> : : bool TestExists(const std::string&amp; test_name) const {</a>
<a name="562"><span class="lineNum"> 562 </span> : : return registered_tests_.count(test_name) &gt; 0;</a>
<a name="563"><span class="lineNum"> 563 </span> : : }</a>
<a name="564"><span class="lineNum"> 564 </span> : : </a>
<a name="565"><span class="lineNum"> 565 </span> : : const CodeLocation&amp; GetCodeLocation(const std::string&amp; test_name) const {</a>
<a name="566"><span class="lineNum"> 566 </span> : : RegisteredTestsMap::const_iterator it = registered_tests_.find(test_name);</a>
<a name="567"><span class="lineNum"> 567 </span> : : GTEST_CHECK_(it != registered_tests_.end());</a>
<a name="568"><span class="lineNum"> 568 </span> : : return it-&gt;second;</a>
<a name="569"><span class="lineNum"> 569 </span> : : }</a>
<a name="570"><span class="lineNum"> 570 </span> : : </a>
<a name="571"><span class="lineNum"> 571 </span> : : // Verifies that registered_tests match the test names in</a>
<a name="572"><span class="lineNum"> 572 </span> : : // defined_test_names_; returns registered_tests if successful, or</a>
<a name="573"><span class="lineNum"> 573 </span> : : // aborts the program otherwise.</a>
<a name="574"><span class="lineNum"> 574 </span> : : const char* VerifyRegisteredTestNames(</a>
<a name="575"><span class="lineNum"> 575 </span> : : const char* file, int line, const char* registered_tests);</a>
<a name="576"><span class="lineNum"> 576 </span> : : </a>
<a name="577"><span class="lineNum"> 577 </span> : : private:</a>
<a name="578"><span class="lineNum"> 578 </span> : : typedef ::std::map&lt;std::string, CodeLocation&gt; RegisteredTestsMap;</a>
<a name="579"><span class="lineNum"> 579 </span> : : </a>
<a name="580"><span class="lineNum"> 580 </span> : : bool registered_;</a>
<a name="581"><span class="lineNum"> 581 </span> : : RegisteredTestsMap registered_tests_;</a>
<a name="582"><span class="lineNum"> 582 </span> : : };</a>
<a name="583"><span class="lineNum"> 583 </span> : : </a>
<a name="584"><span class="lineNum"> 584 </span> : : GTEST_DISABLE_MSC_WARNINGS_POP_() // 4251</a>
<a name="585"><span class="lineNum"> 585 </span> : : </a>
<a name="586"><span class="lineNum"> 586 </span> : : // Skips to the first non-space char after the first comma in 'str';</a>
<a name="587"><span class="lineNum"> 587 </span> : : // returns NULL if no comma is found in 'str'.</a>
<a name="588"><span class="lineNum"> 588 </span> : : inline const char* SkipComma(const char* str) {</a>
<a name="589"><span class="lineNum"> 589 </span> : : const char* comma = strchr(str, ',');</a>
<a name="590"><span class="lineNum"> 590 </span> : : if (comma == NULL) {</a>
<a name="591"><span class="lineNum"> 591 </span> : : return NULL;</a>
<a name="592"><span class="lineNum"> 592 </span> : : }</a>
<a name="593"><span class="lineNum"> 593 </span> : : while (IsSpace(*(++comma))) {}</a>
<a name="594"><span class="lineNum"> 594 </span> : : return comma;</a>
<a name="595"><span class="lineNum"> 595 </span> : : }</a>
<a name="596"><span class="lineNum"> 596 </span> : : </a>
<a name="597"><span class="lineNum"> 597 </span> : : // Returns the prefix of 'str' before the first comma in it; returns</a>
<a name="598"><span class="lineNum"> 598 </span> : : // the entire string if it contains no comma.</a>
<a name="599"><span class="lineNum"> 599 </span> : : inline std::string GetPrefixUntilComma(const char* str) {</a>
<a name="600"><span class="lineNum"> 600 </span> : : const char* comma = strchr(str, ',');</a>
<a name="601"><span class="lineNum"> 601 </span> : : return comma == NULL ? str : std::string(str, comma);</a>
<a name="602"><span class="lineNum"> 602 </span> : : }</a>
<a name="603"><span class="lineNum"> 603 </span> : : </a>
<a name="604"><span class="lineNum"> 604 </span> : : // Splits a given string on a given delimiter, populating a given</a>
<a name="605"><span class="lineNum"> 605 </span> : : // vector with the fields.</a>
<a name="606"><span class="lineNum"> 606 </span> : : void SplitString(const ::std::string&amp; str, char delimiter,</a>
<a name="607"><span class="lineNum"> 607 </span> : : ::std::vector&lt; ::std::string&gt;* dest);</a>
<a name="608"><span class="lineNum"> 608 </span> : : </a>
<a name="609"><span class="lineNum"> 609 </span> : : // The default argument to the template below for the case when the user does</a>
<a name="610"><span class="lineNum"> 610 </span> : : // not provide a name generator.</a>
<a name="611"><span class="lineNum"> 611 </span> : : struct DefaultNameGenerator {</a>
<a name="612"><span class="lineNum"> 612 </span> : : template &lt;typename T&gt;</a>
<a name="613"><span class="lineNum"> 613 </span> : : static std::string GetName(int i) {</a>
<a name="614"><span class="lineNum"> 614 </span> : : return StreamableToString(i);</a>
<a name="615"><span class="lineNum"> 615 </span> : : }</a>
<a name="616"><span class="lineNum"> 616 </span> : : };</a>
<a name="617"><span class="lineNum"> 617 </span> : : </a>
<a name="618"><span class="lineNum"> 618 </span> : : template &lt;typename Provided = DefaultNameGenerator&gt;</a>
<a name="619"><span class="lineNum"> 619 </span> : : struct NameGeneratorSelector {</a>
<a name="620"><span class="lineNum"> 620 </span> : : typedef Provided type;</a>
<a name="621"><span class="lineNum"> 621 </span> : : };</a>
<a name="622"><span class="lineNum"> 622 </span> : : </a>
<a name="623"><span class="lineNum"> 623 </span> : : template &lt;typename NameGenerator&gt;</a>
<a name="624"><span class="lineNum"> 624 </span> : : void GenerateNamesRecursively(Types0, std::vector&lt;std::string&gt;*, int) {}</a>
<a name="625"><span class="lineNum"> 625 </span> : : </a>
<a name="626"><span class="lineNum"> 626 </span> : : template &lt;typename NameGenerator, typename Types&gt;</a>
<a name="627"><span class="lineNum"> 627 </span> : : void GenerateNamesRecursively(Types, std::vector&lt;std::string&gt;* result, int i) {</a>
<a name="628"><span class="lineNum"> 628 </span> : : result-&gt;push_back(NameGenerator::template GetName&lt;typename Types::Head&gt;(i));</a>
<a name="629"><span class="lineNum"> 629 </span> : : GenerateNamesRecursively&lt;NameGenerator&gt;(typename Types::Tail(), result,</a>
<a name="630"><span class="lineNum"> 630 </span> : : i + 1);</a>
<a name="631"><span class="lineNum"> 631 </span> : : }</a>
<a name="632"><span class="lineNum"> 632 </span> : : </a>
<a name="633"><span class="lineNum"> 633 </span> : : template &lt;typename NameGenerator, typename Types&gt;</a>
<a name="634"><span class="lineNum"> 634 </span> : : std::vector&lt;std::string&gt; GenerateNames() {</a>
<a name="635"><span class="lineNum"> 635 </span> : : std::vector&lt;std::string&gt; result;</a>
<a name="636"><span class="lineNum"> 636 </span> : : GenerateNamesRecursively&lt;NameGenerator&gt;(Types(), &amp;result, 0);</a>
<a name="637"><span class="lineNum"> 637 </span> : : return result;</a>
<a name="638"><span class="lineNum"> 638 </span> : : }</a>
<a name="639"><span class="lineNum"> 639 </span> : : </a>
<a name="640"><span class="lineNum"> 640 </span> : : // TypeParameterizedTest&lt;Fixture, TestSel, Types&gt;::Register()</a>
<a name="641"><span class="lineNum"> 641 </span> : : // registers a list of type-parameterized tests with Google Test. The</a>
<a name="642"><span class="lineNum"> 642 </span> : : // return value is insignificant - we just need to return something</a>
<a name="643"><span class="lineNum"> 643 </span> : : // such that we can call this function in a namespace scope.</a>
<a name="644"><span class="lineNum"> 644 </span> : : //</a>
<a name="645"><span class="lineNum"> 645 </span> : : // Implementation note: The GTEST_TEMPLATE_ macro declares a template</a>
<a name="646"><span class="lineNum"> 646 </span> : : // template parameter. It's defined in gtest-type-util.h.</a>
<a name="647"><span class="lineNum"> 647 </span> : : template &lt;GTEST_TEMPLATE_ Fixture, class TestSel, typename Types&gt;</a>
<a name="648"><span class="lineNum"> 648 </span> : : class TypeParameterizedTest {</a>
<a name="649"><span class="lineNum"> 649 </span> : : public:</a>
<a name="650"><span class="lineNum"> 650 </span> : : // 'index' is the index of the test in the type list 'Types'</a>
<a name="651"><span class="lineNum"> 651 </span> : : // specified in INSTANTIATE_TYPED_TEST_CASE_P(Prefix, TestCase,</a>
<a name="652"><span class="lineNum"> 652 </span> : : // Types). Valid values for 'index' are [0, N - 1] where N is the</a>
<a name="653"><span class="lineNum"> 653 </span> : : // length of Types.</a>
<a name="654"><span class="lineNum"> 654 </span> : : static bool Register(const char* prefix, const CodeLocation&amp; code_location,</a>
<a name="655"><span class="lineNum"> 655 </span> : : const char* case_name, const char* test_names, int index,</a>
<a name="656"><span class="lineNum"> 656 </span> : : const std::vector&lt;std::string&gt;&amp; type_names =</a>
<a name="657"><span class="lineNum"> 657 </span> : : GenerateNames&lt;DefaultNameGenerator, Types&gt;()) {</a>
<a name="658"><span class="lineNum"> 658 </span> : : typedef typename Types::Head Type;</a>
<a name="659"><span class="lineNum"> 659 </span> : : typedef Fixture&lt;Type&gt; FixtureClass;</a>
<a name="660"><span class="lineNum"> 660 </span> : : typedef typename GTEST_BIND_(TestSel, Type) TestClass;</a>
<a name="661"><span class="lineNum"> 661 </span> : : </a>
<a name="662"><span class="lineNum"> 662 </span> : : // First, registers the first type-parameterized test in the type</a>
<a name="663"><span class="lineNum"> 663 </span> : : // list.</a>
<a name="664"><span class="lineNum"> 664 </span> : : MakeAndRegisterTestInfo(</a>
<a name="665"><span class="lineNum"> 665 </span> : : (std::string(prefix) + (prefix[0] == '\0' ? &quot;&quot; : &quot;/&quot;) + case_name +</a>
<a name="666"><span class="lineNum"> 666 </span> : : &quot;/&quot; + type_names[index])</a>
<a name="667"><span class="lineNum"> 667 </span> : : .c_str(),</a>
<a name="668"><span class="lineNum"> 668 </span> : : StripTrailingSpaces(GetPrefixUntilComma(test_names)).c_str(),</a>
<a name="669"><span class="lineNum"> 669 </span> : : GetTypeName&lt;Type&gt;().c_str(),</a>
<a name="670"><span class="lineNum"> 670 </span> : : NULL, // No value parameter.</a>
<a name="671"><span class="lineNum"> 671 </span> : : code_location, GetTypeId&lt;FixtureClass&gt;(), TestClass::SetUpTestCase,</a>
<a name="672"><span class="lineNum"> 672 </span> : : TestClass::TearDownTestCase, new TestFactoryImpl&lt;TestClass&gt;);</a>
<a name="673"><span class="lineNum"> 673 </span> : : </a>
<a name="674"><span class="lineNum"> 674 </span> : : // Next, recurses (at compile time) with the tail of the type list.</a>
<a name="675"><span class="lineNum"> 675 </span> : : return TypeParameterizedTest&lt;Fixture, TestSel,</a>
<a name="676"><span class="lineNum"> 676 </span> : : typename Types::Tail&gt;::Register(prefix,</a>
<a name="677"><span class="lineNum"> 677 </span> : : code_location,</a>
<a name="678"><span class="lineNum"> 678 </span> : : case_name,</a>
<a name="679"><span class="lineNum"> 679 </span> : : test_names,</a>
<a name="680"><span class="lineNum"> 680 </span> : : index + 1,</a>
<a name="681"><span class="lineNum"> 681 </span> : : type_names);</a>
<a name="682"><span class="lineNum"> 682 </span> : : }</a>
<a name="683"><span class="lineNum"> 683 </span> : : };</a>
<a name="684"><span class="lineNum"> 684 </span> : : </a>
<a name="685"><span class="lineNum"> 685 </span> : : // The base case for the compile time recursion.</a>
<a name="686"><span class="lineNum"> 686 </span> : : template &lt;GTEST_TEMPLATE_ Fixture, class TestSel&gt;</a>
<a name="687"><span class="lineNum"> 687 </span> : : class TypeParameterizedTest&lt;Fixture, TestSel, Types0&gt; {</a>
<a name="688"><span class="lineNum"> 688 </span> : : public:</a>
<a name="689"><span class="lineNum"> 689 </span> : : static bool Register(const char* /*prefix*/, const CodeLocation&amp;,</a>
<a name="690"><span class="lineNum"> 690 </span> : : const char* /*case_name*/, const char* /*test_names*/,</a>
<a name="691"><span class="lineNum"> 691 </span> : : int /*index*/,</a>
<a name="692"><span class="lineNum"> 692 </span> : : const std::vector&lt;std::string&gt;&amp; =</a>
<a name="693"><span class="lineNum"> 693 </span> : : std::vector&lt;std::string&gt;() /*type_names*/) {</a>
<a name="694"><span class="lineNum"> 694 </span> : : return true;</a>
<a name="695"><span class="lineNum"> 695 </span> : : }</a>
<a name="696"><span class="lineNum"> 696 </span> : : };</a>
<a name="697"><span class="lineNum"> 697 </span> : : </a>
<a name="698"><span class="lineNum"> 698 </span> : : // TypeParameterizedTestCase&lt;Fixture, Tests, Types&gt;::Register()</a>
<a name="699"><span class="lineNum"> 699 </span> : : // registers *all combinations* of 'Tests' and 'Types' with Google</a>
<a name="700"><span class="lineNum"> 700 </span> : : // Test. The return value is insignificant - we just need to return</a>
<a name="701"><span class="lineNum"> 701 </span> : : // something such that we can call this function in a namespace scope.</a>
<a name="702"><span class="lineNum"> 702 </span> : : template &lt;GTEST_TEMPLATE_ Fixture, typename Tests, typename Types&gt;</a>
<a name="703"><span class="lineNum"> 703 </span> : : class TypeParameterizedTestCase {</a>
<a name="704"><span class="lineNum"> 704 </span> : : public:</a>
<a name="705"><span class="lineNum"> 705 </span> : : static bool Register(const char* prefix, CodeLocation code_location,</a>
<a name="706"><span class="lineNum"> 706 </span> : : const TypedTestCasePState* state, const char* case_name,</a>
<a name="707"><span class="lineNum"> 707 </span> : : const char* test_names,</a>
<a name="708"><span class="lineNum"> 708 </span> : : const std::vector&lt;std::string&gt;&amp; type_names =</a>
<a name="709"><span class="lineNum"> 709 </span> : : GenerateNames&lt;DefaultNameGenerator, Types&gt;()) {</a>
<a name="710"><span class="lineNum"> 710 </span> : : std::string test_name = StripTrailingSpaces(</a>
<a name="711"><span class="lineNum"> 711 </span> : : GetPrefixUntilComma(test_names));</a>
<a name="712"><span class="lineNum"> 712 </span> : : if (!state-&gt;TestExists(test_name)) {</a>
<a name="713"><span class="lineNum"> 713 </span> : : fprintf(stderr, &quot;Failed to get code location for test %s.%s at %s.&quot;,</a>
<a name="714"><span class="lineNum"> 714 </span> : : case_name, test_name.c_str(),</a>
<a name="715"><span class="lineNum"> 715 </span> : : FormatFileLocation(code_location.file.c_str(),</a>
<a name="716"><span class="lineNum"> 716 </span> : : code_location.line).c_str());</a>
<a name="717"><span class="lineNum"> 717 </span> : : fflush(stderr);</a>
<a name="718"><span class="lineNum"> 718 </span> : : posix::Abort();</a>
<a name="719"><span class="lineNum"> 719 </span> : : }</a>
<a name="720"><span class="lineNum"> 720 </span> : : const CodeLocation&amp; test_location = state-&gt;GetCodeLocation(test_name);</a>
<a name="721"><span class="lineNum"> 721 </span> : : </a>
<a name="722"><span class="lineNum"> 722 </span> : : typedef typename Tests::Head Head;</a>
<a name="723"><span class="lineNum"> 723 </span> : : </a>
<a name="724"><span class="lineNum"> 724 </span> : : // First, register the first test in 'Test' for each type in 'Types'.</a>
<a name="725"><span class="lineNum"> 725 </span> : : TypeParameterizedTest&lt;Fixture, Head, Types&gt;::Register(</a>
<a name="726"><span class="lineNum"> 726 </span> : : prefix, test_location, case_name, test_names, 0, type_names);</a>
<a name="727"><span class="lineNum"> 727 </span> : : </a>
<a name="728"><span class="lineNum"> 728 </span> : : // Next, recurses (at compile time) with the tail of the test list.</a>
<a name="729"><span class="lineNum"> 729 </span> : : return TypeParameterizedTestCase&lt;Fixture, typename Tests::Tail,</a>
<a name="730"><span class="lineNum"> 730 </span> : : Types&gt;::Register(prefix, code_location,</a>
<a name="731"><span class="lineNum"> 731 </span> : : state, case_name,</a>
<a name="732"><span class="lineNum"> 732 </span> : : SkipComma(test_names),</a>
<a name="733"><span class="lineNum"> 733 </span> : : type_names);</a>
<a name="734"><span class="lineNum"> 734 </span> : : }</a>
<a name="735"><span class="lineNum"> 735 </span> : : };</a>
<a name="736"><span class="lineNum"> 736 </span> : : </a>
<a name="737"><span class="lineNum"> 737 </span> : : // The base case for the compile time recursion.</a>
<a name="738"><span class="lineNum"> 738 </span> : : template &lt;GTEST_TEMPLATE_ Fixture, typename Types&gt;</a>
<a name="739"><span class="lineNum"> 739 </span> : : class TypeParameterizedTestCase&lt;Fixture, Templates0, Types&gt; {</a>
<a name="740"><span class="lineNum"> 740 </span> : : public:</a>
<a name="741"><span class="lineNum"> 741 </span> : : static bool Register(const char* /*prefix*/, const CodeLocation&amp;,</a>
<a name="742"><span class="lineNum"> 742 </span> : : const TypedTestCasePState* /*state*/,</a>
<a name="743"><span class="lineNum"> 743 </span> : : const char* /*case_name*/, const char* /*test_names*/,</a>
<a name="744"><span class="lineNum"> 744 </span> : : const std::vector&lt;std::string&gt;&amp; =</a>
<a name="745"><span class="lineNum"> 745 </span> : : std::vector&lt;std::string&gt;() /*type_names*/) {</a>
<a name="746"><span class="lineNum"> 746 </span> : : return true;</a>
<a name="747"><span class="lineNum"> 747 </span> : : }</a>
<a name="748"><span class="lineNum"> 748 </span> : : };</a>
<a name="749"><span class="lineNum"> 749 </span> : : </a>
<a name="750"><span class="lineNum"> 750 </span> : : #endif // GTEST_HAS_TYPED_TEST || GTEST_HAS_TYPED_TEST_P</a>
<a name="751"><span class="lineNum"> 751 </span> : : </a>
<a name="752"><span class="lineNum"> 752 </span> : : // Returns the current OS stack trace as an std::string.</a>
<a name="753"><span class="lineNum"> 753 </span> : : //</a>
<a name="754"><span class="lineNum"> 754 </span> : : // The maximum number of stack frames to be included is specified by</a>
<a name="755"><span class="lineNum"> 755 </span> : : // the gtest_stack_trace_depth flag. The skip_count parameter</a>
<a name="756"><span class="lineNum"> 756 </span> : : // specifies the number of top frames to be skipped, which doesn't</a>
<a name="757"><span class="lineNum"> 757 </span> : : // count against the number of frames to be included.</a>
<a name="758"><span class="lineNum"> 758 </span> : : //</a>
<a name="759"><span class="lineNum"> 759 </span> : : // For example, if Foo() calls Bar(), which in turn calls</a>
<a name="760"><span class="lineNum"> 760 </span> : : // GetCurrentOsStackTraceExceptTop(..., 1), Foo() will be included in</a>
<a name="761"><span class="lineNum"> 761 </span> : : // the trace but Bar() and GetCurrentOsStackTraceExceptTop() won't.</a>
<a name="762"><span class="lineNum"> 762 </span> : : GTEST_API_ std::string GetCurrentOsStackTraceExceptTop(</a>
<a name="763"><span class="lineNum"> 763 </span> : : UnitTest* unit_test, int skip_count);</a>
<a name="764"><span class="lineNum"> 764 </span> : : </a>
<a name="765"><span class="lineNum"> 765 </span> : : // Helpers for suppressing warnings on unreachable code or constant</a>
<a name="766"><span class="lineNum"> 766 </span> : : // condition.</a>
<a name="767"><span class="lineNum"> 767 </span> : : </a>
<a name="768"><span class="lineNum"> 768 </span> : : // Always returns true.</a>
<a name="769"><span class="lineNum"> 769 </span> : : GTEST_API_ bool AlwaysTrue();</a>
<a name="770"><span class="lineNum"> 770 </span> : : </a>
<a name="771"><span class="lineNum"> 771 </span> : : // Always returns false.</a>
<a name="772"><span class="lineNum"> 772 </span> : : inline bool AlwaysFalse() { return !AlwaysTrue(); }</a>
<a name="773"><span class="lineNum"> 773 </span> : : </a>
<a name="774"><span class="lineNum"> 774 </span> : : // Helper for suppressing false warning from Clang on a const char*</a>
<a name="775"><span class="lineNum"> 775 </span> : : // variable declared in a conditional expression always being NULL in</a>
<a name="776"><span class="lineNum"> 776 </span> : : // the else branch.</a>
<a name="777"><span class="lineNum"> 777 </span> : : struct GTEST_API_ ConstCharPtr {</a>
<a name="778"><span class="lineNum"> 778 </span> : : ConstCharPtr(const char* str) : value(str) {}</a>
<a name="779"><span class="lineNum"> 779 </span> : : operator bool() const { return true; }</a>
<a name="780"><span class="lineNum"> 780 </span> : : const char* value;</a>
<a name="781"><span class="lineNum"> 781 </span> : : };</a>
<a name="782"><span class="lineNum"> 782 </span> : : </a>
<a name="783"><span class="lineNum"> 783 </span> : : // A simple Linear Congruential Generator for generating random</a>
<a name="784"><span class="lineNum"> 784 </span> : : // numbers with a uniform distribution. Unlike rand() and srand(), it</a>
<a name="785"><span class="lineNum"> 785 </span> : : // doesn't use global state (and therefore can't interfere with user</a>
<a name="786"><span class="lineNum"> 786 </span> : : // code). Unlike rand_r(), it's portable. An LCG isn't very random,</a>
<a name="787"><span class="lineNum"> 787 </span> : : // but it's good enough for our purposes.</a>
<a name="788"><span class="lineNum"> 788 </span> : : class GTEST_API_ Random {</a>
<a name="789"><span class="lineNum"> 789 </span> : : public:</a>
<a name="790"><span class="lineNum"> 790 </span> : : static const UInt32 kMaxRange = 1u &lt;&lt; 31;</a>
<a name="791"><span class="lineNum"> 791 </span> : : </a>
<a name="792"><span class="lineNum"> 792 </span> : : explicit Random(UInt32 seed) : state_(seed) {}</a>
<a name="793"><span class="lineNum"> 793 </span> : : </a>
<a name="794"><span class="lineNum"> 794 </span> : : void Reseed(UInt32 seed) { state_ = seed; }</a>
<a name="795"><span class="lineNum"> 795 </span> : : </a>
<a name="796"><span class="lineNum"> 796 </span> : : // Generates a random number from [0, range). Crashes if 'range' is</a>
<a name="797"><span class="lineNum"> 797 </span> : : // 0 or greater than kMaxRange.</a>
<a name="798"><span class="lineNum"> 798 </span> : : UInt32 Generate(UInt32 range);</a>
<a name="799"><span class="lineNum"> 799 </span> : : </a>
<a name="800"><span class="lineNum"> 800 </span> : : private:</a>
<a name="801"><span class="lineNum"> 801 </span> : : UInt32 state_;</a>
<a name="802"><span class="lineNum"> 802 </span> : : GTEST_DISALLOW_COPY_AND_ASSIGN_(Random);</a>
<a name="803"><span class="lineNum"> 803 </span> : : };</a>
<a name="804"><span class="lineNum"> 804 </span> : : </a>
<a name="805"><span class="lineNum"> 805 </span> : : // Defining a variable of type CompileAssertTypesEqual&lt;T1, T2&gt; will cause a</a>
<a name="806"><span class="lineNum"> 806 </span> : : // compiler error iff T1 and T2 are different types.</a>
<a name="807"><span class="lineNum"> 807 </span> : : template &lt;typename T1, typename T2&gt;</a>
<a name="808"><span class="lineNum"> 808 </span> : : struct CompileAssertTypesEqual;</a>
<a name="809"><span class="lineNum"> 809 </span> : : </a>
<a name="810"><span class="lineNum"> 810 </span> : : template &lt;typename T&gt;</a>
<a name="811"><span class="lineNum"> 811 </span> : : struct CompileAssertTypesEqual&lt;T, T&gt; {</a>
<a name="812"><span class="lineNum"> 812 </span> : : };</a>
<a name="813"><span class="lineNum"> 813 </span> : : </a>
<a name="814"><span class="lineNum"> 814 </span> : : // Removes the reference from a type if it is a reference type,</a>
<a name="815"><span class="lineNum"> 815 </span> : : // otherwise leaves it unchanged. This is the same as</a>
<a name="816"><span class="lineNum"> 816 </span> : : // tr1::remove_reference, which is not widely available yet.</a>
<a name="817"><span class="lineNum"> 817 </span> : : template &lt;typename T&gt;</a>
<a name="818"><span class="lineNum"> 818 </span> : : struct RemoveReference { typedef T type; }; // NOLINT</a>
<a name="819"><span class="lineNum"> 819 </span> : : template &lt;typename T&gt;</a>
<a name="820"><span class="lineNum"> 820 </span> : : struct RemoveReference&lt;T&amp;&gt; { typedef T type; }; // NOLINT</a>
<a name="821"><span class="lineNum"> 821 </span> : : </a>
<a name="822"><span class="lineNum"> 822 </span> : : // A handy wrapper around RemoveReference that works when the argument</a>
<a name="823"><span class="lineNum"> 823 </span> : : // T depends on template parameters.</a>
<a name="824"><span class="lineNum"> 824 </span> : : #define GTEST_REMOVE_REFERENCE_(T) \</a>
<a name="825"><span class="lineNum"> 825 </span> : : typename ::testing::internal::RemoveReference&lt;T&gt;::type</a>
<a name="826"><span class="lineNum"> 826 </span> : : </a>
<a name="827"><span class="lineNum"> 827 </span> : : // Removes const from a type if it is a const type, otherwise leaves</a>
<a name="828"><span class="lineNum"> 828 </span> : : // it unchanged. This is the same as tr1::remove_const, which is not</a>
<a name="829"><span class="lineNum"> 829 </span> : : // widely available yet.</a>
<a name="830"><span class="lineNum"> 830 </span> : : template &lt;typename T&gt;</a>
<a name="831"><span class="lineNum"> 831 </span> : : struct RemoveConst { typedef T type; }; // NOLINT</a>
<a name="832"><span class="lineNum"> 832 </span> : : template &lt;typename T&gt;</a>
<a name="833"><span class="lineNum"> 833 </span> : : struct RemoveConst&lt;const T&gt; { typedef T type; }; // NOLINT</a>
<a name="834"><span class="lineNum"> 834 </span> : : </a>
<a name="835"><span class="lineNum"> 835 </span> : : // MSVC 8.0, Sun C++, and IBM XL C++ have a bug which causes the above</a>
<a name="836"><span class="lineNum"> 836 </span> : : // definition to fail to remove the const in 'const int[3]' and 'const</a>
<a name="837"><span class="lineNum"> 837 </span> : : // char[3][4]'. The following specialization works around the bug.</a>
<a name="838"><span class="lineNum"> 838 </span> : : template &lt;typename T, size_t N&gt;</a>
<a name="839"><span class="lineNum"> 839 </span> : : struct RemoveConst&lt;const T[N]&gt; {</a>
<a name="840"><span class="lineNum"> 840 </span> : : typedef typename RemoveConst&lt;T&gt;::type type[N];</a>
<a name="841"><span class="lineNum"> 841 </span> : : };</a>
<a name="842"><span class="lineNum"> 842 </span> : : </a>
<a name="843"><span class="lineNum"> 843 </span> : : #if defined(_MSC_VER) &amp;&amp; _MSC_VER &lt; 1400</a>
<a name="844"><span class="lineNum"> 844 </span> : : // This is the only specialization that allows VC++ 7.1 to remove const in</a>
<a name="845"><span class="lineNum"> 845 </span> : : // 'const int[3] and 'const int[3][4]'. However, it causes trouble with GCC</a>
<a name="846"><span class="lineNum"> 846 </span> : : // and thus needs to be conditionally compiled.</a>
<a name="847"><span class="lineNum"> 847 </span> : : template &lt;typename T, size_t N&gt;</a>
<a name="848"><span class="lineNum"> 848 </span> : : struct RemoveConst&lt;T[N]&gt; {</a>
<a name="849"><span class="lineNum"> 849 </span> : : typedef typename RemoveConst&lt;T&gt;::type type[N];</a>
<a name="850"><span class="lineNum"> 850 </span> : : };</a>
<a name="851"><span class="lineNum"> 851 </span> : : #endif</a>
<a name="852"><span class="lineNum"> 852 </span> : : </a>
<a name="853"><span class="lineNum"> 853 </span> : : // A handy wrapper around RemoveConst that works when the argument</a>
<a name="854"><span class="lineNum"> 854 </span> : : // T depends on template parameters.</a>
<a name="855"><span class="lineNum"> 855 </span> : : #define GTEST_REMOVE_CONST_(T) \</a>
<a name="856"><span class="lineNum"> 856 </span> : : typename ::testing::internal::RemoveConst&lt;T&gt;::type</a>
<a name="857"><span class="lineNum"> 857 </span> : : </a>
<a name="858"><span class="lineNum"> 858 </span> : : // Turns const U&amp;, U&amp;, const U, and U all into U.</a>
<a name="859"><span class="lineNum"> 859 </span> : : #define GTEST_REMOVE_REFERENCE_AND_CONST_(T) \</a>
<a name="860"><span class="lineNum"> 860 </span> : : GTEST_REMOVE_CONST_(GTEST_REMOVE_REFERENCE_(T))</a>
<a name="861"><span class="lineNum"> 861 </span> : : </a>
<a name="862"><span class="lineNum"> 862 </span> : : // ImplicitlyConvertible&lt;From, To&gt;::value is a compile-time bool</a>
<a name="863"><span class="lineNum"> 863 </span> : : // constant that's true iff type From can be implicitly converted to</a>
<a name="864"><span class="lineNum"> 864 </span> : : // type To.</a>
<a name="865"><span class="lineNum"> 865 </span> : : template &lt;typename From, typename To&gt;</a>
<a name="866"><span class="lineNum"> 866 </span> : : class ImplicitlyConvertible {</a>
<a name="867"><span class="lineNum"> 867 </span> : : private:</a>
<a name="868"><span class="lineNum"> 868 </span> : : // We need the following helper functions only for their types.</a>
<a name="869"><span class="lineNum"> 869 </span> : : // They have no implementations.</a>
<a name="870"><span class="lineNum"> 870 </span> : : </a>
<a name="871"><span class="lineNum"> 871 </span> : : // MakeFrom() is an expression whose type is From. We cannot simply</a>
<a name="872"><span class="lineNum"> 872 </span> : : // use From(), as the type From may not have a public default</a>
<a name="873"><span class="lineNum"> 873 </span> : : // constructor.</a>
<a name="874"><span class="lineNum"> 874 </span> : : static typename AddReference&lt;From&gt;::type MakeFrom();</a>
<a name="875"><span class="lineNum"> 875 </span> : : </a>
<a name="876"><span class="lineNum"> 876 </span> : : // These two functions are overloaded. Given an expression</a>
<a name="877"><span class="lineNum"> 877 </span> : : // Helper(x), the compiler will pick the first version if x can be</a>
<a name="878"><span class="lineNum"> 878 </span> : : // implicitly converted to type To; otherwise it will pick the</a>
<a name="879"><span class="lineNum"> 879 </span> : : // second version.</a>
<a name="880"><span class="lineNum"> 880 </span> : : //</a>
<a name="881"><span class="lineNum"> 881 </span> : : // The first version returns a value of size 1, and the second</a>
<a name="882"><span class="lineNum"> 882 </span> : : // version returns a value of size 2. Therefore, by checking the</a>
<a name="883"><span class="lineNum"> 883 </span> : : // size of Helper(x), which can be done at compile time, we can tell</a>
<a name="884"><span class="lineNum"> 884 </span> : : // which version of Helper() is used, and hence whether x can be</a>
<a name="885"><span class="lineNum"> 885 </span> : : // implicitly converted to type To.</a>
<a name="886"><span class="lineNum"> 886 </span> : : static char Helper(To);</a>
<a name="887"><span class="lineNum"> 887 </span> : : static char (&amp;Helper(...))[2]; // NOLINT</a>
<a name="888"><span class="lineNum"> 888 </span> : : </a>
<a name="889"><span class="lineNum"> 889 </span> : : // We have to put the 'public' section after the 'private' section,</a>
<a name="890"><span class="lineNum"> 890 </span> : : // or MSVC refuses to compile the code.</a>
<a name="891"><span class="lineNum"> 891 </span> : : public:</a>
<a name="892"><span class="lineNum"> 892 </span> : : #if defined(__BORLANDC__)</a>
<a name="893"><span class="lineNum"> 893 </span> : : // C++Builder cannot use member overload resolution during template</a>
<a name="894"><span class="lineNum"> 894 </span> : : // instantiation. The simplest workaround is to use its C++0x type traits</a>
<a name="895"><span class="lineNum"> 895 </span> : : // functions (C++Builder 2009 and above only).</a>
<a name="896"><span class="lineNum"> 896 </span> : : static const bool value = __is_convertible(From, To);</a>
<a name="897"><span class="lineNum"> 897 </span> : : #else</a>
<a name="898"><span class="lineNum"> 898 </span> : : // MSVC warns about implicitly converting from double to int for</a>
<a name="899"><span class="lineNum"> 899 </span> : : // possible loss of data, so we need to temporarily disable the</a>
<a name="900"><span class="lineNum"> 900 </span> : : // warning.</a>
<a name="901"><span class="lineNum"> 901 </span> : : GTEST_DISABLE_MSC_WARNINGS_PUSH_(4244)</a>
<a name="902"><span class="lineNum"> 902 </span> : : static const bool value =</a>
<a name="903"><span class="lineNum"> 903 </span> : : sizeof(Helper(ImplicitlyConvertible::MakeFrom())) == 1;</a>
<a name="904"><span class="lineNum"> 904 </span> : : GTEST_DISABLE_MSC_WARNINGS_POP_()</a>
<a name="905"><span class="lineNum"> 905 </span> : : #endif // __BORLANDC__</a>
<a name="906"><span class="lineNum"> 906 </span> : : };</a>
<a name="907"><span class="lineNum"> 907 </span> : : template &lt;typename From, typename To&gt;</a>
<a name="908"><span class="lineNum"> 908 </span> : : const bool ImplicitlyConvertible&lt;From, To&gt;::value;</a>
<a name="909"><span class="lineNum"> 909 </span> : : </a>
<a name="910"><span class="lineNum"> 910 </span> : : // IsAProtocolMessage&lt;T&gt;::value is a compile-time bool constant that's</a>
<a name="911"><span class="lineNum"> 911 </span> : : // true iff T is type ProtocolMessage, proto2::Message, or a subclass</a>
<a name="912"><span class="lineNum"> 912 </span> : : // of those.</a>
<a name="913"><span class="lineNum"> 913 </span> : : template &lt;typename T&gt;</a>
<a name="914"><span class="lineNum"> 914 </span> : : struct IsAProtocolMessage</a>
<a name="915"><span class="lineNum"> 915 </span> : : : public bool_constant&lt;</a>
<a name="916"><span class="lineNum"> 916 </span> : : ImplicitlyConvertible&lt;const T*, const ::ProtocolMessage*&gt;::value ||</a>
<a name="917"><span class="lineNum"> 917 </span> : : ImplicitlyConvertible&lt;const T*, const ::proto2::Message*&gt;::value&gt; {</a>
<a name="918"><span class="lineNum"> 918 </span> : : };</a>
<a name="919"><span class="lineNum"> 919 </span> : : </a>
<a name="920"><span class="lineNum"> 920 </span> : : // When the compiler sees expression IsContainerTest&lt;C&gt;(0), if C is an</a>
<a name="921"><span class="lineNum"> 921 </span> : : // STL-style container class, the first overload of IsContainerTest</a>
<a name="922"><span class="lineNum"> 922 </span> : : // will be viable (since both C::iterator* and C::const_iterator* are</a>
<a name="923"><span class="lineNum"> 923 </span> : : // valid types and NULL can be implicitly converted to them). It will</a>
<a name="924"><span class="lineNum"> 924 </span> : : // be picked over the second overload as 'int' is a perfect match for</a>
<a name="925"><span class="lineNum"> 925 </span> : : // the type of argument 0. If C::iterator or C::const_iterator is not</a>
<a name="926"><span class="lineNum"> 926 </span> : : // a valid type, the first overload is not viable, and the second</a>
<a name="927"><span class="lineNum"> 927 </span> : : // overload will be picked. Therefore, we can determine whether C is</a>
<a name="928"><span class="lineNum"> 928 </span> : : // a container class by checking the type of IsContainerTest&lt;C&gt;(0).</a>
<a name="929"><span class="lineNum"> 929 </span> : : // The value of the expression is insignificant.</a>
<a name="930"><span class="lineNum"> 930 </span> : : //</a>
<a name="931"><span class="lineNum"> 931 </span> : : // In C++11 mode we check the existence of a const_iterator and that an</a>
<a name="932"><span class="lineNum"> 932 </span> : : // iterator is properly implemented for the container.</a>
<a name="933"><span class="lineNum"> 933 </span> : : //</a>
<a name="934"><span class="lineNum"> 934 </span> : : // For pre-C++11 that we look for both C::iterator and C::const_iterator.</a>
<a name="935"><span class="lineNum"> 935 </span> : : // The reason is that C++ injects the name of a class as a member of the</a>
<a name="936"><span class="lineNum"> 936 </span> : : // class itself (e.g. you can refer to class iterator as either</a>
<a name="937"><span class="lineNum"> 937 </span> : : // 'iterator' or 'iterator::iterator'). If we look for C::iterator</a>
<a name="938"><span class="lineNum"> 938 </span> : : // only, for example, we would mistakenly think that a class named</a>
<a name="939"><span class="lineNum"> 939 </span> : : // iterator is an STL container.</a>
<a name="940"><span class="lineNum"> 940 </span> : : //</a>
<a name="941"><span class="lineNum"> 941 </span> : : // Also note that the simpler approach of overloading</a>
<a name="942"><span class="lineNum"> 942 </span> : : // IsContainerTest(typename C::const_iterator*) and</a>
<a name="943"><span class="lineNum"> 943 </span> : : // IsContainerTest(...) doesn't work with Visual Age C++ and Sun C++.</a>
<a name="944"><span class="lineNum"> 944 </span> : : typedef int IsContainer;</a>
<a name="945"><span class="lineNum"> 945 </span> : : #if GTEST_LANG_CXX11</a>
<a name="946"><span class="lineNum"> 946 </span> : : template &lt;class C,</a>
<a name="947"><span class="lineNum"> 947 </span> : : class Iterator = decltype(::std::declval&lt;const C&amp;&gt;().begin()),</a>
<a name="948"><span class="lineNum"> 948 </span> : : class = decltype(::std::declval&lt;const C&amp;&gt;().end()),</a>
<a name="949"><span class="lineNum"> 949 </span> : : class = decltype(++::std::declval&lt;Iterator&amp;&gt;()),</a>
<a name="950"><span class="lineNum"> 950 </span> : : class = decltype(*::std::declval&lt;Iterator&gt;()),</a>
<a name="951"><span class="lineNum"> 951 </span> : : class = typename C::const_iterator&gt;</a>
<a name="952"><span class="lineNum"> 952 </span> : : IsContainer IsContainerTest(int /* dummy */) {</a>
<a name="953"><span class="lineNum"> 953 </span> : : return 0;</a>
<a name="954"><span class="lineNum"> 954 </span> : : }</a>
<a name="955"><span class="lineNum"> 955 </span> : : #else</a>
<a name="956"><span class="lineNum"> 956 </span> : : template &lt;class C&gt;</a>
<a name="957"><span class="lineNum"> 957 </span> : : IsContainer IsContainerTest(int /* dummy */,</a>
<a name="958"><span class="lineNum"> 958 </span> : : typename C::iterator* /* it */ = NULL,</a>
<a name="959"><span class="lineNum"> 959 </span> : : typename C::const_iterator* /* const_it */ = NULL) {</a>
<a name="960"><span class="lineNum"> 960 </span> : : return 0;</a>
<a name="961"><span class="lineNum"> 961 </span> : : }</a>
<a name="962"><span class="lineNum"> 962 </span> : : #endif // GTEST_LANG_CXX11</a>
<a name="963"><span class="lineNum"> 963 </span> : : </a>
<a name="964"><span class="lineNum"> 964 </span> : : typedef char IsNotContainer;</a>
<a name="965"><span class="lineNum"> 965 </span> : : template &lt;class C&gt;</a>
<a name="966"><span class="lineNum"> 966 </span> : : IsNotContainer IsContainerTest(long /* dummy */) { return '\0'; }</a>
<a name="967"><span class="lineNum"> 967 </span> : : </a>
<a name="968"><span class="lineNum"> 968 </span> : : // Trait to detect whether a type T is a hash table.</a>
<a name="969"><span class="lineNum"> 969 </span> : : // The heuristic used is that the type contains an inner type `hasher` and does</a>
<a name="970"><span class="lineNum"> 970 </span> : : // not contain an inner type `reverse_iterator`.</a>
<a name="971"><span class="lineNum"> 971 </span> : : // If the container is iterable in reverse, then order might actually matter.</a>
<a name="972"><span class="lineNum"> 972 </span> : : template &lt;typename T&gt;</a>
<a name="973"><span class="lineNum"> 973 </span> : : struct IsHashTable {</a>
<a name="974"><span class="lineNum"> 974 </span> : : private:</a>
<a name="975"><span class="lineNum"> 975 </span> : : template &lt;typename U&gt;</a>
<a name="976"><span class="lineNum"> 976 </span> : : static char test(typename U::hasher*, typename U::reverse_iterator*);</a>
<a name="977"><span class="lineNum"> 977 </span> : : template &lt;typename U&gt;</a>
<a name="978"><span class="lineNum"> 978 </span> : : static int test(typename U::hasher*, ...);</a>
<a name="979"><span class="lineNum"> 979 </span> : : template &lt;typename U&gt;</a>
<a name="980"><span class="lineNum"> 980 </span> : : static char test(...);</a>
<a name="981"><span class="lineNum"> 981 </span> : : </a>
<a name="982"><span class="lineNum"> 982 </span> : : public:</a>
<a name="983"><span class="lineNum"> 983 </span> : : static const bool value = sizeof(test&lt;T&gt;(0, 0)) == sizeof(int);</a>
<a name="984"><span class="lineNum"> 984 </span> : : };</a>
<a name="985"><span class="lineNum"> 985 </span> : : </a>
<a name="986"><span class="lineNum"> 986 </span> : : template &lt;typename T&gt;</a>
<a name="987"><span class="lineNum"> 987 </span> : : const bool IsHashTable&lt;T&gt;::value;</a>
<a name="988"><span class="lineNum"> 988 </span> : : </a>
<a name="989"><span class="lineNum"> 989 </span> : : template&lt;typename T&gt;</a>
<a name="990"><span class="lineNum"> 990 </span> : : struct VoidT {</a>
<a name="991"><span class="lineNum"> 991 </span> : : typedef void value_type;</a>
<a name="992"><span class="lineNum"> 992 </span> : : };</a>
<a name="993"><span class="lineNum"> 993 </span> : : </a>
<a name="994"><span class="lineNum"> 994 </span> : : template &lt;typename T, typename = void&gt;</a>
<a name="995"><span class="lineNum"> 995 </span> : : struct HasValueType : false_type {};</a>
<a name="996"><span class="lineNum"> 996 </span> : : template &lt;typename T&gt;</a>
<a name="997"><span class="lineNum"> 997 </span> : : struct HasValueType&lt;T, VoidT&lt;typename T::value_type&gt; &gt; : true_type {</a>
<a name="998"><span class="lineNum"> 998 </span> : : };</a>
<a name="999"><span class="lineNum"> 999 </span> : : </a>
<a name="1000"><span class="lineNum"> 1000 </span> : : template &lt;typename C,</a>
<a name="1001"><span class="lineNum"> 1001 </span> : : bool = sizeof(IsContainerTest&lt;C&gt;(0)) == sizeof(IsContainer),</a>
<a name="1002"><span class="lineNum"> 1002 </span> : : bool = HasValueType&lt;C&gt;::value&gt;</a>
<a name="1003"><span class="lineNum"> 1003 </span> : : struct IsRecursiveContainerImpl;</a>
<a name="1004"><span class="lineNum"> 1004 </span> : : </a>
<a name="1005"><span class="lineNum"> 1005 </span> : : template &lt;typename C, bool HV&gt;</a>
<a name="1006"><span class="lineNum"> 1006 </span> : : struct IsRecursiveContainerImpl&lt;C, false, HV&gt; : public false_type {};</a>
<a name="1007"><span class="lineNum"> 1007 </span> : : </a>
<a name="1008"><span class="lineNum"> 1008 </span> : : // Since the IsRecursiveContainerImpl depends on the IsContainerTest we need to</a>
<a name="1009"><span class="lineNum"> 1009 </span> : : // obey the same inconsistencies as the IsContainerTest, namely check if</a>
<a name="1010"><span class="lineNum"> 1010 </span> : : // something is a container is relying on only const_iterator in C++11 and</a>
<a name="1011"><span class="lineNum"> 1011 </span> : : // is relying on both const_iterator and iterator otherwise</a>
<a name="1012"><span class="lineNum"> 1012 </span> : : template &lt;typename C&gt;</a>
<a name="1013"><span class="lineNum"> 1013 </span> : : struct IsRecursiveContainerImpl&lt;C, true, false&gt; : public false_type {};</a>
<a name="1014"><span class="lineNum"> 1014 </span> : : </a>
<a name="1015"><span class="lineNum"> 1015 </span> : : template &lt;typename C&gt;</a>
<a name="1016"><span class="lineNum"> 1016 </span> : : struct IsRecursiveContainerImpl&lt;C, true, true&gt; {</a>
<a name="1017"><span class="lineNum"> 1017 </span> : : #if GTEST_LANG_CXX11</a>
<a name="1018"><span class="lineNum"> 1018 </span> : : typedef typename IteratorTraits&lt;typename C::const_iterator&gt;::value_type</a>
<a name="1019"><span class="lineNum"> 1019 </span> : : value_type;</a>
<a name="1020"><span class="lineNum"> 1020 </span> : : #else</a>
<a name="1021"><span class="lineNum"> 1021 </span> : : typedef typename IteratorTraits&lt;typename C::iterator&gt;::value_type value_type;</a>
<a name="1022"><span class="lineNum"> 1022 </span> : : #endif</a>
<a name="1023"><span class="lineNum"> 1023 </span> : : typedef is_same&lt;value_type, C&gt; type;</a>
<a name="1024"><span class="lineNum"> 1024 </span> : : };</a>
<a name="1025"><span class="lineNum"> 1025 </span> : : </a>
<a name="1026"><span class="lineNum"> 1026 </span> : : // IsRecursiveContainer&lt;Type&gt; is a unary compile-time predicate that</a>
<a name="1027"><span class="lineNum"> 1027 </span> : : // evaluates whether C is a recursive container type. A recursive container</a>
<a name="1028"><span class="lineNum"> 1028 </span> : : // type is a container type whose value_type is equal to the container type</a>
<a name="1029"><span class="lineNum"> 1029 </span> : : // itself. An example for a recursive container type is</a>
<a name="1030"><span class="lineNum"> 1030 </span> : : // boost::filesystem::path, whose iterator has a value_type that is equal to</a>
<a name="1031"><span class="lineNum"> 1031 </span> : : // boost::filesystem::path.</a>
<a name="1032"><span class="lineNum"> 1032 </span> : : template &lt;typename C&gt;</a>
<a name="1033"><span class="lineNum"> 1033 </span> : : struct IsRecursiveContainer : public IsRecursiveContainerImpl&lt;C&gt;::type {};</a>
<a name="1034"><span class="lineNum"> 1034 </span> : : </a>
<a name="1035"><span class="lineNum"> 1035 </span> : : // EnableIf&lt;condition&gt;::type is void when 'Cond' is true, and</a>
<a name="1036"><span class="lineNum"> 1036 </span> : : // undefined when 'Cond' is false. To use SFINAE to make a function</a>
<a name="1037"><span class="lineNum"> 1037 </span> : : // overload only apply when a particular expression is true, add</a>
<a name="1038"><span class="lineNum"> 1038 </span> : : // &quot;typename EnableIf&lt;expression&gt;::type* = 0&quot; as the last parameter.</a>
<a name="1039"><span class="lineNum"> 1039 </span> : : template&lt;bool&gt; struct EnableIf;</a>
<a name="1040"><span class="lineNum"> 1040 </span> : : template&lt;&gt; struct EnableIf&lt;true&gt; { typedef void type; }; // NOLINT</a>
<a name="1041"><span class="lineNum"> 1041 </span> : : </a>
<a name="1042"><span class="lineNum"> 1042 </span> : : // Utilities for native arrays.</a>
<a name="1043"><span class="lineNum"> 1043 </span> : : </a>
<a name="1044"><span class="lineNum"> 1044 </span> : : // ArrayEq() compares two k-dimensional native arrays using the</a>
<a name="1045"><span class="lineNum"> 1045 </span> : : // elements' operator==, where k can be any integer &gt;= 0. When k is</a>
<a name="1046"><span class="lineNum"> 1046 </span> : : // 0, ArrayEq() degenerates into comparing a single pair of values.</a>
<a name="1047"><span class="lineNum"> 1047 </span> : : </a>
<a name="1048"><span class="lineNum"> 1048 </span> : : template &lt;typename T, typename U&gt;</a>
<a name="1049"><span class="lineNum"> 1049 </span> : : bool ArrayEq(const T* lhs, size_t size, const U* rhs);</a>
<a name="1050"><span class="lineNum"> 1050 </span> : : </a>
<a name="1051"><span class="lineNum"> 1051 </span> : : // This generic version is used when k is 0.</a>
<a name="1052"><span class="lineNum"> 1052 </span> : : template &lt;typename T, typename U&gt;</a>
<a name="1053"><span class="lineNum"> 1053 </span> : : inline bool ArrayEq(const T&amp; lhs, const U&amp; rhs) { return lhs == rhs; }</a>
<a name="1054"><span class="lineNum"> 1054 </span> : : </a>
<a name="1055"><span class="lineNum"> 1055 </span> : : // This overload is used when k &gt;= 1.</a>
<a name="1056"><span class="lineNum"> 1056 </span> : : template &lt;typename T, typename U, size_t N&gt;</a>
<a name="1057"><span class="lineNum"> 1057 </span> : : inline bool ArrayEq(const T(&amp;lhs)[N], const U(&amp;rhs)[N]) {</a>
<a name="1058"><span class="lineNum"> 1058 </span> : : return internal::ArrayEq(lhs, N, rhs);</a>
<a name="1059"><span class="lineNum"> 1059 </span> : : }</a>
<a name="1060"><span class="lineNum"> 1060 </span> : : </a>
<a name="1061"><span class="lineNum"> 1061 </span> : : // This helper reduces code bloat. If we instead put its logic inside</a>
<a name="1062"><span class="lineNum"> 1062 </span> : : // the previous ArrayEq() function, arrays with different sizes would</a>
<a name="1063"><span class="lineNum"> 1063 </span> : : // lead to different copies of the template code.</a>
<a name="1064"><span class="lineNum"> 1064 </span> : : template &lt;typename T, typename U&gt;</a>
<a name="1065"><span class="lineNum"> 1065 </span> : : bool ArrayEq(const T* lhs, size_t size, const U* rhs) {</a>
<a name="1066"><span class="lineNum"> 1066 </span> : : for (size_t i = 0; i != size; i++) {</a>
<a name="1067"><span class="lineNum"> 1067 </span> : : if (!internal::ArrayEq(lhs[i], rhs[i]))</a>
<a name="1068"><span class="lineNum"> 1068 </span> : : return false;</a>
<a name="1069"><span class="lineNum"> 1069 </span> : : }</a>
<a name="1070"><span class="lineNum"> 1070 </span> : : return true;</a>
<a name="1071"><span class="lineNum"> 1071 </span> : : }</a>
<a name="1072"><span class="lineNum"> 1072 </span> : : </a>
<a name="1073"><span class="lineNum"> 1073 </span> : : // Finds the first element in the iterator range [begin, end) that</a>
<a name="1074"><span class="lineNum"> 1074 </span> : : // equals elem. Element may be a native array type itself.</a>
<a name="1075"><span class="lineNum"> 1075 </span> : : template &lt;typename Iter, typename Element&gt;</a>
<a name="1076"><span class="lineNum"> 1076 </span> : : Iter ArrayAwareFind(Iter begin, Iter end, const Element&amp; elem) {</a>
<a name="1077"><span class="lineNum"> 1077 </span> : : for (Iter it = begin; it != end; ++it) {</a>
<a name="1078"><span class="lineNum"> 1078 </span> : : if (internal::ArrayEq(*it, elem))</a>
<a name="1079"><span class="lineNum"> 1079 </span> : : return it;</a>
<a name="1080"><span class="lineNum"> 1080 </span> : : }</a>
<a name="1081"><span class="lineNum"> 1081 </span> : : return end;</a>
<a name="1082"><span class="lineNum"> 1082 </span> : : }</a>
<a name="1083"><span class="lineNum"> 1083 </span> : : </a>
<a name="1084"><span class="lineNum"> 1084 </span> : : // CopyArray() copies a k-dimensional native array using the elements'</a>
<a name="1085"><span class="lineNum"> 1085 </span> : : // operator=, where k can be any integer &gt;= 0. When k is 0,</a>
<a name="1086"><span class="lineNum"> 1086 </span> : : // CopyArray() degenerates into copying a single value.</a>
<a name="1087"><span class="lineNum"> 1087 </span> : : </a>
<a name="1088"><span class="lineNum"> 1088 </span> : : template &lt;typename T, typename U&gt;</a>
<a name="1089"><span class="lineNum"> 1089 </span> : : void CopyArray(const T* from, size_t size, U* to);</a>
<a name="1090"><span class="lineNum"> 1090 </span> : : </a>
<a name="1091"><span class="lineNum"> 1091 </span> : : // This generic version is used when k is 0.</a>
<a name="1092"><span class="lineNum"> 1092 </span> : : template &lt;typename T, typename U&gt;</a>
<a name="1093"><span class="lineNum"> 1093 </span> : : inline void CopyArray(const T&amp; from, U* to) { *to = from; }</a>
<a name="1094"><span class="lineNum"> 1094 </span> : : </a>
<a name="1095"><span class="lineNum"> 1095 </span> : : // This overload is used when k &gt;= 1.</a>
<a name="1096"><span class="lineNum"> 1096 </span> : : template &lt;typename T, typename U, size_t N&gt;</a>
<a name="1097"><span class="lineNum"> 1097 </span> : : inline void CopyArray(const T(&amp;from)[N], U(*to)[N]) {</a>
<a name="1098"><span class="lineNum"> 1098 </span> : : internal::CopyArray(from, N, *to);</a>
<a name="1099"><span class="lineNum"> 1099 </span> : : }</a>
<a name="1100"><span class="lineNum"> 1100 </span> : : </a>
<a name="1101"><span class="lineNum"> 1101 </span> : : // This helper reduces code bloat. If we instead put its logic inside</a>
<a name="1102"><span class="lineNum"> 1102 </span> : : // the previous CopyArray() function, arrays with different sizes</a>
<a name="1103"><span class="lineNum"> 1103 </span> : : // would lead to different copies of the template code.</a>
<a name="1104"><span class="lineNum"> 1104 </span> : : template &lt;typename T, typename U&gt;</a>
<a name="1105"><span class="lineNum"> 1105 </span> : : void CopyArray(const T* from, size_t size, U* to) {</a>
<a name="1106"><span class="lineNum"> 1106 </span> : : for (size_t i = 0; i != size; i++) {</a>
<a name="1107"><span class="lineNum"> 1107 </span> : : internal::CopyArray(from[i], to + i);</a>
<a name="1108"><span class="lineNum"> 1108 </span> : : }</a>
<a name="1109"><span class="lineNum"> 1109 </span> : : }</a>
<a name="1110"><span class="lineNum"> 1110 </span> : : </a>
<a name="1111"><span class="lineNum"> 1111 </span> : : // The relation between an NativeArray object (see below) and the</a>
<a name="1112"><span class="lineNum"> 1112 </span> : : // native array it represents.</a>
<a name="1113"><span class="lineNum"> 1113 </span> : : // We use 2 different structs to allow non-copyable types to be used, as long</a>
<a name="1114"><span class="lineNum"> 1114 </span> : : // as RelationToSourceReference() is passed.</a>
<a name="1115"><span class="lineNum"> 1115 </span> : : struct RelationToSourceReference {};</a>
<a name="1116"><span class="lineNum"> 1116 </span> : : struct RelationToSourceCopy {};</a>
<a name="1117"><span class="lineNum"> 1117 </span> : : </a>
<a name="1118"><span class="lineNum"> 1118 </span> : : // Adapts a native array to a read-only STL-style container. Instead</a>
<a name="1119"><span class="lineNum"> 1119 </span> : : // of the complete STL container concept, this adaptor only implements</a>
<a name="1120"><span class="lineNum"> 1120 </span> : : // members useful for Google Mock's container matchers. New members</a>
<a name="1121"><span class="lineNum"> 1121 </span> : : // should be added as needed. To simplify the implementation, we only</a>
<a name="1122"><span class="lineNum"> 1122 </span> : : // support Element being a raw type (i.e. having no top-level const or</a>
<a name="1123"><span class="lineNum"> 1123 </span> : : // reference modifier). It's the client's responsibility to satisfy</a>
<a name="1124"><span class="lineNum"> 1124 </span> : : // this requirement. Element can be an array type itself (hence</a>
<a name="1125"><span class="lineNum"> 1125 </span> : : // multi-dimensional arrays are supported).</a>
<a name="1126"><span class="lineNum"> 1126 </span> : : template &lt;typename Element&gt;</a>
<a name="1127"><span class="lineNum"> 1127 </span> : : class NativeArray {</a>
<a name="1128"><span class="lineNum"> 1128 </span> : : public:</a>
<a name="1129"><span class="lineNum"> 1129 </span> : : // STL-style container typedefs.</a>
<a name="1130"><span class="lineNum"> 1130 </span> : : typedef Element value_type;</a>
<a name="1131"><span class="lineNum"> 1131 </span> : : typedef Element* iterator;</a>
<a name="1132"><span class="lineNum"> 1132 </span> : : typedef const Element* const_iterator;</a>
<a name="1133"><span class="lineNum"> 1133 </span> : : </a>
<a name="1134"><span class="lineNum"> 1134 </span> : : // Constructs from a native array. References the source.</a>
<a name="1135"><span class="lineNum"> 1135 </span> : : NativeArray(const Element* array, size_t count, RelationToSourceReference) {</a>
<a name="1136"><span class="lineNum"> 1136 </span> : : InitRef(array, count);</a>
<a name="1137"><span class="lineNum"> 1137 </span> : : }</a>
<a name="1138"><span class="lineNum"> 1138 </span> : : </a>
<a name="1139"><span class="lineNum"> 1139 </span> : : // Constructs from a native array. Copies the source.</a>
<a name="1140"><span class="lineNum"> 1140 </span> : : NativeArray(const Element* array, size_t count, RelationToSourceCopy) {</a>
<a name="1141"><span class="lineNum"> 1141 </span> : : InitCopy(array, count);</a>
<a name="1142"><span class="lineNum"> 1142 </span> : : }</a>
<a name="1143"><span class="lineNum"> 1143 </span> : : </a>
<a name="1144"><span class="lineNum"> 1144 </span> : : // Copy constructor.</a>
<a name="1145"><span class="lineNum"> 1145 </span> : : NativeArray(const NativeArray&amp; rhs) {</a>
<a name="1146"><span class="lineNum"> 1146 </span> : : (this-&gt;*rhs.clone_)(rhs.array_, rhs.size_);</a>
<a name="1147"><span class="lineNum"> 1147 </span> : : }</a>
<a name="1148"><span class="lineNum"> 1148 </span> : : </a>
<a name="1149"><span class="lineNum"> 1149 </span> : : ~NativeArray() {</a>
<a name="1150"><span class="lineNum"> 1150 </span> : : if (clone_ != &amp;NativeArray::InitRef)</a>
<a name="1151"><span class="lineNum"> 1151 </span> : : delete[] array_;</a>
<a name="1152"><span class="lineNum"> 1152 </span> : : }</a>
<a name="1153"><span class="lineNum"> 1153 </span> : : </a>
<a name="1154"><span class="lineNum"> 1154 </span> : : // STL-style container methods.</a>
<a name="1155"><span class="lineNum"> 1155 </span> : : size_t size() const { return size_; }</a>
<a name="1156"><span class="lineNum"> 1156 </span> : : const_iterator begin() const { return array_; }</a>
<a name="1157"><span class="lineNum"> 1157 </span> : : const_iterator end() const { return array_ + size_; }</a>
<a name="1158"><span class="lineNum"> 1158 </span> : : bool operator==(const NativeArray&amp; rhs) const {</a>
<a name="1159"><span class="lineNum"> 1159 </span> : : return size() == rhs.size() &amp;&amp;</a>
<a name="1160"><span class="lineNum"> 1160 </span> : : ArrayEq(begin(), size(), rhs.begin());</a>
<a name="1161"><span class="lineNum"> 1161 </span> : : }</a>
<a name="1162"><span class="lineNum"> 1162 </span> : : </a>
<a name="1163"><span class="lineNum"> 1163 </span> : : private:</a>
<a name="1164"><span class="lineNum"> 1164 </span> : : enum {</a>
<a name="1165"><span class="lineNum"> 1165 </span> : : kCheckTypeIsNotConstOrAReference = StaticAssertTypeEqHelper&lt;</a>
<a name="1166"><span class="lineNum"> 1166 </span> : : Element, GTEST_REMOVE_REFERENCE_AND_CONST_(Element)&gt;::value</a>
<a name="1167"><span class="lineNum"> 1167 </span> : : };</a>
<a name="1168"><span class="lineNum"> 1168 </span> : : </a>
<a name="1169"><span class="lineNum"> 1169 </span> : : // Initializes this object with a copy of the input.</a>
<a name="1170"><span class="lineNum"> 1170 </span> : : void InitCopy(const Element* array, size_t a_size) {</a>
<a name="1171"><span class="lineNum"> 1171 </span> : : Element* const copy = new Element[a_size];</a>
<a name="1172"><span class="lineNum"> 1172 </span> : : CopyArray(array, a_size, copy);</a>
<a name="1173"><span class="lineNum"> 1173 </span> : : array_ = copy;</a>
<a name="1174"><span class="lineNum"> 1174 </span> : : size_ = a_size;</a>
<a name="1175"><span class="lineNum"> 1175 </span> : : clone_ = &amp;NativeArray::InitCopy;</a>
<a name="1176"><span class="lineNum"> 1176 </span> : : }</a>
<a name="1177"><span class="lineNum"> 1177 </span> : : </a>
<a name="1178"><span class="lineNum"> 1178 </span> : : // Initializes this object with a reference of the input.</a>
<a name="1179"><span class="lineNum"> 1179 </span> : : void InitRef(const Element* array, size_t a_size) {</a>
<a name="1180"><span class="lineNum"> 1180 </span> : : array_ = array;</a>
<a name="1181"><span class="lineNum"> 1181 </span> : : size_ = a_size;</a>
<a name="1182"><span class="lineNum"> 1182 </span> : : clone_ = &amp;NativeArray::InitRef;</a>
<a name="1183"><span class="lineNum"> 1183 </span> : : }</a>
<a name="1184"><span class="lineNum"> 1184 </span> : : </a>
<a name="1185"><span class="lineNum"> 1185 </span> : : const Element* array_;</a>
<a name="1186"><span class="lineNum"> 1186 </span> : : size_t size_;</a>
<a name="1187"><span class="lineNum"> 1187 </span> : : void (NativeArray::*clone_)(const Element*, size_t);</a>
<a name="1188"><span class="lineNum"> 1188 </span> : : </a>
<a name="1189"><span class="lineNum"> 1189 </span> : : GTEST_DISALLOW_ASSIGN_(NativeArray);</a>
<a name="1190"><span class="lineNum"> 1190 </span> : : };</a>
<a name="1191"><span class="lineNum"> 1191 </span> : : </a>
<a name="1192"><span class="lineNum"> 1192 </span> : : } // namespace internal</a>
<a name="1193"><span class="lineNum"> 1193 </span> : : } // namespace testing</a>
<a name="1194"><span class="lineNum"> 1194 </span> : : </a>
<a name="1195"><span class="lineNum"> 1195 </span> : : #define GTEST_MESSAGE_AT_(file, line, message, result_type) \</a>
<a name="1196"><span class="lineNum"> 1196 </span> : : ::testing::internal::AssertHelper(result_type, file, line, message) \</a>
<a name="1197"><span class="lineNum"> 1197 </span> : : = ::testing::Message()</a>
<a name="1198"><span class="lineNum"> 1198 </span> : : </a>
<a name="1199"><span class="lineNum"> 1199 </span> : : #define GTEST_MESSAGE_(message, result_type) \</a>
<a name="1200"><span class="lineNum"> 1200 </span> : : GTEST_MESSAGE_AT_(__FILE__, __LINE__, message, result_type)</a>
<a name="1201"><span class="lineNum"> 1201 </span> : : </a>
<a name="1202"><span class="lineNum"> 1202 </span> : : #define GTEST_FATAL_FAILURE_(message) \</a>
<a name="1203"><span class="lineNum"> 1203 </span> : : return GTEST_MESSAGE_(message, ::testing::TestPartResult::kFatalFailure)</a>
<a name="1204"><span class="lineNum"> 1204 </span> : : </a>
<a name="1205"><span class="lineNum"> 1205 </span> : : #define GTEST_NONFATAL_FAILURE_(message) \</a>
<a name="1206"><span class="lineNum"> 1206 </span> : : GTEST_MESSAGE_(message, ::testing::TestPartResult::kNonFatalFailure)</a>
<a name="1207"><span class="lineNum"> 1207 </span> : : </a>
<a name="1208"><span class="lineNum"> 1208 </span> : : #define GTEST_SUCCESS_(message) \</a>
<a name="1209"><span class="lineNum"> 1209 </span> : : GTEST_MESSAGE_(message, ::testing::TestPartResult::kSuccess)</a>
<a name="1210"><span class="lineNum"> 1210 </span> : : </a>
<a name="1211"><span class="lineNum"> 1211 </span> : : // Suppress MSVC warning 4702 (unreachable code) for the code following</a>
<a name="1212"><span class="lineNum"> 1212 </span> : : // statement if it returns or throws (or doesn't return or throw in some</a>
<a name="1213"><span class="lineNum"> 1213 </span> : : // situations).</a>
<a name="1214"><span class="lineNum"> 1214 </span> : : #define GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement) \</a>
<a name="1215"><span class="lineNum"> 1215 </span> : : if (::testing::internal::AlwaysTrue()) { statement; }</a>
<a name="1216"><span class="lineNum"> 1216 </span> : : </a>
<a name="1217"><span class="lineNum"> 1217 </span> : : #define GTEST_TEST_THROW_(statement, expected_exception, fail) \</a>
<a name="1218"><span class="lineNum"> 1218 </span> : : GTEST_AMBIGUOUS_ELSE_BLOCKER_ \</a>
<a name="1219"><span class="lineNum"> 1219 </span> : : if (::testing::internal::ConstCharPtr gtest_msg = &quot;&quot;) { \</a>
<a name="1220"><span class="lineNum"> 1220 </span> : : bool gtest_caught_expected = false; \</a>
<a name="1221"><span class="lineNum"> 1221 </span> : : try { \</a>
<a name="1222"><span class="lineNum"> 1222 </span> : : GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement); \</a>
<a name="1223"><span class="lineNum"> 1223 </span> : : } \</a>
<a name="1224"><span class="lineNum"> 1224 </span> : : catch (expected_exception const&amp;) { \</a>
<a name="1225"><span class="lineNum"> 1225 </span> : : gtest_caught_expected = true; \</a>
<a name="1226"><span class="lineNum"> 1226 </span> : : } \</a>
<a name="1227"><span class="lineNum"> 1227 </span> : : catch (...) { \</a>
<a name="1228"><span class="lineNum"> 1228 </span> : : gtest_msg.value = \</a>
<a name="1229"><span class="lineNum"> 1229 </span> : : &quot;Expected: &quot; #statement &quot; throws an exception of type &quot; \</a>
<a name="1230"><span class="lineNum"> 1230 </span> : : #expected_exception &quot;.\n Actual: it throws a different type.&quot;; \</a>
<a name="1231"><span class="lineNum"> 1231 </span> : : goto GTEST_CONCAT_TOKEN_(gtest_label_testthrow_, __LINE__); \</a>
<a name="1232"><span class="lineNum"> 1232 </span> : : } \</a>
<a name="1233"><span class="lineNum"> 1233 </span> : : if (!gtest_caught_expected) { \</a>
<a name="1234"><span class="lineNum"> 1234 </span> : : gtest_msg.value = \</a>
<a name="1235"><span class="lineNum"> 1235 </span> : : &quot;Expected: &quot; #statement &quot; throws an exception of type &quot; \</a>
<a name="1236"><span class="lineNum"> 1236 </span> : : #expected_exception &quot;.\n Actual: it throws nothing.&quot;; \</a>
<a name="1237"><span class="lineNum"> 1237 </span> : : goto GTEST_CONCAT_TOKEN_(gtest_label_testthrow_, __LINE__); \</a>
<a name="1238"><span class="lineNum"> 1238 </span> : : } \</a>
<a name="1239"><span class="lineNum"> 1239 </span> : : } else \</a>
<a name="1240"><span class="lineNum"> 1240 </span> : : GTEST_CONCAT_TOKEN_(gtest_label_testthrow_, __LINE__): \</a>
<a name="1241"><span class="lineNum"> 1241 </span> : : fail(gtest_msg.value)</a>
<a name="1242"><span class="lineNum"> 1242 </span> : : </a>
<a name="1243"><span class="lineNum"> 1243 </span> : : #define GTEST_TEST_NO_THROW_(statement, fail) \</a>
<a name="1244"><span class="lineNum"> 1244 </span> : : GTEST_AMBIGUOUS_ELSE_BLOCKER_ \</a>
<a name="1245"><span class="lineNum"> 1245 </span> : : if (::testing::internal::AlwaysTrue()) { \</a>
<a name="1246"><span class="lineNum"> 1246 </span> : : try { \</a>
<a name="1247"><span class="lineNum"> 1247 </span> : : GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement); \</a>
<a name="1248"><span class="lineNum"> 1248 </span> : : } \</a>
<a name="1249"><span class="lineNum"> 1249 </span> : : catch (...) { \</a>
<a name="1250"><span class="lineNum"> 1250 </span> : : goto GTEST_CONCAT_TOKEN_(gtest_label_testnothrow_, __LINE__); \</a>
<a name="1251"><span class="lineNum"> 1251 </span> : : } \</a>
<a name="1252"><span class="lineNum"> 1252 </span> : : } else \</a>
<a name="1253"><span class="lineNum"> 1253 </span> : : GTEST_CONCAT_TOKEN_(gtest_label_testnothrow_, __LINE__): \</a>
<a name="1254"><span class="lineNum"> 1254 </span> : : fail(&quot;Expected: &quot; #statement &quot; doesn't throw an exception.\n&quot; \</a>
<a name="1255"><span class="lineNum"> 1255 </span> : : &quot; Actual: it throws.&quot;)</a>
<a name="1256"><span class="lineNum"> 1256 </span> : : </a>
<a name="1257"><span class="lineNum"> 1257 </span> : : #define GTEST_TEST_ANY_THROW_(statement, fail) \</a>
<a name="1258"><span class="lineNum"> 1258 </span> : : GTEST_AMBIGUOUS_ELSE_BLOCKER_ \</a>
<a name="1259"><span class="lineNum"> 1259 </span> : : if (::testing::internal::AlwaysTrue()) { \</a>
<a name="1260"><span class="lineNum"> 1260 </span> : : bool gtest_caught_any = false; \</a>
<a name="1261"><span class="lineNum"> 1261 </span> : : try { \</a>
<a name="1262"><span class="lineNum"> 1262 </span> : : GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement); \</a>
<a name="1263"><span class="lineNum"> 1263 </span> : : } \</a>
<a name="1264"><span class="lineNum"> 1264 </span> : : catch (...) { \</a>
<a name="1265"><span class="lineNum"> 1265 </span> : : gtest_caught_any = true; \</a>
<a name="1266"><span class="lineNum"> 1266 </span> : : } \</a>
<a name="1267"><span class="lineNum"> 1267 </span> : : if (!gtest_caught_any) { \</a>
<a name="1268"><span class="lineNum"> 1268 </span> : : goto GTEST_CONCAT_TOKEN_(gtest_label_testanythrow_, __LINE__); \</a>
<a name="1269"><span class="lineNum"> 1269 </span> : : } \</a>
<a name="1270"><span class="lineNum"> 1270 </span> : : } else \</a>
<a name="1271"><span class="lineNum"> 1271 </span> : : GTEST_CONCAT_TOKEN_(gtest_label_testanythrow_, __LINE__): \</a>
<a name="1272"><span class="lineNum"> 1272 </span> : : fail(&quot;Expected: &quot; #statement &quot; throws an exception.\n&quot; \</a>
<a name="1273"><span class="lineNum"> 1273 </span> : : &quot; Actual: it doesn't.&quot;)</a>
<a name="1274"><span class="lineNum"> 1274 </span> : : </a>
<a name="1275"><span class="lineNum"> 1275 </span> : : </a>
<a name="1276"><span class="lineNum"> 1276 </span> : : // Implements Boolean test assertions such as EXPECT_TRUE. expression can be</a>
<a name="1277"><span class="lineNum"> 1277 </span> : : // either a boolean expression or an AssertionResult. text is a textual</a>
<a name="1278"><span class="lineNum"> 1278 </span> : : // represenation of expression as it was passed into the EXPECT_TRUE.</a>
<a name="1279"><span class="lineNum"> 1279 </span> : : #define GTEST_TEST_BOOLEAN_(expression, text, actual, expected, fail) \</a>
<a name="1280"><span class="lineNum"> 1280 </span> : : GTEST_AMBIGUOUS_ELSE_BLOCKER_ \</a>
<a name="1281"><span class="lineNum"> 1281 </span> : : if (const ::testing::AssertionResult gtest_ar_ = \</a>
<a name="1282"><span class="lineNum"> 1282 </span> : : ::testing::AssertionResult(expression)) \</a>
<a name="1283"><span class="lineNum"> 1283 </span> : : ; \</a>
<a name="1284"><span class="lineNum"> 1284 </span> : : else \</a>
<a name="1285"><span class="lineNum"> 1285 </span> : : fail(::testing::internal::GetBoolAssertionFailureMessage(\</a>
<a name="1286"><span class="lineNum"> 1286 </span> : : gtest_ar_, text, #actual, #expected).c_str())</a>
<a name="1287"><span class="lineNum"> 1287 </span> : : </a>
<a name="1288"><span class="lineNum"> 1288 </span> : : #define GTEST_TEST_NO_FATAL_FAILURE_(statement, fail) \</a>
<a name="1289"><span class="lineNum"> 1289 </span> : : GTEST_AMBIGUOUS_ELSE_BLOCKER_ \</a>
<a name="1290"><span class="lineNum"> 1290 </span> : : if (::testing::internal::AlwaysTrue()) { \</a>
<a name="1291"><span class="lineNum"> 1291 </span> : : ::testing::internal::HasNewFatalFailureHelper gtest_fatal_failure_checker; \</a>
<a name="1292"><span class="lineNum"> 1292 </span> : : GTEST_SUPPRESS_UNREACHABLE_CODE_WARNING_BELOW_(statement); \</a>
<a name="1293"><span class="lineNum"> 1293 </span> : : if (gtest_fatal_failure_checker.has_new_fatal_failure()) { \</a>
<a name="1294"><span class="lineNum"> 1294 </span> : : goto GTEST_CONCAT_TOKEN_(gtest_label_testnofatal_, __LINE__); \</a>
<a name="1295"><span class="lineNum"> 1295 </span> : : } \</a>
<a name="1296"><span class="lineNum"> 1296 </span> : : } else \</a>
<a name="1297"><span class="lineNum"> 1297 </span> : : GTEST_CONCAT_TOKEN_(gtest_label_testnofatal_, __LINE__): \</a>
<a name="1298"><span class="lineNum"> 1298 </span> : : fail(&quot;Expected: &quot; #statement &quot; doesn't generate new fatal &quot; \</a>
<a name="1299"><span class="lineNum"> 1299 </span> : : &quot;failures in the current thread.\n&quot; \</a>
<a name="1300"><span class="lineNum"> 1300 </span> : : &quot; Actual: it does.&quot;)</a>
<a name="1301"><span class="lineNum"> 1301 </span> : : </a>
<a name="1302"><span class="lineNum"> 1302 </span> : : // Expands to the name of the class that implements the given test.</a>
<a name="1303"><span class="lineNum"> 1303 </span> : : #define GTEST_TEST_CLASS_NAME_(test_case_name, test_name) \</a>
<a name="1304"><span class="lineNum"> 1304 </span> : : test_case_name##_##test_name##_Test</a>
<a name="1305"><span class="lineNum"> 1305 </span> : : </a>
<a name="1306"><span class="lineNum"> 1306 </span> : : // Helper macro for defining tests.</a>
<a name="1307"><span class="lineNum"> 1307 </span> : : #define GTEST_TEST_(test_case_name, test_name, parent_class, parent_id)\</a>
<a name="1308"><span class="lineNum"> 1308 </span> : : class GTEST_TEST_CLASS_NAME_(test_case_name, test_name) : public parent_class {\</a>
<a name="1309"><span class="lineNum"> 1309 </span> : : public:\</a>
<a name="1310"><span class="lineNum"> 1310 </span> : : GTEST_TEST_CLASS_NAME_(test_case_name, test_name)() {}\</a>
<a name="1311"><span class="lineNum"> 1311 </span> : : private:\</a>
<a name="1312"><span class="lineNum"> 1312 </span> : : virtual void TestBody();\</a>
<a name="1313"><span class="lineNum"> 1313 </span> : : static ::testing::TestInfo* const test_info_ GTEST_ATTRIBUTE_UNUSED_;\</a>
<a name="1314"><span class="lineNum"> 1314 </span> : : GTEST_DISALLOW_COPY_AND_ASSIGN_(\</a>
<a name="1315"><span class="lineNum"> 1315 </span> : : GTEST_TEST_CLASS_NAME_(test_case_name, test_name));\</a>
<a name="1316"><span class="lineNum"> 1316 </span> : : };\</a>
<a name="1317"><span class="lineNum"> 1317 </span> : : \</a>
<a name="1318"><span class="lineNum"> 1318 </span> : : ::testing::TestInfo* const GTEST_TEST_CLASS_NAME_(test_case_name, test_name)\</a>
<a name="1319"><span class="lineNum"> 1319 </span> : : ::test_info_ =\</a>
<a name="1320"><span class="lineNum"> 1320 </span> : : ::testing::internal::MakeAndRegisterTestInfo(\</a>
<a name="1321"><span class="lineNum"> 1321 </span> : : #test_case_name, #test_name, NULL, NULL, \</a>
<a name="1322"><span class="lineNum"> 1322 </span> : : ::testing::internal::CodeLocation(__FILE__, __LINE__), \</a>
<a name="1323"><span class="lineNum"> 1323 </span> : : (parent_id), \</a>
<a name="1324"><span class="lineNum"> 1324 </span> : : parent_class::SetUpTestCase, \</a>
<a name="1325"><span class="lineNum"> 1325 </span> : : parent_class::TearDownTestCase, \</a>
<a name="1326"><span class="lineNum"> 1326 </span> : : new ::testing::internal::TestFactoryImpl&lt;\</a>
<a name="1327"><span class="lineNum"> 1327 </span> : : GTEST_TEST_CLASS_NAME_(test_case_name, test_name)&gt;);\</a>
<a name="1328"><span class="lineNum"> 1328 </span> : : void GTEST_TEST_CLASS_NAME_(test_case_name, test_name)::TestBody()</a>
<a name="1329"><span class="lineNum"> 1329 </span> : : </a>
<a name="1330"><span class="lineNum"> 1330 </span> : : #endif // GTEST_INCLUDE_GTEST_INTERNAL_GTEST_INTERNAL_H_</a>
</pre>
</td>
</tr>
</table>
<br>
<table width="100%" border=0 cellspacing=0 cellpadding=0>
<tr><td class="ruler"><img src="../../../../glass.png" width=3 height=3 alt=""></td></tr>
<tr><td class="versionInfo">Generated by: <a href="http://ltp.sourceforge.net/coverage/lcov.php" target="_parent">LCOV version 1.14</a></td></tr>
</table>
<br>
</body>
</html>