|
danderson@11
|
1 |
// vim: set sts=8 ts=2 sw=2 tw=99 et: |
|
danderson@11
|
2 |
// |
|
danderson@11
|
3 |
// Copyright (C) 2013, David Anderson and AlliedModders LLC |
|
danderson@11
|
4 |
// All rights reserved. |
|
danderson@11
|
5 |
// |
|
danderson@11
|
6 |
// Redistribution and use in source and binary forms, with or without |
|
danderson@11
|
7 |
// modification, are permitted provided that the following conditions are met: |
|
danderson@11
|
8 |
// |
|
danderson@11
|
9 |
// * Redistributions of source code must retain the above copyright notice, this |
|
danderson@11
|
10 |
// list of conditions and the following disclaimer. |
|
danderson@11
|
11 |
// * Redistributions in binary form must reproduce the above copyright notice, |
|
danderson@11
|
12 |
// this list of conditions and the following disclaimer in the documentation |
|
danderson@11
|
13 |
// and/or other materials provided with the distribution. |
|
danderson@11
|
14 |
// * Neither the name of AlliedModders LLC nor the names of its contributors |
|
danderson@11
|
15 |
// may be used to endorse or promote products derived from this software |
|
danderson@11
|
16 |
// without specific prior written permission. |
|
danderson@11
|
17 |
// |
|
danderson@11
|
18 |
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
|
danderson@11
|
19 |
// AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
|
danderson@11
|
20 |
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
|
danderson@11
|
21 |
// ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE |
|
danderson@11
|
22 |
// LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
|
danderson@11
|
23 |
// CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
|
danderson@11
|
24 |
// SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
|
danderson@11
|
25 |
// INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
|
danderson@11
|
26 |
// CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
|
danderson@11
|
27 |
// ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
|
danderson@11
|
28 |
// POSSIBILITY OF SUCH DAMAGE. |
|
danderson@11
|
29 |
|
|
danderson@11
|
30 |
#include <am-inlinelist.h> |
|
danderson@11
|
31 |
#include <am-utility.h> |
|
danderson@11
|
32 |
#include "runner.h" |
|
danderson@11
|
33 |
|
|
danderson@11
|
34 |
using namespace ke; |
|
danderson@11
|
35 |
|
|
danderson@11
|
36 |
class IntThing : public InlineListNode<IntThing> |
|
danderson@11
|
37 |
{ |
|
danderson@11
|
38 |
public: |
|
danderson@11
|
39 |
IntThing(int value) |
|
danderson@11
|
40 |
: value_(value) |
|
danderson@11
|
41 |
{ |
|
danderson@11
|
42 |
} |
|
danderson@11
|
43 |
~IntThing() |
|
danderson@11
|
44 |
{ |
|
danderson@11
|
45 |
} |
|
danderson@11
|
46 |
int value() const { |
|
danderson@11
|
47 |
return value_; |
|
danderson@11
|
48 |
} |
|
danderson@11
|
49 |
|
|
danderson@11
|
50 |
private: |
|
danderson@11
|
51 |
int value_; |
|
danderson@11
|
52 |
}; |
|
danderson@11
|
53 |
|
|
danderson@11
|
54 |
class TestInlineList : public Test |
|
danderson@11
|
55 |
{ |
|
danderson@11
|
56 |
public: |
|
danderson@11
|
57 |
TestInlineList() |
|
danderson@11
|
58 |
: Test("InlineList") |
|
danderson@11
|
59 |
{ |
|
danderson@11
|
60 |
} |
|
danderson@11
|
61 |
|
|
danderson@11
|
62 |
bool testBasic() |
|
danderson@11
|
63 |
{ |
|
danderson@11
|
64 |
IntThing thing1(1); |
|
danderson@11
|
65 |
IntThing thing2(2); |
|
danderson@11
|
66 |
IntThing thing3(3); |
|
danderson@11
|
67 |
IntThing thing4(4); |
|
danderson@11
|
68 |
IntThing thing5(5); |
|
danderson@11
|
69 |
|
|
danderson@11
|
70 |
// Do these test twice. InlineList does not take ownership of pointers, |
|
danderson@11
|
71 |
// so we should be guaranteed we can keep moving them in between lists. |
|
danderson@11
|
72 |
for (size_t i = 0; i <= 1; i++) |
|
danderson@11
|
73 |
{ |
|
danderson@11
|
74 |
InlineList<IntThing> list; |
|
danderson@11
|
75 |
|
|
danderson@11
|
76 |
InlineList<IntThing>::iterator iter = list.begin(); |
|
danderson@11
|
77 |
if (!check(iter == list.end(), "list should be empty")) |
|
danderson@11
|
78 |
return false; |
|
danderson@11
|
79 |
|
|
danderson@11
|
80 |
list.append(&thing1); |
|
danderson@11
|
81 |
list.append(&thing2); |
|
danderson@11
|
82 |
list.append(&thing3); |
|
danderson@11
|
83 |
list.append(&thing4); |
|
danderson@11
|
84 |
list.append(&thing5); |
|
danderson@11
|
85 |
|
|
danderson@11
|
86 |
iter = list.begin(); |
|
danderson@11
|
87 |
for (int n = 1; n <= 5; n++) { |
|
danderson@11
|
88 |
if (!check(iter->value() == n, "value %d should be %d", iter->value(), n)) |
|
danderson@11
|
89 |
return false; |
|
danderson@11
|
90 |
iter++; |
|
danderson@11
|
91 |
} |
|
danderson@11
|
92 |
if (!check(iter == list.end(), "iterator should have ended")) |
|
danderson@11
|
93 |
return false; |
|
danderson@11
|
94 |
|
|
danderson@11
|
95 |
list.remove(&thing1); |
|
danderson@11
|
96 |
iter = list.begin(); |
|
danderson@11
|
97 |
if (!check(iter->value() == 2, "list should start at 2 after removal")) |
|
danderson@11
|
98 |
return false; |
|
danderson@11
|
99 |
|
|
danderson@11
|
100 |
list.remove(&thing5); |
|
danderson@11
|
101 |
iter = list.begin(); |
|
danderson@11
|
102 |
iter++; |
|
danderson@11
|
103 |
iter++; |
|
danderson@11
|
104 |
if (!check(iter->value() == 4, "list should end at 4 after removal")) |
|
danderson@11
|
105 |
return false; |
|
danderson@11
|
106 |
iter++; |
|
danderson@11
|
107 |
if (!check(iter == list.end(), "iterator should have ended")) |
|
danderson@11
|
108 |
return false; |
|
danderson@11
|
109 |
|
|
danderson@11
|
110 |
list.remove(&thing3); |
|
danderson@11
|
111 |
iter = list.begin(); |
|
danderson@11
|
112 |
if (!check(iter->value() == 2, "first value should be 2 after removal")) |
|
danderson@11
|
113 |
return false; |
|
danderson@11
|
114 |
iter++; |
|
danderson@11
|
115 |
if (!check(iter->value() == 4, "second value should be 4 after removal")) |
|
danderson@11
|
116 |
return false; |
|
danderson@11
|
117 |
iter++; |
|
danderson@11
|
118 |
if (!check(iter == list.end(), "iterator should have ended")) |
|
danderson@11
|
119 |
return false; |
|
danderson@11
|
120 |
} |
|
danderson@11
|
121 |
|
|
danderson@11
|
122 |
return true; |
|
danderson@11
|
123 |
} |
|
danderson@11
|
124 |
|
|
danderson@11
|
125 |
bool Run() KE_OVERRIDE |
|
danderson@11
|
126 |
{ |
|
danderson@11
|
127 |
if (!testBasic()) |
|
danderson@11
|
128 |
return false; |
|
danderson@11
|
129 |
return true; |
|
danderson@11
|
130 |
} |
|
danderson@11
|
131 |
} sTestInlineList; |
|
danderson@11
|
132 |
|