Lines Matching full:list
7 // notice, this list of conditions and the following disclaimer.
9 // copyright notice, this list of conditions and the following
37 TEST(List) {
38 List<AstNode*>* list = new List<AstNode*>(0);
39 CHECK_EQ(0, list->length());
43 list->Add(node);
44 CHECK_EQ(1, list->length());
45 CHECK_EQ(node, list->at(0));
46 CHECK_EQ(node, list->last());
50 list->Add(node);
52 CHECK_EQ(1 + kElements, list->length());
54 list->Clear();
55 CHECK_EQ(0, list->length());
56 delete list;
61 List<int> list(4);
62 CHECK_EQ(0, list.length());
63 list.Add(1);
64 CHECK_EQ(1, list.length());
65 CHECK_EQ(1, list.last());
66 list.RemoveLast();
67 CHECK_EQ(0, list.length());
68 list.Add(2);
69 list.Add(3);
70 CHECK_EQ(2, list.length());
71 CHECK_EQ(3, list.last());
72 list.RemoveLast();
73 CHECK_EQ(1, list.length());
74 CHECK_EQ(2, list.last());
75 list.RemoveLast();
76 CHECK_EQ(0, list.length());
79 for (int i = 0; i < kElements; i++) list.Add(i);
81 CHECK_EQ(j + 1, list.length());
82 CHECK_EQ(j, list.last());
83 list.RemoveLast();
84 CHECK_EQ(j, list.length());
91 List<int>* list = new List<int>(0);
92 delete list;
95 List<int> list(0);
