OLD | NEW |
1 // Copyright (c) 2011, the Dart project authors. Please see the AUTHORS file | 1 // Copyright (c) 2012, the Dart project authors. Please see the AUTHORS file |
2 // for details. All rights reserved. Use of this source code is governed by a | 2 // for details. All rights reserved. Use of this source code is governed by a |
3 // BSD-style license that can be found in the LICENSE file. | 3 // BSD-style license that can be found in the LICENSE file. |
4 | 4 |
5 #include "vm/assert.h" | 5 #include "platform/assert.h" |
6 #include "vm/growable_array.h" | 6 #include "vm/growable_array.h" |
7 #include "vm/unit_test.h" | 7 #include "vm/unit_test.h" |
8 | 8 |
9 namespace dart { | 9 namespace dart { |
10 | 10 |
11 TEST_CASE(GrowableArray) { | 11 TEST_CASE(GrowableArray) { |
12 GrowableArray<int> g; | 12 GrowableArray<int> g; |
13 EXPECT_EQ(0, g.length()); | 13 EXPECT_EQ(0, g.length()); |
14 EXPECT(g.is_empty()); | 14 EXPECT(g.is_empty()); |
15 g.Add(5); | 15 g.Add(5); |
(...skipping 61 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
77 g.Add(12); | 77 g.Add(12); |
78 g.Add(4); | 78 g.Add(4); |
79 g.Add(64); | 79 g.Add(64); |
80 g.Add(8); | 80 g.Add(8); |
81 g.Sort(greatestFirst); | 81 g.Sort(greatestFirst); |
82 EXPECT_EQ(64, g[0]); | 82 EXPECT_EQ(64, g[0]); |
83 EXPECT_EQ(4, g.Last()); | 83 EXPECT_EQ(4, g.Last()); |
84 } | 84 } |
85 | 85 |
86 } // namespace dart | 86 } // namespace dart |
OLD | NEW |