Concurrency in C# Cookbook

Errata for Concurrency in C# Cookbook

Submit your own errata for this product.


The errata list is a list of errors and their corrections that were found after the product was released. If the error was corrected in a later version or reprint the date of the correction will be displayed in the column titled "Date Corrected".

The following errata were submitted by our customers and approved as valid errors by the author or editor.

Color Key: Serious Technical Mistake Minor Technical Mistake Language or formatting error Typo Question Note Update



Version Location Description Submitted By Date Submitted Date Corrected
Printed
Page 5
last paragraph

"artificailly" should be "artificially"

Ed Ball  Nov 19, 2014 
PDF
Page 96
Solution section

Stacks are described as FIFO, and Queues are described as FILO. This is backwards, stacks are FILO and Queues are FIFO.

Note from the Author or Editor:
"Stacks are a first-in, first-out data structure." should read "Stacks are a first-in, last-out data structure." (pg 96) "Queues are similar to stacks, except they are a first-in, last-out data structure." should read "Queues are similar to stacks, except they are a first-in, first-out data structure." (pg 97)

Scott S  May 29, 2014  Oct 31, 2014
Printed, PDF
Page 112
6th paragraph

When describing the BufferBlock<T> the text states: If the queue is completed, then DequeueAsync will throw InvalidOperationException. But DequeueAsync is not a method on BufferBlock<T>, it should be ReceiveAsync (as is printed correctly in the code example below): If the queue is completed, then ReceiveAsync will throw InvalidOperationException.

Note from the Author or Editor:
On page 110, the sentence "If the queue is completed, then DequeueAsync will throw" should read "If the queue is completed, then ReceiveAsync will throw"

David De Geyter  Aug 21, 2014  Oct 31, 2014