Book Image

C++20 STL Cookbook

By : Bill Weinman
Book Image

C++20 STL Cookbook

By: Bill Weinman

Overview of this book

Fast, efficient, and flexible, the C++ programming language has come a long way and is used in every area of the industry to solve many problems. The latest version C++20 will see programmers change the way they code as it brings a whole array of features enabling the quick deployment of applications. This book will get you up and running with using the STL in the best way possible. Beginning with new language features in C++20, this book will help you understand the language's mechanics and library features and offer insights into how they work. Unlike other books, the C++20 STL Cookbook takes an implementation-specific, problem-solution approach that will help you overcome hurdles quickly. You'll learn core STL concepts, such as containers, algorithms, utility classes, lambda expressions, iterators, and more, while working on real-world recipes. This book is a reference guide for using the C++ STL with its latest capabilities and exploring the cutting-edge features in functional programming and lambda expressions. By the end of the book C++20 book, you'll be able to leverage the latest C++ features and save time and effort while solving tasks elegantly using the STL.
Table of Contents (13 chapters)

Find items in a container

The algorithm library contains a set of functions for finding elements in a container. The std::find() function, and its derivatives, search sequentially through a container and return an iterator pointing to the first matching element, or the end() element if there's no match.

How to do it…

The find() algorithm works with any container that satisfies the Forward or Input iterator qualifications. For this recipe, we'll use vector containers. The find() algorithm searches sequentially for the first matching element in a container. In this recipe, we'll walk through a few examples:

  • We'll start by declaring a vector of int in the main() function:
    int main() {
        const vector<int> v{ 1, 2, 3, 4, 5, 6, 7, 8, 9, 10 };
  • Now, let's search for the element with the value 7:
    auto it1 = find(v.begin(), v.end(), 7);
    if(it1 != v.end()) cout << format("found...