Matuura cpp
Download as KEY, PDF0 likes345 views
The document contains code snippets demonstrating the find algorithm template that searches for a value in a range defined by iterators, a range-based for loop to iterate over values in a vector, initializing an iterator to a vector's beginning, using find_if to search for elements matching a predicate, and declaring and initializing a lambda function.
1 of 44
Download to read offline
 -> bool { return x % 2 == 0; });
auto f = [](){};](https://image.slidesharecdn.com/matuura-cpp-111114085220-phpapp02/85/Matuura-cpp-41-320.jpg)
More Related Content
What's hot (20)
Ad
Viewers also liked (8)
Ad
Similar to Matuura cpp (20)
Recently uploaded (20)
Matuura cpp
- 26. template<typename Iterator, typename Tp> Iterator find(Iterator first, Iterator last, const Tp& val) { while (first != last && !(*first == val)) ++first; return first; }
- 27. template<typename Iterator, typename Tp> Iterator find(Iterator first, Iterator last, const Tp& val) { while (first != last && !(*first == val)) ++first; return first; }
- 37. struct X{ X(std::vector<int>&& v){...} };
- 38. struct X{ X(std::vector<int>&& v){...} };
- 39. vector<int> v; for(int value : v) { cout << value << endl; }
- 40. std::vector<int> v; std::vector<int>::iterator it = v.begin(); std::vector<int> v; auto it = v.begin();
- 41. vector<int> v; find_if(v.begin(), v.end(), [](int x) -> bool { return x % 2 == 0; }); auto f = [](){};
- 42. int* p = nullptr;