In reply to dave_59:
So Dave, I got that the LRM standardizes the needed behavior of each data type but how this is achieved is left to each simulator implementation.
But we are agreed that if the queue is implemented as a linked list, accessing head and tail takes the same time and is faster than accessing any index in between.
Please confirm my understanding.
Thanks in advance.