| 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 <stddef.h> |
| 6 |
| 5 #include <algorithm> | 7 #include <algorithm> |
| 6 #include <vector> | 8 #include <vector> |
| 7 | 9 |
| 10 #include "base/macros.h" |
| 8 #include "base/strings/string_split.h" | 11 #include "base/strings/string_split.h" |
| 9 #include "base/strings/string_util.h" | 12 #include "base/strings/string_util.h" |
| 10 #include "remoting/base/capabilities.h" | 13 #include "remoting/base/capabilities.h" |
| 11 #include "testing/gtest/include/gtest/gtest.h" | 14 #include "testing/gtest/include/gtest/gtest.h" |
| 12 | 15 |
| 13 namespace { | 16 namespace { |
| 14 | 17 |
| 15 struct HasCapabilityTestData { | 18 struct HasCapabilityTestData { |
| 16 const char* capabilities; | 19 const char* capabilities; |
| 17 const char* key; | 20 const char* key; |
| (...skipping 80 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 98 data[i].left, " ", base::KEEP_WHITESPACE, base::SPLIT_WANT_NONEMPTY); | 101 data[i].left, " ", base::KEEP_WHITESPACE, base::SPLIT_WANT_NONEMPTY); |
| 99 do { | 102 do { |
| 100 EXPECT_EQ(data[i].result, | 103 EXPECT_EQ(data[i].result, |
| 101 IntersectCapabilities(base::JoinString(caps, " "), | 104 IntersectCapabilities(base::JoinString(caps, " "), |
| 102 data[i].right)); | 105 data[i].right)); |
| 103 } while (std::next_permutation(caps.begin(), caps.end())); | 106 } while (std::next_permutation(caps.begin(), caps.end())); |
| 104 } | 107 } |
| 105 } | 108 } |
| 106 | 109 |
| 107 } // namespace remoting | 110 } // namespace remoting |
| OLD | NEW |