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 now! discount-offer-chevron-icon
Savings automatically calculated. No voucher code required.
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Conferences
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
The C++ Standard Library

You're reading from   The C++ Standard Library What every professional C++ programmer should know about the C++ standard library.

Arrow left icon
Product type Paperback
Published in Dec 2019
Publisher
ISBN-13 9781838981129
Length 251 pages
Edition 2nd Edition
Languages
Tools
Arrow right icon
Author (1):
Arrow left icon
Rainer Grimm Rainer Grimm
Author Profile Icon Rainer Grimm
Rainer Grimm
Arrow right icon
View More author details
Toc

Table of Contents (19) Chapters Close

Reader Testimonials FREE CHAPTER Introduction 1. The Standard Library 2. Utilities 3. Interface of All Containers 4. Sequential Containers 5. Associative Container 6. Adaptors for Containers 7. Iterators 8. Callable Units 9. Algorithms 10. Numeric 11. Strings 12. String Views 13. Regular Expressions 14. Input and Output Streams 15. Filesystem library 16. Multithreading Index

3. Interface of All Containers

Although the sequential and associative containers of the Standard Template library are two quite different classes of containers, they have a lot in common. For example, the operations, to create or delete a container, to determine its size, to access its elements, to assign or swap are all independent of the type of elements of a container. It is common for the containers that you can define them with an arbitrary size, and each container has an allocator. That’s the reason the size of a container can be adjusted at runtime. The allocator works most of the time in the background. This can be seen for a std::vector. The call std::vector<int> results in a call std::vector<int, std::allocator<int>>. Because of the std::allocator, you can adjust except for std::array the size of all containers dynamically. However, they have yet more in common. You can access the elements of a container quite easily with an iterator.

Having so much...

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