sample8_unittest.cc 6.8 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173
  1. // Copyright 2008 Google Inc.
  2. // All Rights Reserved.
  3. //
  4. // Redistribution and use in source and binary forms, with or without
  5. // modification, are permitted provided that the following conditions are
  6. // met:
  7. //
  8. // * Redistributions of source code must retain the above copyright
  9. // notice, this list of conditions and the following disclaimer.
  10. // * Redistributions in binary form must reproduce the above
  11. // copyright notice, this list of conditions and the following disclaimer
  12. // in the documentation and/or other materials provided with the
  13. // distribution.
  14. // * Neither the name of Google Inc. nor the names of its
  15. // contributors may be used to endorse or promote products derived from
  16. // this software without specific prior written permission.
  17. //
  18. // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  19. // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  20. // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
  21. // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
  22. // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
  23. // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
  24. // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  25. // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  26. // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  27. // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
  28. // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  29. // This sample shows how to test code relying on some global flag variables.
  30. // Combine() helps with generating all possible combinations of such flags,
  31. // and each test is given one combination as a parameter.
  32. // Use class definitions to test from this header.
  33. #include "prime_tables.h"
  34. #include "gtest/gtest.h"
  35. namespace {
  36. #if GTEST_HAS_COMBINE
  37. // Suppose we want to introduce a new, improved implementation of PrimeTable
  38. // which combines speed of PrecalcPrimeTable and versatility of
  39. // OnTheFlyPrimeTable (see prime_tables.h). Inside it instantiates both
  40. // PrecalcPrimeTable and OnTheFlyPrimeTable and uses the one that is more
  41. // appropriate under the circumstances. But in low memory conditions, it can be
  42. // told to instantiate without PrecalcPrimeTable instance at all and use only
  43. // OnTheFlyPrimeTable.
  44. class HybridPrimeTable : public PrimeTable {
  45. public:
  46. HybridPrimeTable(bool force_on_the_fly, int max_precalculated)
  47. : on_the_fly_impl_(new OnTheFlyPrimeTable),
  48. precalc_impl_(force_on_the_fly ? NULL :
  49. new PreCalculatedPrimeTable(max_precalculated)),
  50. max_precalculated_(max_precalculated) {}
  51. virtual ~HybridPrimeTable() {
  52. delete on_the_fly_impl_;
  53. delete precalc_impl_;
  54. }
  55. virtual bool IsPrime(int n) const {
  56. if (precalc_impl_ != NULL && n < max_precalculated_)
  57. return precalc_impl_->IsPrime(n);
  58. else
  59. return on_the_fly_impl_->IsPrime(n);
  60. }
  61. virtual int GetNextPrime(int p) const {
  62. int next_prime = -1;
  63. if (precalc_impl_ != NULL && p < max_precalculated_)
  64. next_prime = precalc_impl_->GetNextPrime(p);
  65. return next_prime != -1 ? next_prime : on_the_fly_impl_->GetNextPrime(p);
  66. }
  67. private:
  68. OnTheFlyPrimeTable* on_the_fly_impl_;
  69. PreCalculatedPrimeTable* precalc_impl_;
  70. int max_precalculated_;
  71. };
  72. using ::testing::TestWithParam;
  73. using ::testing::Bool;
  74. using ::testing::Values;
  75. using ::testing::Combine;
  76. // To test all code paths for HybridPrimeTable we must test it with numbers
  77. // both within and outside PreCalculatedPrimeTable's capacity and also with
  78. // PreCalculatedPrimeTable disabled. We do this by defining fixture which will
  79. // accept different combinations of parameters for instantiating a
  80. // HybridPrimeTable instance.
  81. class PrimeTableTest : public TestWithParam< ::testing::tuple<bool, int> > {
  82. protected:
  83. virtual void SetUp() {
  84. // This can be written as
  85. //
  86. // bool force_on_the_fly;
  87. // int max_precalculated;
  88. // tie(force_on_the_fly, max_precalculated) = GetParam();
  89. //
  90. // once the Google C++ Style Guide allows use of ::std::tr1::tie.
  91. //
  92. bool force_on_the_fly = ::testing::get<0>(GetParam());
  93. int max_precalculated = ::testing::get<1>(GetParam());
  94. table_ = new HybridPrimeTable(force_on_the_fly, max_precalculated);
  95. }
  96. virtual void TearDown() {
  97. delete table_;
  98. table_ = NULL;
  99. }
  100. HybridPrimeTable* table_;
  101. };
  102. TEST_P(PrimeTableTest, ReturnsFalseForNonPrimes) {
  103. // Inside the test body, you can refer to the test parameter by GetParam().
  104. // In this case, the test parameter is a PrimeTable interface pointer which
  105. // we can use directly.
  106. // Please note that you can also save it in the fixture's SetUp() method
  107. // or constructor and use saved copy in the tests.
  108. EXPECT_FALSE(table_->IsPrime(-5));
  109. EXPECT_FALSE(table_->IsPrime(0));
  110. EXPECT_FALSE(table_->IsPrime(1));
  111. EXPECT_FALSE(table_->IsPrime(4));
  112. EXPECT_FALSE(table_->IsPrime(6));
  113. EXPECT_FALSE(table_->IsPrime(100));
  114. }
  115. TEST_P(PrimeTableTest, ReturnsTrueForPrimes) {
  116. EXPECT_TRUE(table_->IsPrime(2));
  117. EXPECT_TRUE(table_->IsPrime(3));
  118. EXPECT_TRUE(table_->IsPrime(5));
  119. EXPECT_TRUE(table_->IsPrime(7));
  120. EXPECT_TRUE(table_->IsPrime(11));
  121. EXPECT_TRUE(table_->IsPrime(131));
  122. }
  123. TEST_P(PrimeTableTest, CanGetNextPrime) {
  124. EXPECT_EQ(2, table_->GetNextPrime(0));
  125. EXPECT_EQ(3, table_->GetNextPrime(2));
  126. EXPECT_EQ(5, table_->GetNextPrime(3));
  127. EXPECT_EQ(7, table_->GetNextPrime(5));
  128. EXPECT_EQ(11, table_->GetNextPrime(7));
  129. EXPECT_EQ(131, table_->GetNextPrime(128));
  130. }
  131. // In order to run value-parameterized tests, you need to instantiate them,
  132. // or bind them to a list of values which will be used as test parameters.
  133. // You can instantiate them in a different translation module, or even
  134. // instantiate them several times.
  135. //
  136. // Here, we instantiate our tests with a list of parameters. We must combine
  137. // all variations of the boolean flag suppressing PrecalcPrimeTable and some
  138. // meaningful values for tests. We choose a small value (1), and a value that
  139. // will put some of the tested numbers beyond the capability of the
  140. // PrecalcPrimeTable instance and some inside it (10). Combine will produce all
  141. // possible combinations.
  142. INSTANTIATE_TEST_CASE_P(MeaningfulTestParameters,
  143. PrimeTableTest,
  144. Combine(Bool(), Values(1, 10)));
  145. #else
  146. // Google Test may not support Combine() with some compilers. If we
  147. // use conditional compilation to compile out all code referring to
  148. // the gtest_main library, MSVC linker will not link that library at
  149. // all and consequently complain about missing entry point defined in
  150. // that library (fatal error LNK1561: entry point must be
  151. // defined). This dummy test keeps gtest_main linked in.
  152. TEST(DummyTest, CombineIsNotSupportedOnThisPlatform) {}
  153. #endif // GTEST_HAS_COMBINE
  154. } // namespace