queue
Differences
This shows you the differences between two versions of the page.
| queue [June 11, 2026 at 09:43] – created - external edit 127.0.0.1 | queue [June 11, 2026 at 10:10] (current) – Ivan Janevski | ||
|---|---|---|---|
| Line 1: | Line 1: | ||
| # Queue | # Queue | ||
| - | A **queue** is a first-in, first-out (FIFO) sequence. Elements are added at the back (enqueue) and removed from the front (dequeue). A queue can be implemented over a [[linked-list]] with a head and tail pointer, over a [[circular-buffer]] for a bounded version, or as a [[lock-free-queue|lock-free queue]] for concurrent use. | + | A **queue** is a first-in, first-out (FIFO) sequence. |
| + | |||
| + | Elements are added at the back (enqueue) and removed from the front (dequeue). A queue can be implemented over a [[linked-list]] with a head and tail pointer, over a [[circular-buffer]] for a bounded version, or as a [[lock-free-queue|lock-free queue]] for concurrent use. | ||
| ```c | ```c | ||
queue.txt · Last modified: by Ivan Janevski