RE: [sv-ec] bounded queues

>From: "Bresticker, Shalom" <shalom.bresticker@intel.com>

>A bounded queue is still a dynamic data type, it just has a maximum
>size.

In theory, a bounded queue could be implemented statically, and does
not need to be a dynamic data type.

In practice, for tools that support dynamic types, it is a lot easier
to implement a bounded queue as a dynamic queue that has bounded size
than to do a separate implementation as a static type.

Tools that don't support dynamic types (such as current synthesis
tools) can still support bounded queues with a static implementation.

So regarding bounded queues as being theoretically non-dynamic types
may be useful, even if most tools use a dynamic implementation "under
the hood".  You can debate whether that distinction belongs in the LRM,
or should just be pointed out in the documentation of any tools that
don't support dynamic types but do support bounded queues.

Steven Sharp
sharp@cadence.com