About
A queue is collection:
- that follows by default a first-in, first-out methodology
- where the first element is the first element to be retrieved / removed
- where the concept of first may be defined.
For instance, first may be define as
- the oldest element in the queue (ie real FIFO)
- the youngest element in the queue (ie LIFO)
- the element with the highest priority number (ie Collection - Priority Queue)
- …
If the queue has a fixed size (capacity), adding an element will delete the oldest one.
Articles Related
Theory
wiki/Queueing_theory is the mathematical study of waiting lines
Type
- Collection - Priority Queue where the first is the element with the highest/lowest priority number.