In short: To fill an array with values that never repeat, mark the array rand and add one line: constraint c { unique {arr}; }. The solver then gives every element a different value. On an old simulator that doesn’t know unique, use a nested foreach with !=. And if you don’t need the solver…
In short: When you need an array of distinct values in a mixed order but do not need full randomness, you can skip constraints. Fill the array with known distinct values, such as the index itself, then call the built in shuffle() method to rearrange them. The result has no repeats and a random order,…
In short: SystemVerilog has four kinds of unpacked array. A fixed array has a size set when you write the code. A dynamic array gets its size at run time with new[]. An associative array only stores the keys you actually use, which suits sparse data like memory. A queue grows and shrinks at either…
