<xstd/bits/bit_algorithm/bit_is_sorted.hpp>, <xstd/bits/bit_algorithm/bit_is_partitioned.hpp>

bit_is_sorted, bit_is_partitioned

As ranges::is_sorted in [alg.sorting] and ranges::is_partitioned in [alg.partitions], over identity(), with:

• Constraints: R is a sequence of ours, a window included.
• Returns: For bit_is_sorted, whether no false follows the first true; for bit_is_partitioned, whether no true follows the first false.
• Complexity: O(N/D): two searches, the second from where the first stopped.