The any_of() function in C++ boost library is found under the header ‘boost/algorithm/cxx11/any_of.hpp’ which tests the elements of a sequence and returns true if they any of the elements share the property given. It takes a sequence and a predicate, and returns true if the predicate returns true for any given element in the sequence.
bool any_of ( InputIterator first, InputIterator last, Predicate p )
bool any_of ( const Range &R, Predicate p)
Parameters: The function accepts parameters as described below:
- first: It specifies the input iterators to the initial positions in a sequence.
- second: It specifies the input iterators to the final positions in a sequence.
- p: It specifies a unary predicate function that accepts an element and returns a bool.
- R: It is the complete sequence.
Return Value: The function returns true if the given predicate is true on any of the element of the sequence, else it returns false.
Below is the implementation of the above approach:
at least one element is odd
at least one element is less than 7
Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.
- SDL library in C/C++ with examples
- <numeric> library in C++ STL
- <strings> library in C++ STL
- <regex> library in C++ STL
- snprintf() in C library
- <algorithms> library in C++ STL
- <iterator> library in C++ STL
- Any datatype in C++ boost library
- Pattern Searching using C++ library
- difftime() C library function
- Map in C++ Standard Template Library (STL)
- Set in C++ Standard Template Library (STL)
- Advanced C++ with boost library
- boost::split in C++ library
- The C++ Standard Template Library (STL)
- boost::algorithm::one_of() in C++ library
- C++ Boost String Algorithms Library
- Wide char and library functions in C++
- boost::algorithm::all_of_equal() in C++ library
- boost::algorithm::all_of() in C++ library
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.