OLD | NEW |
1 // Copyright 2006-2008 the V8 project authors. All rights reserved. | 1 // Copyright 2006-2008 the V8 project authors. All rights reserved. |
2 // Redistribution and use in source and binary forms, with or without | 2 // Redistribution and use in source and binary forms, with or without |
3 // modification, are permitted provided that the following conditions are | 3 // modification, are permitted provided that the following conditions are |
4 // met: | 4 // met: |
5 // | 5 // |
6 // * Redistributions of source code must retain the above copyright | 6 // * Redistributions of source code must retain the above copyright |
7 // notice, this list of conditions and the following disclaimer. | 7 // notice, this list of conditions and the following disclaimer. |
8 // * Redistributions in binary form must reproduce the above | 8 // * Redistributions in binary form must reproduce the above |
9 // copyright notice, this list of conditions and the following | 9 // copyright notice, this list of conditions and the following |
10 // disclaimer in the documentation and/or other materials provided | 10 // disclaimer in the documentation and/or other materials provided |
(...skipping 35 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
46 CHECK_EQ(node, list->last()); | 46 CHECK_EQ(node, list->last()); |
47 | 47 |
48 const int kElements = 100; | 48 const int kElements = 100; |
49 for (int i = 0; i < kElements; i++) { | 49 for (int i = 0; i < kElements; i++) { |
50 list->Add(node); | 50 list->Add(node); |
51 } | 51 } |
52 CHECK_EQ(1 + kElements, list->length()); | 52 CHECK_EQ(1 + kElements, list->length()); |
53 | 53 |
54 list->Clear(); | 54 list->Clear(); |
55 CHECK_EQ(0, list->length()); | 55 CHECK_EQ(0, list->length()); |
| 56 delete list; |
56 } | 57 } |
57 | 58 |
58 | 59 |
59 TEST(RemoveLast) { | 60 TEST(RemoveLast) { |
60 List<int> list(4); | 61 List<int> list(4); |
61 CHECK_EQ(0, list.length()); | 62 CHECK_EQ(0, list.length()); |
62 list.Add(1); | 63 list.Add(1); |
63 CHECK_EQ(1, list.length()); | 64 CHECK_EQ(1, list.length()); |
64 CHECK_EQ(1, list.last()); | 65 CHECK_EQ(1, list.last()); |
65 list.RemoveLast(); | 66 list.RemoveLast(); |
(...skipping 21 matching lines...) Expand all Loading... |
87 | 88 |
88 TEST(DeleteEmpty) { | 89 TEST(DeleteEmpty) { |
89 { | 90 { |
90 List<int>* list = new List<int>(0); | 91 List<int>* list = new List<int>(0); |
91 delete list; | 92 delete list; |
92 } | 93 } |
93 { | 94 { |
94 List<int> list(0); | 95 List<int> list(0); |
95 } | 96 } |
96 } | 97 } |
OLD | NEW |