On Wed Nov 9 22:59:19 2022 +0000, Connor McAdams wrote:
It takes a passed in node, and does the following:
- Attempt to navigate to the nodes sibling.
- If no sibling is retrieved, and we're not at the root level, navigate
to the parent. 3. Check if the parent is a part of the current virtual tree. If it is, stop and return no sibling. 4. If it's not, loop back to 1. It first attempts to find an actual sibling from the node, and if it doesn't get one, it goes upwards and to the right looking for a sibling. Maybe it would help clear things up if we removed the attempt to navigate to the sibling of the first node passed in, and just started at navigating towards the parent.
That sounds like you're describing the implementation. At a higher level, what is it supposed to do? I need a simple enough answer to keep in my head, so that I can verify that it's correct in isolation, and that it's being used correctly.