OLD | NEW |
1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 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 24 matching lines...) Expand all Loading... |
35 using namespace v8::internal; | 35 using namespace v8::internal; |
36 | 36 |
37 TEST(List) { | 37 TEST(List) { |
38 List<AstNode*>* list = new List<AstNode*>(0); | 38 List<AstNode*>* list = new List<AstNode*>(0); |
39 CHECK_EQ(0, list->length()); | 39 CHECK_EQ(0, list->length()); |
40 | 40 |
41 v8::base::AccountingAllocator allocator; | 41 v8::base::AccountingAllocator allocator; |
42 Zone zone(&allocator); | 42 Zone zone(&allocator); |
43 AstValueFactory value_factory(&zone, 0); | 43 AstValueFactory value_factory(&zone, 0); |
44 AstNodeFactory factory(&value_factory); | 44 AstNodeFactory factory(&value_factory); |
45 AstNode* node = factory.NewEmptyStatement(RelocInfo::kNoPosition); | 45 AstNode* node = factory.NewEmptyStatement(kNoSourcePosition); |
46 list->Add(node); | 46 list->Add(node); |
47 CHECK_EQ(1, list->length()); | 47 CHECK_EQ(1, list->length()); |
48 CHECK_EQ(node, list->at(0)); | 48 CHECK_EQ(node, list->at(0)); |
49 CHECK_EQ(node, list->last()); | 49 CHECK_EQ(node, list->last()); |
50 | 50 |
51 const int kElements = 100; | 51 const int kElements = 100; |
52 for (int i = 0; i < kElements; i++) { | 52 for (int i = 0; i < kElements; i++) { |
53 list->Add(node); | 53 list->Add(node); |
54 } | 54 } |
55 CHECK_EQ(1 + kElements, list->length()); | 55 CHECK_EQ(1 + kElements, list->length()); |
56 | 56 |
57 list->Clear(); | 57 list->Clear(); |
58 CHECK_EQ(0, list->length()); | 58 CHECK_EQ(0, list->length()); |
59 delete list; | 59 delete list; |
60 } | 60 } |
OLD | NEW |