On Tue Nov 8 15:44:13 2022 +0000, Connor McAdams wrote:
In `get_sibling_node_for_tree()`, we're not concerned with checking the condition on the sibling, we're only concerned with retrieving it. The sibling returned from `get_sibling_node_for_tree()`, if there is one, gets passed into `traverse_uia_node_tree()` which has its condition checked as it's 'visited'.
I had assumed the function was meant to find the next or previous sibling within the virtual tree. Can you explain what the function is supposed to do, without mentioning `traverse_uia_node_tree`?