What is a queue?
A Queue is also a Collection of Objects similar to a Stack. Queues typically order the elements contained within in FIFO order but this is not always the case. Elements that are inserted into a Queue are inserted at the tail end as opposed to a Stack where the elements are pushed into it at the head. Looking at the Queue interface the operations are similar to what a Stack provides. E element() Retrieves, but does not remove, the head of this queue. boolean offer(E o) Inserts the specified element into this queue, if possible. E peek() Retrieves, but does not remove, the head of this queue, returning null if this queue is empty. E poll() Retrieves and removes the head of this queue, or null if this queue is empty. E remove() Retrieves and removes the head of this queue.
A queue is formed when at least one file (with upload privileges) is downloaded. The Interactive Feature’s queue system, which was designed to prevent the accidental overwriting of files, allows only the current file (see FAQ 20) to be uploaded. The first file in a queue is the current file. If this file is released, the next file in the queue becomes the current file. When the current file is uploaded, any remaining files in the queue become inactive (see FAQ 13). Note that a released file is no longer in the queue. Files in a queue are either blue or green. The current file is indicated in blue. The other files in the queue appear in green. Any file in a queue has the potential to be uploaded. For example, if the current (blue) file is released, the next file in the queue becomes the current file and changes color from green to blue. The released file changes from blue to black. If this current file is released, it too changes color from blue to black and the next file in the queue t
