C++ std::copy_if with std::list

C++ std::copy_if with std::list

This C++ article is about the copy_if() algorithm function with std::vector container.
It is an STL algorithm in <algorithm> header file. It copies by checking a condition.
copy_if() has one definition:
template <class InputIterator, class OutputIterator, class UnaryPredicate>
OutputIterator copy_if (InputIterator first, InputIterator last,
OutputIterator result, UnaryPredicate pred);

Return type : returns an integer, i.e the frequency of the element(val) which satisfies the predicate conditions.

Working: The copy_if( ) function takes 4 parameters, two iterators 'first' & 'last' , result , and pred.
Input iterators to the initial and final positions in a sequence. The range copied is [first,last), which contains                       all the elements between first and last, including the element pointed by first but not the element pointed by last.

Output iterator to the initial position of the range where the resulting sequence is stored. The range includes as                           many elements as [first,last)Unary function that accepts an element in the range as argument, and
returns a value convertible to bool. The value returned indicates whether the element is to be copied
(if true, it is copied). The function shall not modify any of its arguments.This can either be a
function pointer or a function object.


#include <iostream> 
#include <algorithm> #include <list> using namespace std; bool predicate(int n) { return (n % 3 == 0); } int main(){ list<int> lis{1,2,3,4,5,6,7,8,9,10}; list<int> lis_size (lis.size());

  // copy only multiple of three
auto it = std::copy_if (lis.begin(), lis.end(), lis_size.begin(), predicate); lis_size.resize(std::distance(lis_size.begin(),it)); // shrink container to new size std::cout << "Element contains:"; for (int& x: lis_size) std::cout << ' ' << x; std::cout << '\n'; return 0; }

Element contains: 3 6 9

More Articles of Mandeep Sheoran:

Name Views Likes
C++ program to insert an element into binary tree 6240 19
C++ program to find an element into binary tree 772 16
C++ std::is_void 573 15
C++ program to find the closest element in binary search tree 916 19
C++ program to replace every element with the least greater element on its right 574 12
C++ program to delete an element into binary tree 785 24
C++ program to find maximum element between two nodes of binary search tree 700 20
C++ std::remove_copy_if with std::vectors 548 11
C++ program to print duplicate elements from the binary search tree 2937 15
C++ program to find depth of the deepest odd level node in binary tree 575 23
C++ program to remove duplicate elements from the binary search tree 1555 20
C++ std::rotate_copy with std::vector 530 14
C++ std::copy_n with std::vector 638 22
C++ std::copy_if with std::vector 1552 18
C++ program to print all the elements of binary search tree 7107 22
C++ std::reverse_copy with std::list 599 18
C++ program to print all the elements of binary tree 1158 18
C++ program to print all full nodes in a binary tree 573 25
C++ program to find sink odd nodes in binary tree 580 15
C++ std::is_copy_assignable 596 22
C++ program to check whether a binary tree is a full binary tree or not using recursion 609 19
C++ std::is_copy_constructible 618 27
C++ program to delete an element into binary search tree 2873 18
C++ std::reverse_copy with std::vector 488 18
C++ std::rotate with std::vector 641 15
C++ program to check for symmetric binary tree using recursion 599 25
C++ program to maximum sum from a tree with adjacent levels not allowed 552 15
C++ std::copy_n with std::list 595 21
C++ program to check if two trees are identical using recursion 546 15
C++ std::copy_n 874 21
C++ std::copy_if with std::list 999 19
C++ program to print the nodes at odd levels of a tree 562 13
C++ program to find lowest common ancestor in a binary tree 690 29
C++ program to find depth of the deepest odd level leaf node 494 13
C++ std::remove_copy_if with std::list 667 20
C++ program to add all greater values to every node in a given binary search tree 638 15