1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
|
/*
* Copyright 2012 Google Inc.
*
* Use of this source code is governed by a BSD-style license that can be
* found in the LICENSE file.
*/
#include "Test.h"
#include "SkTDLinkedList.h"
class ListElement {
public:
ListElement(int id) : fID(id) {
}
int fID;
private:
SK_DEFINE_DLINKEDLIST_INTERFACE(ListElement);
};
static void CheckList(const SkTDLinkedList<ListElement>& list,
skiatest::Reporter* reporter,
bool empty,
int numElements,
bool in0, bool in1, bool in2, bool in3,
ListElement elements[4]) {
REPORTER_ASSERT(reporter, empty == list.isEmpty());
#if SK_DEBUG
REPORTER_ASSERT(reporter, numElements == list.countEntries());
REPORTER_ASSERT(reporter, in0 == list.isInList(&elements[0]));
REPORTER_ASSERT(reporter, in1 == list.isInList(&elements[1]));
REPORTER_ASSERT(reporter, in2 == list.isInList(&elements[2]));
REPORTER_ASSERT(reporter, in3 == list.isInList(&elements[3]));
#endif
}
static void TestTDLinkedList(skiatest::Reporter* reporter) {
SkTDLinkedList<ListElement> list;
ListElement elements[4] = {
ListElement(0),
ListElement(1),
ListElement(2),
ListElement(3),
};
// list should be empty to start with
CheckList(list, reporter, true, 0, false, false, false, false, elements);
list.addToHead(&elements[0]);
CheckList(list, reporter, false, 1, true, false, false, false, elements);
list.addToHead(&elements[1]);
list.addToHead(&elements[2]);
list.addToHead(&elements[3]);
CheckList(list, reporter, false, 4, true, true, true, true, elements);
// test out iterators
SkTDLinkedList<ListElement>::Iter iter;
ListElement* cur = iter.init(list, SkTDLinkedList<ListElement>::Iter::kHead_IterStart);
for (int i = 0; NULL != cur; ++i, cur = iter.next()) {
REPORTER_ASSERT(reporter, cur->fID == 3-i);
}
cur = iter.init(list, SkTDLinkedList<ListElement>::Iter::kTail_IterStart);
for (int i = 0; NULL != cur; ++i, cur = iter.prev()) {
REPORTER_ASSERT(reporter, cur->fID == i);
}
// remove middle, frontmost then backmost
list.remove(&elements[1]);
list.remove(&elements[3]);
list.remove(&elements[0]);
CheckList(list, reporter, false, 1, false, false, true, false, elements);
// remove last element
list.remove(&elements[2]);
// list should be empty again
CheckList(list, reporter, true, 0, false, false, false, false, elements);
}
#include "TestClassDef.h"
DEFINE_TESTCLASS("TDLinkedList", TestTDLinkedListClass, TestTDLinkedList)
|
