Peering Inside Using SureStopVerbose
| ||||
| Copyright 1999 Sams Publishing |
| | ||
| | |
| Summary |
| | |
| First-In-First-Out queues that can be simultaneously and safely accessed by multiple threads play a useful role in system development. In this chapter, I showed you two types of FIFO queues: one that holds object references ( ObjectFIFO ) and one that holds byte values ( ByteFIFO ). These implementations conveniently encapsulate the complexity of the wait-notify mechanism to simplify the use of the classes. |
| |  | ||
| Toc | |||
