Search icon CANCEL
Subscription
0
Cart icon
Your Cart (0 item)
Close icon
You have no products in your basket yet
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Modern C++: Efficient and Scalable Application Development

You're reading from   Modern C++: Efficient and Scalable Application Development Leverage the modern features of C++ to overcome difficulties in various stages of application development

Arrow left icon
Product type Course
Published in Dec 2018
Publisher
ISBN-13 9781789951738
Length 702 pages
Edition 1st Edition
Languages
Arrow right icon
Authors (2):
Arrow left icon
Marius Bancila Marius Bancila
Author Profile Icon Marius Bancila
Marius Bancila
Richard Grimes Richard Grimes
Author Profile Icon Richard Grimes
Richard Grimes
Arrow right icon
View More author details
Toc

Table of Contents (24) Chapters Close

Title Page
Copyright
About Packt
Contributors
Preface
1. Understanding Language Features FREE CHAPTER 2. Working with Memory, Arrays, and Pointers 3. Using Functions 4. Classes 5. Using the Standard Library Containers 6. Using Strings 7. Diagnostics and Debugging 8. Learning Modern Core Language Features 9. Working with Numbers and Strings 10. Exploring Functions 11. Standard Library Containers, Algorithms, and Iterators 12. Math Problems 13. Language Features 14. Strings and Regular Expressions 15. Streams and Filesystems 16. Date and Time 17. Algorithms and Data Structures 1. Other Books You May Enjoy Index

Writing your own random access iterator


In Chapter 8Learning Modern Core Language Features, we saw how we can enable range-based for loops for custom types by implementing iterators and free begin() and end() functions to return iterators to the first and one-past-the-last element of the custom range. You might have noticed that the minimal iterator implementation that we provided in that recipe does not meet the requirements for a standard iterator because it cannot be copy constructible or assigned and cannot be incremented. In this recipe, we will build upon that example and show how to create a random access iterator that meets all requirements.

Getting ready

For this recipe, you should know the types of iterators the standard defines and how they are different. A good overview of their requirements is available at http://www.cplusplus.com/reference/iterator/.

To exemplify how to write a random access iterator, we will consider a variant of the dummy_array class used in the Enabling range...

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 $19.99/month. Cancel anytime
Banner background image