ΒΆtemplate <typename R,
typename Predicate,
typename Val = decltype(*adl_begin(
std::declval<R>()))>
auto partition_point(R&& Range, Predicate P)
-> decltype(adl_begin(Range))
template <typename R,
typename Predicate,
typename Val = decltype(*adl_begin(
std::declval<R>()))>
auto partition_point(R&& Range, Predicate P)
-> decltype(adl_begin(Range))
Description
Binary search for the first iterator in a range where a predicate is false. Requires that C is always true below some limit, and always false above it.
Declared at: llvm/include/llvm/ADT/STLExtras.h:1319
Templates
- R
- Predicate
- Val = decltype(*adl_begin(std::declval<R>()))
Parameters
- R&& Range
- Predicate P