The any_of_equal() function in C++ boost library is found under the header ‘boost/algorithm/cxx11/any_of.hpp’ which tests if any of the elements of a sequence against the value passed is same. It takes a sequence and a value, and returns true if the any of the elements are same in the sequence to the value passed.
bool any_of_equal ( InputIterator first, InputIterator last, const &value)
bool any_of_equal ( const Range &R, const &value)
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.
- value: It specifies a value which is to be checked against for any the elements of the sequence.
- R: It is the complete sequence.
Return Value: The function returns true if any of the elements of the sequence is equal to value, else it returns false.
Below is the implementation of the above approach:
at least one elements is 1
all elements are not 4
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.
- <strings> library in C++ STL
- <algorithms> library in C++ STL
- <iterator> library in C++ STL
- snprintf() in C library
- SDL library in C/C++ with examples
- <regex> library in C++ STL
- <numeric> library in C++ STL
- boost::split in C++ library
- Any datatype in C++ boost library
- difftime() C library function
- Pattern Searching using C++ library
- Map in C++ Standard Template Library (STL)
- Set in C++ Standard Template Library (STL)
- Advanced C++ with boost library
- The C++ Standard Template Library (STL)
- boost::algorithm::equal() in C++ library
- boost::algorithm::clamp() in C++ library
- boost::algorithm::is_partitioned() in C++ library
- boost::algorithm::none_of() in C++ library
- boost::algorithm::one_of_equal() 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 firstname.lastname@example.org. 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.