Branch Coverage

/usr/local/lib/perl5/site_perl/5.26.1/x86_64-linux/XS/libpanda.x/i/panda/owning_list.h
Criterion Covered Total %
branch 113 352 32.1


line true false branch
29 0 19 struct node_t : Refcnt {
0 6 struct node_t : Refcnt {
0 1 struct node_t : Refcnt {
0 0 struct node_t : Refcnt {
0 4 struct node_t : Refcnt {
0 4 struct node_t : Refcnt {
0 2 struct node_t : Refcnt {
0 0 struct node_t : Refcnt {
30 19 0 node_t(const T& value) : value(value), valid(true), next(nullptr), prev(nullptr) {}
1 0 node_t(const T& value) : value(value), valid(true), next(nullptr), prev(nullptr) {}
2 0 node_t(const T& value) : value(value), valid(true), next(nullptr), prev(nullptr) {}
4 0 node_t(const T& value) : value(value), valid(true), next(nullptr), prev(nullptr) {}
4 0 node_t(const T& value) : value(value), valid(true), next(nullptr), prev(nullptr) {}
6 0 node_t(const T& value) : value(value), valid(true), next(nullptr), prev(nullptr) {}
0 0 node_t(const T& value) : value(value), valid(true), next(nullptr), prev(nullptr) {}
0 0 node_t(const T& value) : value(value), valid(true), next(nullptr), prev(nullptr) {}
41 0 0 while (node && !node->valid) {
0 0 while (node && !node->valid) {
0 0 while (node && !node->valid) {
2 1 while (node && !node->valid) {
0 2 while (node && !node->valid) {
0 3 while (node && !node->valid) {
4 4 while (node && !node->valid) {
0 4 while (node && !node->valid) {
0 8 while (node && !node->valid) {
0 4 while (node && !node->valid) {
0 0 while (node && !node->valid) {
0 4 while (node && !node->valid) {
0 0 while (node && !node->valid) {
0 0 while (node && !node->valid) {
0 0 while (node && !node->valid) {
0 2 while (node && !node->valid) {
0 0 while (node && !node->valid) {
0 2 while (node && !node->valid) {
2 7 while (node && !node->valid) {
0 2 while (node && !node->valid) {
0 9 while (node && !node->valid) {
9 17 while (node && !node->valid) {
0 9 while (node && !node->valid) {
0 26 while (node && !node->valid) {
48 0 0 while (node && !node->valid) {
0 0 while (node && !node->valid) {
0 0 while (node && !node->valid) {
0 0 while (node && !node->valid) {
0 0 while (node && !node->valid) {
0 0 while (node && !node->valid) {
0 0 while (node && !node->valid) {
0 0 while (node && !node->valid) {
0 0 while (node && !node->valid) {
0 0 while (node && !node->valid) {
0 0 while (node && !node->valid) {
0 0 while (node && !node->valid) {
0 0 while (node && !node->valid) {
0 0 while (node && !node->valid) {
0 0 while (node && !node->valid) {
0 0 while (node && !node->valid) {
0 0 while (node && !node->valid) {
0 0 while (node && !node->valid) {
0 0 while (node && !node->valid) {
0 0 while (node && !node->valid) {
0 0 while (node && !node->valid) {
0 0 while (node && !node->valid) {
0 0 while (node && !node->valid) {
0 0 while (node && !node->valid) {
99 1 0 return iterator(nullptr);
6 0 return iterator(nullptr);
13 0 return iterator(nullptr);
13 0 return iterator(nullptr);
1 0 return iterator(nullptr);
4 0 return iterator(nullptr);
21 0 return iterator(nullptr);
49 0 return iterator(nullptr);
112 0 0 node_sp node = new node_t(std::forward(val));
0 0 node_sp node = new node_t(std::forward(val));
0 0 node_sp node = new node_t(std::forward(val));
0 0 node_sp node = new node_t(std::forward(val));
0 0 node_sp node = new node_t(std::forward(val));
0 0 node_sp node = new node_t(std::forward(val));
0 0 node_sp node = new node_t(std::forward(val));
0 0 node_sp node = new node_t(std::forward(val));
2 0 node_sp node = new node_t(std::forward(val));
2 0 node_sp node = new node_t(std::forward(val));
0 0 node_sp node = new node_t(std::forward(val));
0 0 node_sp node = new node_t(std::forward(val));
0 0 node_sp node = new node_t(std::forward(val));
0 0 node_sp node = new node_t(std::forward(val));
0 0 node_sp node = new node_t(std::forward(val));
0 0 node_sp node = new node_t(std::forward(val));
113 0 0 if (last) {
0 0 if (last) {
0 0 if (last) {
0 0 if (last) {
1 1 if (last) {
0 0 if (last) {
0 0 if (last) {
0 0 if (last) {
125 19 0 node_sp node = new node_t(std::forward(val));
19 0 node_sp node = new node_t(std::forward(val));
1 0 node_sp node = new node_t(std::forward(val));
1 0 node_sp node = new node_t(std::forward(val));
2 0 node_sp node = new node_t(std::forward(val));
2 0 node_sp node = new node_t(std::forward(val));
4 0 node_sp node = new node_t(std::forward(val));
4 0 node_sp node = new node_t(std::forward(val));
2 0 node_sp node = new node_t(std::forward(val));
2 0 node_sp node = new node_t(std::forward(val));
6 0 node_sp node = new node_t(std::forward(val));
6 0 node_sp node = new node_t(std::forward(val));
0 0 node_sp node = new node_t(std::forward(val));
0 0 node_sp node = new node_t(std::forward(val));
0 0 node_sp node = new node_t(std::forward(val));
0 0 node_sp node = new node_t(std::forward(val));
126 7 12 if (first) {
0 1 if (first) {
1 1 if (first) {
0 4 if (first) {
1 1 if (first) {
1 5 if (first) {
0 0 if (first) {
0 0 if (first) {
154 1 0 for (auto iter = begin(); iter != end(); ++iter) {
1 0 for (auto iter = begin(); iter != end(); ++iter) {
1 0 for (auto iter = begin(); iter != end(); ++iter) {
0 1 for (auto iter = begin(); iter != end(); ++iter) {
0 0 for (auto iter = begin(); iter != end(); ++iter) {
2 0 for (auto iter = begin(); iter != end(); ++iter) {
4 0 for (auto iter = begin(); iter != end(); ++iter) {
4 0 for (auto iter = begin(); iter != end(); ++iter) {
2 2 for (auto iter = begin(); iter != end(); ++iter) {
2 0 for (auto iter = begin(); iter != end(); ++iter) {
3 0 for (auto iter = begin(); iter != end(); ++iter) {
7 0 for (auto iter = begin(); iter != end(); ++iter) {
7 0 for (auto iter = begin(); iter != end(); ++iter) {
4 3 for (auto iter = begin(); iter != end(); ++iter) {
4 0 for (auto iter = begin(); iter != end(); ++iter) {
5 0 for (auto iter = begin(); iter != end(); ++iter) {
9 0 for (auto iter = begin(); iter != end(); ++iter) {
9 0 for (auto iter = begin(); iter != end(); ++iter) {
4 5 for (auto iter = begin(); iter != end(); ++iter) {
4 0 for (auto iter = begin(); iter != end(); ++iter) {
1 0 for (auto iter = begin(); iter != end(); ++iter) {
1 0 for (auto iter = begin(); iter != end(); ++iter) {
1 0 for (auto iter = begin(); iter != end(); ++iter) {
0 1 for (auto iter = begin(); iter != end(); ++iter) {
0 0 for (auto iter = begin(); iter != end(); ++iter) {
1 0 for (auto iter = begin(); iter != end(); ++iter) {
2 0 for (auto iter = begin(); iter != end(); ++iter) {
2 0 for (auto iter = begin(); iter != end(); ++iter) {
1 1 for (auto iter = begin(); iter != end(); ++iter) {
1 0 for (auto iter = begin(); iter != end(); ++iter) {
6 0 for (auto iter = begin(); iter != end(); ++iter) {
12 0 for (auto iter = begin(); iter != end(); ++iter) {
12 0 for (auto iter = begin(); iter != end(); ++iter) {
6 6 for (auto iter = begin(); iter != end(); ++iter) {
6 0 for (auto iter = begin(); iter != end(); ++iter) {
11 0 for (auto iter = begin(); iter != end(); ++iter) {
26 0 for (auto iter = begin(); iter != end(); ++iter) {
26 0 for (auto iter = begin(); iter != end(); ++iter) {
15 11 for (auto iter = begin(); iter != end(); ++iter) {
15 0 for (auto iter = begin(); iter != end(); ++iter) {
179 2 2 if (node->prev) {
0 0 if (node->prev) {
0 0 if (node->prev) {
0 0 if (node->prev) {
0 0 if (node->prev) {
0 0 if (node->prev) {
0 0 if (node->prev) {
0 0 if (node->prev) {
184 0 4 if (node->next) {
0 0 if (node->next) {
0 0 if (node->next) {
0 0 if (node->next) {
0 0 if (node->next) {
0 0 if (node->next) {
0 0 if (node->next) {
0 0 if (node->next) {