On Mon, Feb 2, 2009 at 12:04 AM, Jesse Aldridge <[email protected]>wrote:
> > Here is my first attempt at integrating find by elimination with the > standard Leo find: > http://crookedgames.com/find_by_elim.leo Sorry for the delay in responding. This is an interesting idea. Is there an easy way > to temporarily substitute the current set of nodes with another? No. And it would not be a good idea. Any hints on how to go about making this work? My strong suggestion is to *add to* the present tree. Don't even think about killing and resurrecting nodes. Two ideas come to mind: 1. Use the clone-find-all code as a starting point. Rather than doing a single search, you are doing multiple searches. 2. If probably would work just to create a single "parent" node to hold the results of your searches, but you could also consider appending the clones to an @chapter node. Switching to that chapter will then show you only those nodes. But the simpler way is to create the parent node. You can then hoist that node automatically, or allow the user to hoist the node by hand. Edward --~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "leo-editor" group. To post to this group, send email to [email protected] To unsubscribe from this group, send email to [email protected] For more options, visit this group at http://groups.google.com/group/leo-editor?hl=en -~----------~----~----~----~------~----~------~--~---
