| 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 <stddef.h> |
| 6 |
| 5 #include "cc/base/contiguous_container.h" | 7 #include "cc/base/contiguous_container.h" |
| 6 #include "testing/gmock/include/gmock/gmock.h" | 8 #include "testing/gmock/include/gmock/gmock.h" |
| 7 #include "testing/gtest/include/gtest/gtest.h" | 9 #include "testing/gtest/include/gtest/gtest.h" |
| 8 | 10 |
| 9 namespace cc { | 11 namespace cc { |
| 10 namespace { | 12 namespace { |
| 11 | 13 |
| 12 struct Point2D { | 14 struct Point2D { |
| 13 Point2D() : Point2D(0, 0) {} | 15 Point2D() : Point2D(0, 0) {} |
| 14 Point2D(int x, int y) : x(x), y(y) {} | 16 Point2D(int x, int y) : x(x), y(y) {} |
| (...skipping 489 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 504 ContiguousContainer<Point2D, kPointAlignment> list(kMaxPointSize); | 506 ContiguousContainer<Point2D, kPointAlignment> list(kMaxPointSize); |
| 505 size_t empty_capacity = list.GetCapacityInBytes(); | 507 size_t empty_capacity = list.GetCapacityInBytes(); |
| 506 list.AllocateAndConstruct<Point2D>(); | 508 list.AllocateAndConstruct<Point2D>(); |
| 507 list.AllocateAndConstruct<Point2D>(); | 509 list.AllocateAndConstruct<Point2D>(); |
| 508 list.Clear(); | 510 list.Clear(); |
| 509 EXPECT_EQ(empty_capacity, list.GetCapacityInBytes()); | 511 EXPECT_EQ(empty_capacity, list.GetCapacityInBytes()); |
| 510 } | 512 } |
| 511 | 513 |
| 512 } // namespace | 514 } // namespace |
| 513 } // namespace cc | 515 } // namespace cc |
| OLD | NEW |