On Sun, 2008-10-12 at 20:58 -0400, der Mouse wrote: > > I am interested in your examples though.. > > Here's a really simple example which does a recursive tree walk, > throwing out to the top level if a node with a particular property is > found. Obviously, there are lots of ways to do this particular task; > this technique is most useful when the tree walk is more complicated > than this (and possibly off in another file, or part of a library > package, or some such).
I forgot to say at the time, thank you for posting those examples. It is always nice to keep up with what is possible with the tools, and keeps me learning. Best wishes, -- Peter Clifton Electrical Engineering Division, Engineering Department, University of Cambridge, 9, JJ Thomson Avenue, Cambridge CB3 0FA Tel: +44 (0)7729 980173 - (No signal in the lab!) _______________________________________________ geda-dev mailing list [email protected] http://www.seul.org/cgi-bin/mailman/listinfo/geda-dev
