LearningTransformsv1

A FIFO queue preserves arrival order

The earliest accepted item is removed first.

Output

Items leave in the order A, B, C

Input

Items A, B and C entering an empty queue in that order

Input

Items A, B and C entering an empty queue in that order

Items leave in the order A, B, C

Relationship

Each item joins at the back. Removal always occurs at the front.

xlinux.nist.gov: A FIFO queue preserves arrival orderxlinux.nist.govUS-PUBLIC-DOMAIN