Hi,
So far as I know, the associative array has better performance in searching items than SV queue.
But in practice the improvement seems not as significant as expected when the index keep growing. E.g, my ENV implemented dummy memory as associative array, where the address is taken as the index_type and the corresponding byte as data_type.
I am wondering if there's any mechanism in Cadence SV to dynamically update the internal hash table to save time on looking up the array item as the array grows bigger and bigger?