Nevermind the hoist/de-hoist I've got it under control! :) works great with this:
def getChildren(self, p_ap): '''EMIT OUT list of children of a node''' if p_ap: w_p = self.ap_to_p(p_ap) if w_p and w_p.hasChildren(): return self.outputPNodes(w_p.children()) else: return self.outputPNodes([]) # default empty array else: if self.commander.hoistStack: return self.outputPNodes([self.commander.hoistStack[-1].p]) else: return self.outputPNodes(self.yieldAllRootChildren()) # this outputs all Root Children I'll push this and all the new keyboard tree-navigation stuff after breakfast tomorrow :) -- Félix On Monday, July 6, 2020 at 8:10:44 PM UTC-4, Félix wrote: > > Just thought I'd add a little thing: > > If anyone who knows Leo's codebase wants to help with leoInteg, a nice > little thing would be to go through the issues at your leisure, and comment > if it rings a bell in relation to a 'helper function' in Leo that might do > something in particular to accomplish what the feature/enhancement the > issue itself is about. > > Thanks! :) > > -- > Félix > > On Monday, July 6, 2020 at 6:53:25 PM UTC-4, Félix wrote: >> >> Hi Edward, >> >> Another little question here, while trying to find a way to implement >> hoist/dehoist: >> >> Would checking if hoistStack has lenght (is thruty), and using its top >> entry's "p" as a target (to return its children list) instead of the root >> node of the tree work? >> >> I think so but I Just wanted to know if something else would popup in >> your head as a better solution... Thanks ! >> -- >> Félix >> > -- You received this message because you are subscribed to the Google Groups "leo-editor" group. To unsubscribe from this group and stop receiving emails from it, send an email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/leo-editor/32df3d44-01c2-4ebf-8ddd-8d3ad24f73a4o%40googlegroups.com.
