1 // Copyright 2012 the V8 project authors. All rights reserved.
2 // Redistribution and use in source and binary forms, with or without
3 // modification, are permitted provided that the following conditions are
4 // met:
5 //
6 // * Redistributions of source code must retain the above copyright
7 // notice, this list of conditions and the following disclaimer.
8 // * Redistributions in binary form must reproduce the above
9 // copyright notice, this list of conditions and the following
10 // disclaimer in the documentation and/or other materials provided
11 // with the distribution.
12 // * Neither the name of Google Inc. nor the names of its
13 // contributors may be used to endorse or promote products derived
14 // from this software without specific prior written permission.
15 //
16 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
17 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
18 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
19 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
20 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
21 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
22 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
26 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27
28 #include <stdlib.h>
29
30 #include "v8.h"
31
32 #include "ast.h"
33 #include "cctest.h"
34
35 using namespace v8::internal;
36
TEST(List)37 TEST(List) {
38 v8::internal::V8::Initialize(NULL);
39 List<AstNode*>* list = new List<AstNode*>(0);
40 CHECK_EQ(0, list->length());
41
42 ZoneScope zone_scope(Isolate::Current(), DELETE_ON_EXIT);
43 AstNodeFactory<AstNullVisitor> factory(Isolate::Current());
44 AstNode* node = factory.NewEmptyStatement();
45 list->Add(node);
46 CHECK_EQ(1, list->length());
47 CHECK_EQ(node, list->at(0));
48 CHECK_EQ(node, list->last());
49
50 const int kElements = 100;
51 for (int i = 0; i < kElements; i++) {
52 list->Add(node);
53 }
54 CHECK_EQ(1 + kElements, list->length());
55
56 list->Clear();
57 CHECK_EQ(0, list->length());
58 delete list;
59 }
60