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 21 matching lines...) Expand all Loading... |
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 v8::internal::V8::Initialize(NULL); | 38 v8::internal::V8::Initialize(NULL); |
39 List<AstNode*>* list = new List<AstNode*>(0); | 39 List<AstNode*>* list = new List<AstNode*>(0); |
40 CHECK_EQ(0, list->length()); | 40 CHECK_EQ(0, list->length()); |
41 | 41 |
42 ZoneScope zone_scope(DELETE_ON_EXIT); | 42 ZoneScope zone_scope(Isolate::Current(), DELETE_ON_EXIT); |
43 AstNode* node = new EmptyStatement(); | 43 AstNode* node = new EmptyStatement(); |
44 list->Add(node); | 44 list->Add(node); |
45 CHECK_EQ(1, list->length()); | 45 CHECK_EQ(1, list->length()); |
46 CHECK_EQ(node, list->at(0)); | 46 CHECK_EQ(node, list->at(0)); |
47 CHECK_EQ(node, list->last()); | 47 CHECK_EQ(node, list->last()); |
48 | 48 |
49 const int kElements = 100; | 49 const int kElements = 100; |
50 for (int i = 0; i < kElements; i++) { | 50 for (int i = 0; i < kElements; i++) { |
51 list->Add(node); | 51 list->Add(node); |
52 } | 52 } |
53 CHECK_EQ(1 + kElements, list->length()); | 53 CHECK_EQ(1 + kElements, list->length()); |
54 | 54 |
55 list->Clear(); | 55 list->Clear(); |
56 CHECK_EQ(0, list->length()); | 56 CHECK_EQ(0, list->length()); |
57 delete list; | 57 delete list; |
58 } | 58 } |
59 | 59 |
60 | 60 |
61 TEST(DeleteEmpty) { | 61 TEST(DeleteEmpty) { |
62 { | 62 { |
63 List<int>* list = new List<int>(0); | 63 List<int>* list = new List<int>(0); |
64 delete list; | 64 delete list; |
65 } | 65 } |
66 { | 66 { |
67 List<int> list(0); | 67 List<int> list(0); |
68 } | 68 } |
69 } | 69 } |
OLD | NEW |