- An abstract data type representing a collection of entities that are maintained in a sequence and that can be modified by the addition and removal of entities. By convention, the end of the sequence at which elements are added is called the back, tail, or rear of the queue, and the end at which elements are removed is called the head or front of the queue. The operation of adding an element to the rear of the queue is known as “enqueue,” and the operation of removing an element from the front is known as “dequeue.” Other operations may also be allowed, including a peek or front operation that returns the value of the next element to be dequeued without dequeuing it. The operations of a queue make it a first in, first out (FIFO) data structure. ← Wikipedia
- Related terms: Double-ended queue, Callback queue, First in, first out, SQS
- Previous term: Query language
- Next term: QUIC
- Random term: GIYF (webglossary.info/random 🎲)