On Wed, Dec 25, 2013 at 11:28 AM, Terry Brown <[email protected]>wrote:
> On Wed, 25 Dec 2013 09:59:12 -0600 > "Edward K. Ream" <[email protected]> wrote: > > > It will be *trivial* to make bookmarks almost unbreakable. Let ?--> > denote > > a **searchable link** to a node. > > Interesting thought - so --> and ?--> are like / and // in XPath > > http://www.w3.org/TR/xpath/#path-abbrev > > (Let's not get sidetracked into XPath level path specification ;-) > Haha. Actually, we could probably just generalize g.recursiveUNLSearch so that if an "explicit" search fails (at any level) the search would be broadened using g.findNodeInTree. In other words, it's not the notation that matters much; it's the search algorithm! EKR -- 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 post to this group, send email to [email protected]. Visit this group at http://groups.google.com/group/leo-editor. For more options, visit https://groups.google.com/groups/opt_out.
