OLD | NEW |
1 // Copyright 2015 The Chromium Authors. All rights reserved. | 1 // Copyright 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 "components/proximity_auth/logging/logging.h" | 5 #include "components/proximity_auth/logging/logging.h" |
6 | 6 |
| 7 #include <stddef.h> |
| 8 |
7 #include "base/lazy_instance.h" | 9 #include "base/lazy_instance.h" |
8 #include "base/numerics/safe_conversions.h" | 10 #include "base/numerics/safe_conversions.h" |
9 #include "base/strings/string_number_conversions.h" | 11 #include "base/strings/string_number_conversions.h" |
10 #include "components/proximity_auth/logging/log_buffer.h" | 12 #include "components/proximity_auth/logging/log_buffer.h" |
11 #include "testing/gtest/include/gtest/gtest.h" | 13 #include "testing/gtest/include/gtest/gtest.h" |
12 | 14 |
13 namespace proximity_auth { | 15 namespace proximity_auth { |
14 | 16 |
15 namespace { | 17 namespace { |
16 | 18 |
(...skipping 91 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
108 PA_LOG(WARNING) << kLog2; | 110 PA_LOG(WARNING) << kLog2; |
109 PA_LOG(ERROR) << kLog3; | 111 PA_LOG(ERROR) << kLog3; |
110 | 112 |
111 ASSERT_EQ(3u, g_standard_logs.Get().size()); | 113 ASSERT_EQ(3u, g_standard_logs.Get().size()); |
112 EXPECT_NE(std::string::npos, g_standard_logs.Get()[0].find(kLog1)); | 114 EXPECT_NE(std::string::npos, g_standard_logs.Get()[0].find(kLog1)); |
113 EXPECT_NE(std::string::npos, g_standard_logs.Get()[1].find(kLog2)); | 115 EXPECT_NE(std::string::npos, g_standard_logs.Get()[1].find(kLog2)); |
114 EXPECT_NE(std::string::npos, g_standard_logs.Get()[2].find(kLog3)); | 116 EXPECT_NE(std::string::npos, g_standard_logs.Get()[2].find(kLog3)); |
115 } | 117 } |
116 | 118 |
117 } // namespace proximity_auth | 119 } // namespace proximity_auth |
OLD | NEW |