| OLD | NEW |
| 1 // Copyright 2016 the V8 project authors. All rights reserved. | 1 // Copyright 2016 the V8 project 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 "src/zone/zone-chunk-list.h" | 5 #include "src/zone/zone-chunk-list.h" |
| 6 | 6 |
| 7 #include "src/list-inl.h" | |
| 8 #include "src/zone/accounting-allocator.h" | 7 #include "src/zone/accounting-allocator.h" |
| 9 #include "src/zone/zone.h" | 8 #include "src/zone/zone.h" |
| 10 #include "testing/gtest/include/gtest/gtest.h" | 9 #include "testing/gtest/include/gtest/gtest.h" |
| 11 | 10 |
| 12 namespace v8 { | 11 namespace v8 { |
| 13 namespace internal { | 12 namespace internal { |
| 14 | 13 |
| 15 const size_t kItemCount = size_t(1) << 10; | 14 const size_t kItemCount = size_t(1) << 10; |
| 16 | 15 |
| 17 TEST(ZoneChunkList, ForwardIterationTest) { | 16 TEST(ZoneChunkList, ForwardIterationTest) { |
| (...skipping 180 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 198 zone_chunk_list.CopyTo(array); | 197 zone_chunk_list.CopyTo(array); |
| 199 | 198 |
| 200 for (size_t i = 0; i < kItemCount; ++i) { | 199 for (size_t i = 0; i < kItemCount; ++i) { |
| 201 EXPECT_EQ(array[i].a_, i); | 200 EXPECT_EQ(array[i].a_, i); |
| 202 EXPECT_EQ(array[i].b_, i + 5); | 201 EXPECT_EQ(array[i].b_, i + 5); |
| 203 } | 202 } |
| 204 } | 203 } |
| 205 | 204 |
| 206 } // namespace internal | 205 } // namespace internal |
| 207 } // namespace v8 | 206 } // namespace v8 |
| OLD | NEW |