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 17 matching lines...) Expand all Loading... |
28 #include <stdlib.h> | 28 #include <stdlib.h> |
29 | 29 |
30 #include "v8.h" | 30 #include "v8.h" |
31 | 31 |
32 #include "ast.h" | 32 #include "ast.h" |
33 #include "cctest.h" | 33 #include "cctest.h" |
34 | 34 |
35 using namespace v8::internal; | 35 using namespace v8::internal; |
36 | 36 |
37 TEST(List) { | 37 TEST(List) { |
38 List<Node*>* list = new List<Node*>(0); | 38 List<AstNode*>* list = new List<AstNode*>(0); |
39 CHECK_EQ(0, list->length()); | 39 CHECK_EQ(0, list->length()); |
40 | 40 |
41 ZoneScope zone_scope(DELETE_ON_EXIT); | 41 ZoneScope zone_scope(DELETE_ON_EXIT); |
42 Node* node = new EmptyStatement(); | 42 AstNode* node = new EmptyStatement(); |
43 list->Add(node); | 43 list->Add(node); |
44 CHECK_EQ(1, list->length()); | 44 CHECK_EQ(1, list->length()); |
45 CHECK_EQ(node, list->at(0)); | 45 CHECK_EQ(node, list->at(0)); |
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()); |
(...skipping 35 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
88 | 88 |
89 TEST(DeleteEmpty) { | 89 TEST(DeleteEmpty) { |
90 { | 90 { |
91 List<int>* list = new List<int>(0); | 91 List<int>* list = new List<int>(0); |
92 delete list; | 92 delete list; |
93 } | 93 } |
94 { | 94 { |
95 List<int> list(0); | 95 List<int> list(0); |
96 } | 96 } |
97 } | 97 } |
OLD | NEW |