OLD | NEW |
1 // Copyright 2014 The Chromium Authors. All rights reserved. | 1 // Copyright 2014 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 "cc/base/list_container.h" | 5 #include "cc/base/list_container.h" |
6 | 6 |
| 7 #include <stddef.h> |
| 8 |
7 #include <algorithm> | 9 #include <algorithm> |
8 #include <vector> | 10 #include <vector> |
9 #include "testing/gmock/include/gmock/gmock.h" | 11 #include "testing/gmock/include/gmock/gmock.h" |
10 #include "testing/gtest/include/gtest/gtest.h" | 12 #include "testing/gtest/include/gtest/gtest.h" |
11 | 13 |
12 namespace cc { | 14 namespace cc { |
13 namespace { | 15 namespace { |
14 | 16 |
15 // Element class having derived classes. | 17 // Element class having derived classes. |
16 class DerivedElement { | 18 class DerivedElement { |
(...skipping 1179 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
1196 size_t capacity = list.GetCapacityInBytes(); | 1198 size_t capacity = list.GetCapacityInBytes(); |
1197 ASSERT_GE(capacity, list.size() * LargestDerivedElementSize()); | 1199 ASSERT_GE(capacity, list.size() * LargestDerivedElementSize()); |
1198 ASSERT_LE(capacity, std::max(list.size(), upper_bound_on_min_capacity) * | 1200 ASSERT_LE(capacity, std::max(list.size(), upper_bound_on_min_capacity) * |
1199 max_waste_factor * LargestDerivedElementSize()); | 1201 max_waste_factor * LargestDerivedElementSize()); |
1200 list.RemoveLast(); | 1202 list.RemoveLast(); |
1201 } | 1203 } |
1202 } | 1204 } |
1203 | 1205 |
1204 } // namespace | 1206 } // namespace |
1205 } // namespace cc | 1207 } // namespace cc |
OLD | NEW |