| OLD | NEW |
| (Empty) | |
| 1 // Copyright 2016 The Chromium Authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. |
| 4 |
| 5 #include "blimp/net/helium/vector_clock.h" |
| 6 |
| 7 #include "base/macros.h" |
| 8 #include "testing/gtest/include/gtest/gtest.h" |
| 9 |
| 10 namespace blimp { |
| 11 namespace { |
| 12 |
| 13 class VectorClockComparisonTest |
| 14 : public ::testing::TestWithParam< |
| 15 std::tuple<VectorClock, VectorClock, VectorClock::Comparison>> { |
| 16 public: |
| 17 VectorClockComparisonTest() {} |
| 18 ~VectorClockComparisonTest() override {} |
| 19 }; |
| 20 |
| 21 TEST_P(VectorClockComparisonTest, CompareTo) { |
| 22 auto param = GetParam(); |
| 23 VectorClock v1 = std::get<0>(param); |
| 24 VectorClock v2 = std::get<1>(param); |
| 25 VectorClock::Comparison expected = std::get<2>(param); |
| 26 EXPECT_EQ(expected, v1.CompareTo(v2)); |
| 27 } |
| 28 |
| 29 INSTANTIATE_TEST_CASE_P( |
| 30 LessThan, |
| 31 VectorClockComparisonTest, |
| 32 ::testing::Values(std::make_tuple(VectorClock(1, 2), |
| 33 VectorClock(1, 3), |
| 34 VectorClock::Comparison::LessThan))); |
| 35 |
| 36 INSTANTIATE_TEST_CASE_P( |
| 37 GreaterThan, |
| 38 VectorClockComparisonTest, |
| 39 ::testing::Values(std::make_tuple(VectorClock(1, 3), |
| 40 VectorClock(1, 2), |
| 41 VectorClock::Comparison::GreaterThan), |
| 42 std::make_tuple(VectorClock(2, 2), |
| 43 VectorClock(1, 2), |
| 44 VectorClock::Comparison::GreaterThan))); |
| 45 |
| 46 INSTANTIATE_TEST_CASE_P( |
| 47 Conflict, |
| 48 VectorClockComparisonTest, |
| 49 ::testing::Values(std::make_tuple(VectorClock(1, 2), |
| 50 VectorClock(0, 1), |
| 51 VectorClock::Comparison::Conflict), |
| 52 std::make_tuple(VectorClock(1, 2), |
| 53 VectorClock(0, 3), |
| 54 VectorClock::Comparison::Conflict))); |
| 55 |
| 56 INSTANTIATE_TEST_CASE_P( |
| 57 EqualTo, |
| 58 VectorClockComparisonTest, |
| 59 ::testing::Values(std::make_tuple(VectorClock(1, 1), |
| 60 VectorClock(1, 1), |
| 61 VectorClock::Comparison::EqualTo), |
| 62 std::make_tuple(VectorClock(2, 3), |
| 63 VectorClock(2, 3), |
| 64 VectorClock::Comparison::EqualTo), |
| 65 std::make_tuple(VectorClock(3, 2), |
| 66 VectorClock(3, 2), |
| 67 VectorClock::Comparison::EqualTo))); |
| 68 |
| 69 class VectorClockTest : public testing::Test { |
| 70 public: |
| 71 VectorClockTest() {} |
| 72 ~VectorClockTest() override {} |
| 73 |
| 74 protected: |
| 75 void CheckCumulativeMerge(const VectorClock& v1, |
| 76 const VectorClock& v2, |
| 77 const VectorClock& expected) { |
| 78 // Compute the merge of v1 and v2 |
| 79 VectorClock r1 = v1.MergeWith(v2); |
| 80 EXPECT_EQ(expected.local_revision(), r1.local_revision()); |
| 81 EXPECT_EQ(expected.remote_revision(), r1.remote_revision()); |
| 82 |
| 83 // Compute the merge of v2 and v1 |
| 84 VectorClock r2 = v2.MergeWith(v1); |
| 85 EXPECT_EQ(expected.local_revision(), r2.local_revision()); |
| 86 EXPECT_EQ(expected.remote_revision(), r2.remote_revision()); |
| 87 } |
| 88 |
| 89 private: |
| 90 DISALLOW_COPY_AND_ASSIGN(VectorClockTest); |
| 91 }; |
| 92 |
| 93 TEST_F(VectorClockTest, IncrementLocal1) { |
| 94 VectorClock v(0, 0); |
| 95 v.IncrementLocal(); |
| 96 EXPECT_EQ(1U, v.local_revision()); |
| 97 EXPECT_EQ(0U, v.remote_revision()); |
| 98 } |
| 99 |
| 100 TEST_F(VectorClockTest, IncrementLocal2) { |
| 101 VectorClock v(4, 5); |
| 102 v.IncrementLocal(); |
| 103 EXPECT_EQ(5U, v.local_revision()); |
| 104 EXPECT_EQ(5U, v.remote_revision()); |
| 105 } |
| 106 |
| 107 TEST_F(VectorClockTest, MergeLocalEqualRemoteSmaller) { |
| 108 VectorClock v1(1, 2); |
| 109 VectorClock v2(1, 4); |
| 110 |
| 111 VectorClock expected(1, 4); |
| 112 CheckCumulativeMerge(v1, v2, expected); |
| 113 } |
| 114 |
| 115 TEST_F(VectorClockTest, MergeLocalSmallerRemoteEqual) { |
| 116 VectorClock v1(1, 4); |
| 117 VectorClock v2(2, 4); |
| 118 |
| 119 VectorClock expected(2, 4); |
| 120 CheckCumulativeMerge(v1, v2, expected); |
| 121 } |
| 122 |
| 123 TEST_F(VectorClockTest, MergeLocalSmallerRemoteSmaller) { |
| 124 VectorClock v1(1, 2); |
| 125 VectorClock v2(3, 4); |
| 126 |
| 127 VectorClock expected(3, 4); |
| 128 CheckCumulativeMerge(v1, v2, expected); |
| 129 } |
| 130 |
| 131 TEST_F(VectorClockTest, MergeLocalSmallerRemoteGreater) { |
| 132 VectorClock v1(1, 4); |
| 133 VectorClock v2(3, 2); |
| 134 |
| 135 VectorClock expected(3, 4); |
| 136 CheckCumulativeMerge(v1, v2, expected); |
| 137 } |
| 138 |
| 139 } // namespace |
| 140 } // namespace blimp |
| OLD | NEW |