@@ -303,6 +303,27 @@ impl Tree {
303 // For now that's okay though, since it's unlikely you'll be able to open a large enough
303 // For now that's okay though, since it's unlikely you'll be able to open a large enough
304 // number of splits to notice.
304 // number of splits to notice.
307+ // let found = loop do {
308+ // node = focus.parent;
309+ // let found = node.next_sibling_of(current)
314+ // if node == root {
315+ // return first child of root;
317+ // current = parent;
321+ // use found next sibling
323+ // if found = view -> focus = found, return
324+ // if found = container -> found = first child
306 let iter = self.traverse();
327 let iter = self.traverse();
308 let mut iter = iter.skip_while(|&(key, _view)| key != self.focus);
329 let mut iter = iter.skip_while(|&(key, _view)| key != self.focus);