OLD | NEW |
1 // Copyright (c) 2015 The Chromium Authors. All rights reserved. | 1 // Copyright (c) 2015 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 <stddef.h> |
| 6 |
5 #include <algorithm> | 7 #include <algorithm> |
6 | 8 |
| 9 #include "base/macros.h" |
7 #include "base/strings/stringprintf.h" | 10 #include "base/strings/stringprintf.h" |
8 #include "components/safe_browsing_db/util.h" | 11 #include "components/safe_browsing_db/util.h" |
9 #include "testing/gtest/include/gtest/gtest.h" | 12 #include "testing/gtest/include/gtest/gtest.h" |
10 #include "url/gurl.h" | 13 #include "url/gurl.h" |
11 | 14 |
12 namespace safe_browsing { | 15 namespace safe_browsing { |
13 | 16 |
14 namespace { | 17 namespace { |
15 | 18 |
16 bool VectorContains(const std::vector<std::string>& data, | 19 bool VectorContains(const std::vector<std::string>& data, |
(...skipping 349 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
366 EXPECT_FALSE(SBFullHashEqual(kHash2, kHash1)); | 369 EXPECT_FALSE(SBFullHashEqual(kHash2, kHash1)); |
367 | 370 |
368 EXPECT_FALSE(SBFullHashLess(kHash1, kHash2)); | 371 EXPECT_FALSE(SBFullHashLess(kHash1, kHash2)); |
369 EXPECT_TRUE(SBFullHashLess(kHash2, kHash1)); | 372 EXPECT_TRUE(SBFullHashLess(kHash2, kHash1)); |
370 | 373 |
371 EXPECT_FALSE(SBFullHashLess(kHash1, kHash1)); | 374 EXPECT_FALSE(SBFullHashLess(kHash1, kHash1)); |
372 EXPECT_FALSE(SBFullHashLess(kHash2, kHash2)); | 375 EXPECT_FALSE(SBFullHashLess(kHash2, kHash2)); |
373 } | 376 } |
374 | 377 |
375 } // namespace safe_browsing | 378 } // namespace safe_browsing |
OLD | NEW |