| OLD | NEW |
| 1 // Copyright 2013 The Chromium Authors. All rights reserved. | 1 // Copyright 2013 The Chromium Authors. All rights reserved. |
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be |
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. |
| 4 | 4 |
| 5 #include "net/quic/quic_sent_entropy_manager.h" | 5 #include "net/quic/quic_sent_entropy_manager.h" |
| 6 | 6 |
| 7 #include <algorithm> | 7 #include <algorithm> |
| 8 #include <vector> |
| 8 | 9 |
| 9 #include "testing/gmock/include/gmock/gmock.h" | 10 #include "testing/gmock/include/gmock/gmock.h" |
| 10 #include "testing/gtest/include/gtest/gtest.h" | 11 #include "testing/gtest/include/gtest/gtest.h" |
| 11 | 12 |
| 12 using std::make_pair; | 13 using std::make_pair; |
| 13 using std::pair; | 14 using std::pair; |
| 14 | 15 |
| 15 namespace net { | 16 namespace net { |
| 16 namespace test { | 17 namespace test { |
| 17 namespace { | 18 namespace { |
| (...skipping 68 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 86 entropy_hash = 0; | 87 entropy_hash = 0; |
| 87 for (size_t i = 0; i < arraysize(entropies); ++i) { | 88 for (size_t i = 0; i < arraysize(entropies); ++i) { |
| 88 entropy_hash ^= entropies[i]; | 89 entropy_hash ^= entropies[i]; |
| 89 } | 90 } |
| 90 EXPECT_EQ(entropy_hash, entropy_manager_.GetCumulativeEntropy(10)); | 91 EXPECT_EQ(entropy_hash, entropy_manager_.GetCumulativeEntropy(10)); |
| 91 } | 92 } |
| 92 | 93 |
| 93 } // namespace | 94 } // namespace |
| 94 } // namespace test | 95 } // namespace test |
| 95 } // namespace net | 96 } // namespace net |
| OLD | NEW |