OLD | NEW |
1 // Copyright 2012 The Chromium Authors. All rights reserved. | 1 // Copyright 2012 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 "base/stl_util.h" | 5 #include "base/stl_util.h" |
6 | 6 |
7 #include <set> | 7 #include <set> |
8 | 8 |
9 #include "testing/gtest/include/gtest/gtest.h" | 9 #include "testing/gtest/include/gtest/gtest.h" |
10 | 10 |
(...skipping 10 matching lines...) Expand all Loading... |
21 } | 21 } |
22 | 22 |
23 bool operator<(const ComparableValue& rhs) const { | 23 bool operator<(const ComparableValue& rhs) const { |
24 return value_ < rhs.value_; | 24 return value_ < rhs.value_; |
25 } | 25 } |
26 | 26 |
27 private: | 27 private: |
28 int value_; | 28 int value_; |
29 }; | 29 }; |
30 | 30 |
31 } | 31 } // namespace |
32 | 32 |
33 namespace base { | 33 namespace base { |
34 namespace { | 34 namespace { |
35 | 35 |
36 TEST(STLUtilTest, STLIsSorted) { | 36 TEST(STLUtilTest, STLIsSorted) { |
37 { | 37 { |
38 std::set<int> set; | 38 std::set<int> set; |
39 set.insert(24); | 39 set.insert(24); |
40 set.insert(1); | 40 set.insert(1); |
41 set.insert(12); | 41 set.insert(12); |
(...skipping 216 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
258 // const_cast<char*>(str->data()). | 258 // const_cast<char*>(str->data()). |
259 std::string s1("abc"); | 259 std::string s1("abc"); |
260 const std::string s2(s1); | 260 const std::string s2(s1); |
261 string_as_array(&s1)[1] = 'x'; | 261 string_as_array(&s1)[1] = 'x'; |
262 EXPECT_EQ("axc", s1); | 262 EXPECT_EQ("axc", s1); |
263 EXPECT_EQ("abc", s2); | 263 EXPECT_EQ("abc", s2); |
264 } | 264 } |
265 | 265 |
266 } // namespace | 266 } // namespace |
267 } // namespace base | 267 } // namespace base |
OLD | NEW |