>From: "Jonathan Bromley" <jonathan.bromley@doulos.com> >However, a queue has the property, not shared with a >dynamic array, that it may be resized merely by being >the target of an assignment. I believe this is the >only property of queues that is not shared with >dynamic arrays. What about the ability to extend the size of the queue by assigning to an element just beyond the current end of the queue? That is a related but different property. >The simplicity of the queue expression syntax could >be rescued, and the rigour of assignment patterns >preserved, if we could introduce an additional notation >into assignment patterns: an "array explode" operation >that would act, within an assignment pattern and only >within an assignment pattern, as if it were replaced by >a comma-separated list of the array's elements. Only one >dimension of an array could be thus exploded. I agree that this is probably the best approach. > I'm tempted >to use inside-out curly brackets for that, on the grounds >that it's almost exactly the inverse of concatenation... > >// append one int to a queue of ints > >Q = '{ }Q{ , 7 }; > >but it's so ugly that I give up and leave it to someone >else to invent the right syntax. I don't know if there are any characters left unused in Verilog :-) And you want something concise. Steven Sharp sharp@cadence.comReceived on Tue May 30 16:19:41 2006
This archive was generated by hypermail 2.1.8 : Tue May 30 2006 - 16:19:51 PDT