Lines Matching refs:list
25 static void check_list(const SkTInternalLList<ListElement>& list,
32 REPORTER_ASSERT(reporter, empty == list.isEmpty());
34 list.validate();
35 REPORTER_ASSERT(reporter, numElements == list.countEntries());
36 REPORTER_ASSERT(reporter, in0 == list.isInList(&elements[0]));
37 REPORTER_ASSERT(reporter, in1 == list.isInList(&elements[1]));
38 REPORTER_ASSERT(reporter, in2 == list.isInList(&elements[2]));
39 REPORTER_ASSERT(reporter, in3 == list.isInList(&elements[3]));
44 SkTInternalLList<ListElement> list;
52 // list should be empty to start with
53 check_list(list, reporter, true, 0, false, false, false, false, elements);
55 list.addToHead(&elements[0]);
57 check_list(list, reporter, false, 1, true, false, false, false, elements);
59 list.addToHead(&elements[1]);
60 list.addToHead(&elements[2]);
61 list.addToHead(&elements[3]);
63 check_list(list, reporter, false, 4, true, true, true, true, elements);
69 ListElement* cur = iter.init(list, Iter::kHead_IterStart);
74 cur = iter.init(list, Iter::kTail_IterStart);
80 list.remove(&elements[1]);
81 list.remove(&elements[3]);
82 list.remove(&elements[0]);
84 check_list(list, reporter, false, 1, false, false, true, false, elements);
87 list.remove(&elements[2]);
89 // list should be empty again
90 check_list(list, reporter, true, 0, false, false, false, false, elements);
92 // test out methods that add to the middle of the list.
93 list.addAfter(&elements[1], nullptr);
94 check_list(list, reporter, false, 1, false, true, false, false, elements);
96 list.remove(&elements[1]);
98 list.addBefore(&elements[1], nullptr);
99 check_list(list, reporter, false, 1, false, true, false, false, elements);
101 list.addBefore(&elements[0], &elements[1]);
102 check_list(list, reporter, false, 2, true, true, false, false, elements);
104 list.addAfter(&elements[3], &elements[1]);
105 check_list(list, reporter, false, 3, true, true, false, true, elements);
107 list.addBefore(&elements[2], &elements[3]);
108 check_list(list, reporter, false, 4, true, true, true, true, elements);
110 cur = iter.init(list, Iter::kHead_IterStart);
114 while (!list.isEmpty()) {
115 list.remove(list.tail());