Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Save more on your purchases! discount-offer-chevron-icon
Savings automatically calculated. No voucher code required.
Arrow left icon
All Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Newsletter Hub
Free Learning
Arrow right icon
timer SALE ENDS IN
0 Days
:
00 Hours
:
00 Minutes
:
00 Seconds
Arrow up icon
GO TO TOP
Hands-On Data Structures and Algorithms with Rust

You're reading from   Hands-On Data Structures and Algorithms with Rust Learn programming techniques to build effective, maintainable, and readable code in Rust 2018

Arrow left icon
Product type Paperback
Published in Jan 2019
Publisher Packt
ISBN-13 9781788995528
Length 316 pages
Edition 1st Edition
Languages
Arrow right icon
Author (1):
Arrow left icon
Claus Matzinger Claus Matzinger
Author Profile Icon Claus Matzinger
Claus Matzinger
Arrow right icon
View More author details
Toc

Table of Contents (15) Chapters Close

Preface 1. Hello Rust! FREE CHAPTER 2. Cargo and Crates 3. Storing Efficiently 4. Lists, Lists, and More Lists 5. Robust Trees 6. Exploring Maps and Sets 7. Collections in Rust 8. Algorithm Evaluation 9. Ordering Things 10. Finding Stuff 11. Random and Combinatorial 12. Algorithms of the Standard Library 13. Assessments 14. Other Books You May Enjoy

Iterator

To recap: an iterator is a pattern to traverse a collection, providing a pointer to each element in the process. This pattern is mentioned in the book Design Patterns, by Erich Gamma, Richard Helm, Ralph Johnson, and John Vlissides (the Gang of Four), in 1994 and can be found in basically every language one way or another.

In Rust, the term pointer to each element gets a new dimension: is it a borrowed or owned item? Can this be mutably borrowed as well?

Using the standard library's Iterator<T> trait makes a lot of sense, since it provides a serious amount of useful functions, which are all based around a single implementation of next().

next() returns an Option<Self::Item>, which is the associated type that has to be declared when implementing the trait—and it can be anything you like!

Therefore, using &MyType, &mut MyType, and MyType can all be implemented separately to achieve the desired functionality. IntoIter<T> is a trait that is specifically...

lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at $15.99/month. Cancel anytime
Banner background image