| line |
true |
false |
branch |
|
32
|
0 |
3 |
struct node_t : RefCounted { |
|
33
|
3 |
0 |
node_t(const T& value) : value(value), valid(true), next(nullptr), prev(nullptr) {} |
|
|
3 |
0 |
node_t(const T& value) : value(value), valid(true), next(nullptr), prev(nullptr) {} |
|
44
|
2 |
6 |
while (node && !node->valid) { |
|
|
0 |
2 |
while (node && !node->valid) { |
|
|
0 |
8 |
while (node && !node->valid) { |
|
51
|
2 |
2 |
while (node && !node->valid) { |
|
|
0 |
2 |
while (node && !node->valid) { |
|
|
0 |
4 |
while (node && !node->valid) { |
|
92
|
1 |
0 |
owning_list() : _size(0), first(nullptr), last(nullptr) {} |
|
99
|
15 |
0 |
return iterator(nullptr); |
|
107
|
8 |
0 |
return reverse_iterator(nullptr); |
|
112
|
3 |
0 |
node_sp node = panda::make_shared(std::forward(val)); |
|
113
|
2 |
1 |
if (last) { |
|
115
|
2 |
0 |
last->next = node; |
|
116
|
2 |
0 |
last = node; |
|
118
|
1 |
0 |
first = last = node; |
|
|
1 |
0 |
first = last = node; |
|
169
|
1 |
1 |
if (node->prev) { |
|
174
|
1 |
1 |
if (node->next) { |