| ||||
Copyright 1999 Sams Publishing |
|
![]() | |
Chapter 18: First-In-First-Out (FIFO) Queue |
![]() | |
Overview |
![]() | |
The First-In-First-Out (FIFO) queue is a data structure that has many applications in systems development. In this chapter, Ill show you a version of a FIFO queue that supports simultaneous access by multiple threads. In particular, Ill present two versions that are usable in the real world, as they are, and extendable: |
![]() | |||
ObjectFIFO , which holds references to objects |
![]() | |||
ByteFIFO , which holds byte values directly |
| ![]() | ||
Toc |