@@ -303,6 +303,27 @@ impl Tree {
303303 // For now that's okay though, since it's unlikely you'll be able to open a large enough
304304 // number of splits to notice.
305305
306+ // current = focus
307+ // let found = loop do {
308+ // node = focus.parent;
309+ // let found = node.next_sibling_of(current)
310+ // if some {
311+ // break found;
312+ // }
313+ // // else
314+ // if node == root {
315+ // return first child of root;
316+ // };
317+ // current = parent;
318+ // }
319+ // }
320+ //
321+ // use found next sibling
322+ // loop do {
323+ // if found = view -> focus = found, return
324+ // if found = container -> found = first child
325+ // }
326+
306327 let iter = self.traverse();
307328
308329 let mut iter = iter.skip_while(|&(key, _view)| key != self.focus);