Hands-On Concurrency with Rust

Smallcheck iteration

In Chapters 2, Sequential Rust Performance and Testing, Chapters 5, Locks – Mutex, Condvar, Barriers and RWLock, and Chapters 6, Atomics – the Primitives of Synchronization, we've discussed the QuickCheck testing methodology, a structured way of inserting random, type-driven input into a function to search function property failures. Inspired by the work done by Claessen and Hughes in their QuickCheck paper, Runciman, Naylor and Lindblad observed that, in their experience, most failures were on small input and put forward the observation that a library that tested from small output to big first might find failures faster than purely random methods. Their hypothesis was more or less correct, for a certain domain of function, ...