| 987 | } |
| 988 | |
| 989 | TreeItem *TreeItem::get_prev() { |
| 990 | if (prev) { |
| 991 | return prev; |
| 992 | } |
| 993 | |
| 994 | if (!parent || parent->first_child == this) { |
| 995 | return nullptr; |
| 996 | } |
| 997 | // This is an edge case. |
| 998 | TreeItem *l_prev = parent->first_child; |
| 999 | while (l_prev && l_prev->next != this) { |
| 1000 | l_prev = l_prev->next; |
| 1001 | } |
| 1002 | |
| 1003 | prev = l_prev; |
| 1004 | |
| 1005 | return prev; |
| 1006 | } |
| 1007 | |
| 1008 | TreeItem *TreeItem::get_parent() const { |
| 1009 | return parent; |
no outgoing calls
no test coverage detected