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.

151 lines
5.2 KiB

  1. // Copyright 2005, 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. // A sample program demonstrating using Google C++ testing framework.
  30. //
  31. // Author: wan@google.com (Zhanyong Wan)
  32. // In this example, we use a more advanced feature of Google Test called
  33. // test fixture.
  34. //
  35. // A test fixture is a place to hold objects and functions shared by
  36. // all tests in a test case. Using a test fixture avoids duplicating
  37. // the test code necessary to initialize and cleanup those common
  38. // objects for each test. It is also useful for defining sub-routines
  39. // that your tests need to invoke a lot.
  40. //
  41. // <TechnicalDetails>
  42. //
  43. // The tests share the test fixture in the sense of code sharing, not
  44. // data sharing. Each test is given its own fresh copy of the
  45. // fixture. You cannot expect the data modified by one test to be
  46. // passed on to another test, which is a bad idea.
  47. //
  48. // The reason for this design is that tests should be independent and
  49. // repeatable. In particular, a test should not fail as the result of
  50. // another test's failure. If one test depends on info produced by
  51. // another test, then the two tests should really be one big test.
  52. //
  53. // The macros for indicating the success/failure of a test
  54. // (EXPECT_TRUE, FAIL, etc) need to know what the current test is
  55. // (when Google Test prints the test result, it tells you which test
  56. // each failure belongs to). Technically, these macros invoke a
  57. // member function of the Test class. Therefore, you cannot use them
  58. // in a global function. That's why you should put test sub-routines
  59. // in a test fixture.
  60. //
  61. // </TechnicalDetails>
  62. #include "sample3-inl.h"
  63. #include "gtest/gtest.h"
  64. // To use a test fixture, derive a class from testing::Test.
  65. class QueueTest : public testing::Test {
  66. protected: // You should make the members protected s.t. they can be
  67. // accessed from sub-classes.
  68. // virtual void SetUp() will be called before each test is run. You
  69. // should define it if you need to initialize the varaibles.
  70. // Otherwise, this can be skipped.
  71. virtual void SetUp() {
  72. q1_.Enqueue(1);
  73. q2_.Enqueue(2);
  74. q2_.Enqueue(3);
  75. }
  76. // virtual void TearDown() will be called after each test is run.
  77. // You should define it if there is cleanup work to do. Otherwise,
  78. // you don't have to provide it.
  79. //
  80. // virtual void TearDown() {
  81. // }
  82. // A helper function that some test uses.
  83. static int Double(int n) {
  84. return 2*n;
  85. }
  86. // A helper function for testing Queue::Map().
  87. void MapTester(const Queue<int> * q) {
  88. // Creates a new queue, where each element is twice as big as the
  89. // corresponding one in q.
  90. const Queue<int> * const new_q = q->Map(Double);
  91. // Verifies that the new queue has the same size as q.
  92. ASSERT_EQ(q->Size(), new_q->Size());
  93. // Verifies the relationship between the elements of the two queues.
  94. for ( const QueueNode<int> * n1 = q->Head(), * n2 = new_q->Head();
  95. n1 != NULL; n1 = n1->next(), n2 = n2->next() ) {
  96. EXPECT_EQ(2 * n1->element(), n2->element());
  97. }
  98. delete new_q;
  99. }
  100. // Declares the variables your tests want to use.
  101. Queue<int> q0_;
  102. Queue<int> q1_;
  103. Queue<int> q2_;
  104. };
  105. // When you have a test fixture, you define a test using TEST_F
  106. // instead of TEST.
  107. // Tests the default c'tor.
  108. TEST_F(QueueTest, DefaultConstructor) {
  109. // You can access data in the test fixture here.
  110. EXPECT_EQ(0u, q0_.Size());
  111. }
  112. // Tests Dequeue().
  113. TEST_F(QueueTest, Dequeue) {
  114. int * n = q0_.Dequeue();
  115. EXPECT_TRUE(n == NULL);
  116. n = q1_.Dequeue();
  117. ASSERT_TRUE(n != NULL);
  118. EXPECT_EQ(1, *n);
  119. EXPECT_EQ(0u, q1_.Size());
  120. delete n;
  121. n = q2_.Dequeue();
  122. ASSERT_TRUE(n != NULL);
  123. EXPECT_EQ(2, *n);
  124. EXPECT_EQ(1u, q2_.Size());
  125. delete n;
  126. }
  127. // Tests the Queue::Map() function.
  128. TEST_F(QueueTest, Map) {
  129. MapTester(&q0_);
  130. MapTester(&q1_);
  131. MapTester(&q2_);
  132. }