bitset::none() is a built-in STL in C++ which returns True if none of its bits are set. It returns False if a minimum of one bit is set.
Parameter: The function accepts no parameter.
Return Value: The function returns a boolean. The boolean value is True if none of its bits are set. It is False if at least one bit is set.
Below programs illustrates the bitset::none() function.
1100 has a minimum of one bit set 000000 has no bits set
100 has a minimum of one bit set 000000 has no bits set
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.
- std::bitset::to_ullong and std::bitset::to_ulong in C++ STL
- bitset any() in C++ STL
- bitset operator in C++ STL
- bitset count() in C++ STL
- bitset all() function in C++ STL
- bitset test() in C++ STL
- bitset set() function in C++ STL
- C++ bitset and its application
- bitset::flip() in C++ STL
- bitset size() in C++ STL
- Subset sum queries using bitset
- bitset reset() function in C++ STL
- C++ bitset interesting facts
- _Find_first() function in C++ bitset with Examples
- _Find_next() function in C++ bitset with Examples
- Count number of set bits in a range using bitset
- Count number of common elements between two arrays by using Bitset and Bitwise operation
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.