Overview of this book

Mozilla’s Rust is gaining much attention with amazing features and a powerful library. This book will take you through varied recipes to teach you how to leverage the Standard library to implement efficient solutions. The book begins with a brief look at the basic modules of the Standard library and collections. From here, the recipes will cover packages that support file/directory handling and interaction through parsing. You will learn about packages related to advanced data structures, error handling, and networking. You will also learn to work with futures and experimental nightly features. The book also covers the most relevant external crates in Rust. By the end of the book, you will be proficient at using the Rust Standard library.
Preface
Free Chapter
Learning the Basics
Working with Collections
Handling Files and the Filesystem
Serialization
Handling Errors
Parallelism and Rayon
Working with Futures
Networking
Using Experimental Nightly Features
Other Books You May Enjoy

How it works...

In our little example here, we are going to look at two different uses for an iterator:

• fibonacci(), which returns an infinite range of the Fibonacci sequence
• SquaredVec, which implements a (very) small subset of a Vec with a twist: it squares all items
The Fibonacci sequence is defined as a series of numbers, starting from 0 and 1, where the next number is the sum of the last two. It starts like this: 0, 1, 1, 2, 3, 5, 8, 13, 21, and so on.
The first two are 0 and 1 per definition. The next one is their sum — 0 + 1 = 1. After that comes 1 + 1 = 2. Then 2 + 1 = 3. 3 + 2 = 5. Repeat ad infinitum.

An algorithm can be turned into an iterator by implementing the Iterator trait. This is pretty simple, as it only expects you to provide the type you're iterating over and a single method, next, which fetches the next item. If the iterator doesn't have any items left, it should return None, otherwise Some. Our Fibonacci iterator always returns Some item...