hi EC, I've uploaded proposal-1702-1.pdf to Mantis. Please review - especially Steven and Françoise, who kindly agreed to keep an eye on what I did :-) Copied to BC because the generalization of array behaviour is on their patch. In reality I think it's just clarification of de-facto behavior, but it's always better to check... I am somewhat troubled that I don't understand how to define clearly the notion - explained previously by Dave Rich and others - that references to a queue element don't go stale when that element is moved around in the queue. I don't see any clear definition in the present LRM, and I don't see exactly how it can be maintained in cases like this: task T(ref int I); #5 ... endtask int Q[$]; initial begin Q = = '{1,2,3,4); fork T(Q[3]); join_none Q = {Q[0:1], Q[3], Q, Q[$]}; // 3 copies of Q[3] end // What does T.I now reference??? Otherwise I'm fairly happy that I've been able to generalize queue expressions in the way I'd hoped. Thanks -- 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 Sun Nov 18 15:19:22 2007
This archive was generated by hypermail 2.1.8 : Sun Nov 18 2007 - 15:20:00 PST