stampe@uhccux.uhcc.hawaii.edu (David Stampe) (10/26/88)
I want a single function for Info to traverse all nodes linearly, i.e. depth-first. I'd like it to do Info-first-menu-item (`1'), and if that fails, do Info-next (`n'), and if that fails, do Info-up (`u'). This seems to require using catch and throw, but from the description in the Emacs Lisp Manual (1st ed.), similar to that in Steele's Manual, I can't see how to apply them here. Can someone help me? I have my reasons for not using (if (search-forward "\n* menu:" nil t) (code-for-finding-first-menu-item) (code-for-finding-next-node) etc.) but they wouldn't be of general interest quite yet. Thanks. David (stampe@uhccux.uhcc.hawaii.edu)