I\'m currently using a List as a queue (use lst[0] then lst.removeAt(0)) to hold objects. There\'s about 20 items max at a g
Besides the fact that the Queue class implements a queue and the List class implement a list there is a performance difference.
Every time you remove the first element from List all elements in the queue are copied. With only 20 elements in the queue it may not be noticeable. However, when you dequeue the next element from Queue no such copying is happening and that will always be faster. If the queue is long the difference can be significant.