Chapter 7. Jumping the Queue
"A list is only as strong as its weakest link." | ||
| -- Donald Knuth | ||
"There are two ways of constructing a software design. One way is to make it so simple that there are obviously no deficiencies. And the other way is to make it so complicated that there are no obvious deficiencies." | ||
| -- C.A.R. Hoare | ||
In this chapter, we will discuss a custom functional implementation of a queue. We will then introduce the FSharpX open source collection of functional data structures. Finally, we will explore the F# agent MailboxProcessor for creating async work flows, throttling, and post-processing the results of asynchronous calls as an example usage of a queue.
In this chapter, we will cover the following topics:
- Queue data structure, ...
Get Learning F# Functional Data Structures and Algorithms now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
