> Upward searches are only for the starting point of a path, > never within them. I'm immensely relieved to hear Steven say that. It had never crossed my mind that it might be otherwise, but some of the recent discussions had caused me to question it. That still leaves the question of whether it's OK to backtrack - having found a candidate starting point for the name search by floating up the hierarchy, are you prepared to try again (continuing to float upwards and then Redo From Start on finding another, ancestor candidate) if the remainder of the name is not a valid downward path from your candidate starting point? Again, I've never been 100% clear about that. -- Jonathan Bromley, Consultant DOULOS - Developing Design Know-how VHDL * Verilog * SystemC * e * Perl * Tcl/Tk * Project Services Doulos Ltd. Church Hatch, 22 Market Place, Ringwood, Hampshire, BH24 1AW, UK Tel: +44 (0)1425 471223 Email: jonathan.bromley@doulos.com Fax: +44 (0)1425 471573 Web: http://www.doulos.com The contents of this message may contain personal views which are not the views of Doulos Ltd., unless specifically stated. -- This message has been scanned for viruses and dangerous content by MailScanner, and is believed to be clean.Received on Tue Sep 25 10:08:34 2007
This archive was generated by hypermail 2.1.8 : Tue Sep 25 2007 - 10:08:41 PDT