Range-v3 Range algorithms, views, and actions for the Standard Library |

Namespaces | Variables
compare.hpp File Reference

## Namespaces
| concepts
| INTERNAL ONLY.

## Variables
template<typename T , typename Cat >
concept | concepts::detail::compares_as = same_as<ranges::common_comparison_category_t<T, Cat>, Cat>
template<typename T , typename Cat = std::partial_ordering>
concept | concepts::three_way_comparable
template<typename T , typename U , typename Cat = std::partial_ordering>
concept | concepts::three_way_comparable_with

ranges::experimental::shared_closure
Definition: shared.hpp:65
meta::lazy::drop
defer< drop, L, N > drop
Definition: meta.hpp:1637
meta::quote_trait_i
compose< quote< _t >, quote_i< T, C > > quote_trait_i
Turn a trait template C taking literals of type T into an invocable.
Definition: meta.hpp:761
ranges::aux::copy_fn::operator()
constexpr auto operator()(T &&t) const -> detail::decay_t< T >
Definition: copy.hpp:34
generate.hpp
ranges::cycled_view
Definition: range_fwd.hpp:518
ranges::iter_distance_fn::operator()
constexpr iter_difference_t< I > operator()(I first, S last) const
Definition: operations.hpp:283
ranges::lexicographical_compare
bool lexicographical_compare(I0 begin0, S0 end0, I1 begin1, S1 end1, C pred=C{}, P0 proj0=P0{}, P1 proj1=P1{})
function template lexicographical_compare
Definition: lexicographical_compare.hpp:31
swap.hpp
ranges::bitwise_or
Definition: arithmetic.hpp:54
ranges::views::slice_fn
Definition: slice.hpp:291
ranges::views::sample_base_fn::operator()
sample_view< all_t< Rng >, URNG > operator()(Rng &&rng, range_difference_t< Rng > sample_size, URNG &generator=detail::get_random_engine()) const
Definition: sample.hpp:215
algorithm.hpp
ranges::any_cast
meta::if_c< std::is_reference< T >)||copyable< T >, T > any_cast(any &)
Definition: any.hpp:173
ranges::aux::copy_fn
Definition: copy.hpp:30
ranges::contains
constexpr bool contains(Rng &&rng, const T &val, P proj={})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: contains.hpp:48
filter.hpp
ranges::reverse
borrowed_iterator_t< Rng > reverse(Rng &&rng)
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: reverse.hpp:73
join.hpp
ranges::views::common_fn::operator()
common_view< all_t< Rng > > operator()(Rng &&rng) const
Definition: common.hpp:183
equal.hpp
ranges::subrange
Definition: subrange.hpp:137
ranges::identity_adaptor
Definition: all.hpp:89
ranges::iota_fn
Definition: iota.hpp:26
ranges::transform2_view
Definition: transform.hpp:410
ranges::views::set_intersection_base_fn::operator()
set_intersection_view< all_t< Rng1 >, all_t< Rng2 >, C, P1, P2 > operator()(Rng1 &&rng1, Rng2 &&rng2, C pred=C{}, P1 proj1=P1{}, P2 proj2=P2{}) const
Definition: set_algorithm.hpp:391
concepts.hpp
ranges::inserter
constexpr inserter_fn inserter
Definition: insert_iterators.hpp:174
ranges::experimental::shared_closure_base
Definition: shared.hpp:68
bind_back.hpp
ranges::operator-
iter_difference_t< I2 > operator-(common_iterator< I1, S1 > const &x, common_iterator< I2, S2 > const &y)
Definition: common_iterator.hpp:255
identity.hpp
meta::sizeof_
meta::size_t< sizeof(T)> sizeof_
An alias that computes the size of the type T.
Definition: meta.hpp:666
ranges::views::iota_fn
Definition: iota.hpp:456
drop_last.hpp
ranges::compose_fn
Definition: compose.hpp:83
ranges::copy_backward
copy_backward_result< borrowed_iterator_t< Rng >, O > copy_backward(Rng &&rng, O out)
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: copy_backward.hpp:54
ranges::ostream_joiner
Definition: stream_iterators.hpp:78
ranges::views::remove_if_base_fn::operator()
constexpr remove_if_view< all_t< Rng >, Pred > operator()(Rng &&rng, Pred pred) const
Definition: remove_if.hpp:151
ranges::common_iterator
Definition: common_iterator.hpp:53
ranges::crend
constexpr _crend_::fn crend
Definition: access.hpp:690
ranges::sort_heap
borrowed_iterator_t< Rng > sort_heap(Rng &&rng, C pred=C{}, P proj=P{})
Definition: heap_algorithm.hpp:411
meta::_t
typename T::type _t
Type alias for T::type.
Definition: meta.hpp:139
ranges::back_fn
Definition: operations.hpp:89
partition_copy.hpp
ranges::range_tag
Definition: concepts.hpp:204
ranges::views::c_str_fn::operator()
ranges::subrange< Char * > operator()(Char(&sz)[N]) const
Definition: c_str.hpp:65
ranges::actions::unique_fn
Definition: unique.hpp:33
zip.hpp
find_if.hpp
meta::push_back
apply< bind_back< quote< list >, Ts... >, L > push_back
Return a new meta::list by adding the element T to the back of L.
Definition: meta.hpp:1766
meta::lazy::repeat_n
defer< repeat_n, N, T > repeat_n
Definition: meta.hpp:1511
ranges::distance_fn
Definition: operations.hpp:431
ranges::ostream_iterator
Definition: stream_iterators.hpp:30
meta::empty
bool_< 0==size< L >::type::value > empty
An Boolean integral constant wrapper around true if L is an empty type list; false,...
Definition: meta.hpp:1824
ranges::move
move_result< borrowed_iterator_t< Rng >, O > move(Rng &&rng, O out)
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: move.hpp:53
primitives.hpp
scope_exit.hpp
ranges::merge
merge_result< I0, I1, O > merge(I0 begin0, S0 end0, I1 begin1, S1 end1, O out, C pred=C{}, P0 proj0=P0{}, P1 proj1=P1{})
function template merge
Definition: merge.hpp:47
ranges::split_view
split_view(R &&, range_value_t< R >) -> split_view< views::all_t< R >, single_view< range_value_t< R >>>
ranges::views::drop_exactly_fn
Definition: drop_exactly.hpp:162
dangling.hpp
ranges::span
span(Rng &&rng) -> span< detail::element_t< Rng >,(range_cardinality< Rng >::value< cardinality() ? dynamic_extent :static_cast< detail::span_index_t >(range_cardinality< Rng >::value))>
ranges::views::indirect_fn
Definition: indirect.hpp:130
ranges::view_facade< cartesian_product_view< Views... >, detail::cartesian_product_cardinality< Views... >::value >::begin
constexpr auto begin() -> detail::facade_iterator_t< D >
Let d be static_cast<Derived &>(*this). Let b be std::as_const(d).begin_cursor() if that expression i...
Definition: facade.hpp:89
any_of.hpp
meta::bit_and
std::integral_constant< decltype(T::type::value &U::type::value), T::type::value &U::type::value > bit_and
An integral constant wrapper around the result of bitwise-and'ing the two wrapped integers T::type::v...
Definition: meta.hpp:272
ranges::tail_view
Definition: tail.hpp:48
meta::protect
detail::protect_< T > protect
For preventing the evaluation of a nested defered computation in a let or lambda expression.
Definition: meta.hpp:3060
ranges::views::all_fn
Definition: all.hpp:31
ranges::repeat_view
Definition: range_fwd.hpp:618
ranges::mismatch
mismatch_result< borrowed_iterator_t< Rng1 >, borrowed_iterator_t< Rng2 > > mismatch(Rng1 &&rng1, Rng2 &&rng2, C pred=C{}, P1 proj1=P1{}, P2 proj2=P2{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: mismatch.hpp:97
insert_iterators.hpp
ranges::actions::join_fn::operator()
join_action_value_t_< Rng > operator()(Rng &&rng) const
Definition: join.hpp:45
ranges::views::view_closure_base
Definition: view.hpp:94
minmax.hpp
generate.hpp
ranges::view_interface::front
constexpr range_reference_t< D< True > > front()
Access the first element in a range:
Definition: interface.hpp:252
split.hpp
ranges::iter_size_fn
Definition: operations.hpp:339
reference_wrapper.hpp
rotate.hpp
swap.hpp
ranges::partition_copy
partition_copy_result< borrowed_iterator_t< Rng >, O0, O1 > partition_copy(Rng &&rng, O0 o0, O1 o1, C pred, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: partition_copy.hpp:61
ranges::protect_fn
Definition: bind.hpp:95
meta::lazy::and_
defer< and_, Bs... > and_
Definition: meta.hpp:1127
meta::is_valid
detail::is_valid_< T > is_valid
For testing whether a deferred computation will succeed in a let or a lambda.
Definition: meta.hpp:3047
c_str.hpp
delimit.hpp
ranges::yield_if_fn
Definition: for_each.hpp:93
meta::index_sequence
integer_sequence< std::size_t, Is... > index_sequence
A container for a sequence of compile-time integer constants of type std::size_t.
Definition: meta.hpp:433
meta::plus
std::integral_constant< decltype(T::type::value+U::type::value), T::type::value+U::type::value > plus
An integral constant wrapper around the result of adding the two wrapped integers T::type::value and ...
Definition: meta.hpp:195
meta::defer_i
A wrapper that defers the instantiation of a template C with integral constant parameters Is in a lam...
Definition: meta.hpp:640
ranges::actions::reverse_fn
Reversed the source range in-place.
Definition: reverse.hpp:33
ranges::ref_view
Definition: range_fwd.hpp:610
semiregular_box_t< Pred >
ranges::stable_sort
borrowed_iterator_t< Rng > stable_sort(Rng &&rng, C pred=C{}, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: stable_sort.hpp:205
meta::lazy::first
defer< first, Pair > first
Definition: meta.hpp:1856
ranges::at
constexpr at_fn at
Checked indexed range access.
Definition: operations.hpp:60
ranges::convert_to
Definition: arithmetic.hpp:65
const.hpp
ranges::bidirectional_range_tag
Definition: concepts.hpp:211
ranges::views::set_symmetric_difference_base_fn::operator()
set_symmetric_difference_view< all_t< Rng1 >, all_t< Rng2 >, C, P1, P2 > operator()(Rng1 &&rng1, Rng2 &&rng2, C pred=C{}, P1 proj1=P1{}, P2 proj2=P2{}) const
Definition: set_algorithm.hpp:810
ranges::make_pipeable
constexpr make_pipeable_fn make_pipeable
Definition: pipeable.hpp:60
ranges::make_tuple
constexpr make_tuple_fn make_tuple
Definition: tuple_algorithm.hpp:176
type_traits.hpp
unique.hpp
ranges::views::stride_fn
Definition: stride.hpp:320
ranges::view_interface::operator<<
friend auto operator<<(std::ostream &sout, Derived const &rng) -> std::ostream &
Print a range to an ostream.
Definition: interface.hpp:505
ranges::fill
borrowed_iterator_t< Rng > fill(Rng &&rng, V const &val)
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: fill.hpp:43
ranges::copy_if
copy_if_result< borrowed_iterator_t< Rng >, O > copy_if(Rng &&rng, O out, F pred, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: copy_if.hpp:63
ranges::const_view
Definition: range_fwd.hpp:494
iterator.hpp
ranges::views::set_union_base_fn
Definition: set_algorithm.hpp:583
ranges::views::split_when_base_fn::operator()
split_when_view< all_t< Rng >, Fun > operator()(Rng &&rng, Fun fun) const
Definition: split_when.hpp:175
move_backward.hpp
comparisons.hpp
ranges::compare_three_way
Definition: comparisons.hpp:103
ranges::actions::reverse_fn::reverse
constexpr action_closure< reverse_fn > reverse
Definition: reverse.hpp:46
ranges::basic_mixin
Definition: basic_iterator.hpp:38
ranges::tuple_for_each
constexpr tuple_for_each_fn tuple_for_each
Definition: tuple_algorithm.hpp:161
ranges::views::iter_transform_base_fn::operator()
constexpr iter_transform_view< all_t< Rng >, Fun > operator()(Rng &&rng, Fun fun) const
Definition: transform.hpp:429
default_sentinel.hpp
ranges::actions::remove_fn
Definition: remove.hpp:31
ranges::search_n
borrowed_subrange_t< Rng > search_n(Rng &&rng, iter_difference_t< iterator_t< Rng >> cnt, V const &val, C pred=C{}, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: search_n.hpp:165
ranges::views::tokenize_base_fn::operator()
tokenize_view< all_t< Rng >, detail::decay_t< Regex >, int > operator()(Rng &&rng, Regex &&rex, int sub=0, std::regex_constants::match_flag_type flags=std::regex_constants::match_default) const
Definition: tokenize.hpp:107
repeat.hpp
ranges::iter_take_while_view
Definition: range_fwd.hpp:694
ranges::view_interface::derived
constexpr Derived const & derived() const noexcept
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: interface.hpp:132
ranges::views::sample_fn
Definition: sample.hpp:238
ranges::view_base
Definition: range_fwd.hpp:169
for_each.hpp
ranges::views::repeat_fn
Definition: repeat.hpp:98
ranges::indirect
constexpr indirect_fn indirect
Definition: indirect.hpp:90
ranges::next
constexpr next_fn next
Definition: operations.hpp:181
ranges::any_view
A type-erased view.
Definition: any_view.hpp:544
ranges::views::c_str_fn
View a \0-terminated C string (e.g. from a const char*) as a range.
Definition: c_str.hpp:60
meta::lazy::as_list
defer< as_list, Sequence > as_list
Definition: meta.hpp:2414
ranges::views::drop_while_base_fn
Definition: drop_while.hpp:91
action.hpp
erase.hpp
ranges::nullopt_t
Definition: optional.hpp:38
ranges::make_tuple_fn
Definition: tuple_algorithm.hpp:164
Pipeable
meta::at
at_c< L, N::type::value > at
Return the N th element in the meta::list L.
Definition: meta.hpp:1562
ranges::views::all_fn::operator()
constexpr auto operator()(T &&t) const
Definition: all.hpp:63
ranges::back_inserter_fn
Definition: insert_iterators.hpp:64
ranges::actions::transform_fn
Definition: transform.hpp:32
ranges::generate
generate_result< O, F > generate(O first, S last, F fun)
function template generate_n
Definition: generate.hpp:37
ranges::remove_if_view
remove_if_view(Rng &&, Pred) -> remove_if_view< views::all_t< Rng >, Pred >
ranges::lazy_yield_if_fn
Definition: for_each.hpp:105
ranges::zip_with_view
zip_with_view(Fun, Rng &&...) -> zip_with_view< Fun, views::all_t< Rng >... >
ranges::is_sorted
bool is_sorted(Rng &&rng, R rel=R{}, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: is_sorted.hpp:60
meta::lazy::repeat_n_c
defer< repeat_n, meta::size_t< N >, T > repeat_n_c
Definition: meta.hpp:1516
ranges::views::cycle_fn::operator()
cycled_view< all_t< Rng > > operator()(Rng &&rng) const
Definition: cycle.hpp:224
ranges::adjacent_difference_fn
Definition: adjacent_difference.hpp:43
ranges::views::split_base_fn::operator()
constexpr split_view< all_t< Rng >, single_view< range_value_t< Rng > > > operator()(Rng &&rng, range_value_t< Rng > val) const
Definition: split.hpp:571
meta::lazy::count
defer< count, L, T > count
Definition: meta.hpp:2222
ranges::views::partial_sum_base_fn
Definition: partial_sum.hpp:170
ranges::at_fn::operator()
constexpr range_reference_t< Rng > operator()(Rng &&rng, range_difference_t< Rng > n) const
Definition: operations.hpp:40
ranges::views::iota_fn::operator()
iota_view< From > operator()(From value) const
Definition: iota.hpp:460
ranges::distance_fn::operator()
constexpr range_difference_t< Rng > operator()(Rng &&rng) const
Definition: operations.hpp:450
remove.hpp
drop_while.hpp
ranges::delimit_view
Definition: delimit.hpp:34
ranges::transform_view
Definition: range_fwd.hpp:717
reverse.hpp
ranges::tuple_foldl
constexpr tuple_foldl_fn tuple_foldl
Definition: tuple_algorithm.hpp:137
any_view.hpp
concepts::common_reference
Users can specialize this to hook the common_reference_with concept.
Definition: type_traits.hpp:298
ranges::tokenize_view
Definition: range_fwd.hpp:706
ranges::insert_iterator
Definition: insert_iterators.hpp:126
ranges::views::repeat_n_fn
Definition: repeat_n.hpp:106
transform.hpp
ranges::views::linear_distribute_view
Definition: linear_distribute.hpp:33
transform.hpp
meta::lazy::at
defer< at, L, N > at
Definition: meta.hpp:1569
diffmax_t.hpp
meta::lazy::second
defer< second, Pair > second
Definition: meta.hpp:1861
counted.hpp
meta::invoke
typename Fn::template invoke< Args... > invoke
Evaluate the invocable Fn with the arguments Args.
Definition: meta.hpp:508
common.hpp
meta::or_
_t< detail::_or_< Bs... > > or_
Logically OR together all the integral constant-wrapped Boolean parameters, with short-circuiting.
Definition: meta.hpp:1115
meta::lazy::_t
defer< _t, T > _t
Definition: meta.hpp:155
ranges::views::unique_base_fn
Definition: unique.hpp:33
ranges::protect_fn::operator()
protector< uncvref_t< F > > operator()(F &&f) const
Definition: bind.hpp:99
ranges::actions::sort_fn::operator()
constexpr auto operator()(C pred, P proj={}) const
Definition: sort.hpp:37
ranges::views::intersperse_fn
Definition: intersperse.hpp:239
ranges::adjacent_find
I adjacent_find(I first, S last, C pred=C{}, P proj=P{})
function template adjacent_find
Definition: adjacent_find.hpp:37
ranges::take_view::begin
constexpr auto begin()
Definition: take.hpp:107
lower_bound.hpp
ranges::ends_with
constexpr bool ends_with(Rng0 &&rng0, Rng1 &&rng1, C pred=C{}, P0 proj0=P0{}, P1 proj1=P1{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: ends_with.hpp:58
compare.hpp
partial_sort_copy.hpp
ranges::cpp20::empty_view
ranges::empty_view< T > empty_view
Definition: empty.hpp:74
rotate_copy.hpp
remove_copy_if.hpp
counted_iterator.hpp
ranges::take_view::size
constexpr auto size()
Definition: take.hpp:199
ranges::aux::copy
constexpr copy_fn copy
Definition: copy.hpp:53
ranges::views::slice_base_fn::operator()
constexpr auto operator()(Rng &&rng, range_difference_t< Rng > from, range_difference_t< Rng > to) const
Definition: slice.hpp:217
ranges::tuple_transform
constexpr tuple_transform_fn tuple_transform
Definition: tuple_algorithm.hpp:95
all_t< Rng >
ranges::to
auto to() -> detail::to_container_fn< detail::from_range< ContT >>
For initializing a container of the specified type with the elements of an Range.
Definition: conversion.hpp:394
ranges::reference_wrapper
Definition: reference_wrapper.hpp:70
ranges::make_common_tuple
constexpr make_common_tuple_fn make_common_tuple
Definition: common_tuple.hpp:278
linear_distribute.hpp
ranges::operator==
bool operator==(common_iterator< I1, S1 > const &x, common_iterator< I2, S2 > const &y)
Definition: common_iterator.hpp:216
ranges::bind_element
Definition: bind.hpp:51
meta::divides
std::integral_constant< decltype(T::type::value/U::type::value), T::type::value/U::type::value > divides
An integral constant wrapper around the result of dividing the two wrapped integers T::type::value an...
Definition: meta.hpp:216
adjacent_remove_if.hpp
ranges::advance_fn::operator()
constexpr void operator()(I &i, iter_difference_t< I > n) const
Definition: operations.hpp:39
ranges::views::trim_bind_fn::operator()
constexpr auto operator()(Pred &&pred, Proj proj) const
Definition: trim.hpp:133
ranges::insert
auto insert(Cont &&cont, I p, Rng &&rng) -> decltype(detail::insert_impl(static_cast< Cont && >(cont), std::move(p), static_cast< Rng && >(rng), meta::bool_< random_access_reservable< Cont > &&sized_range< Rng >>
Definition: insert.hpp:196
zip_with.hpp
ranges::iota_view
Definition: range_fwd.hpp:563
ranges::actions::remove_if_fn::operator()
constexpr auto operator()(C pred, P proj=P{}) const
Definition: remove_if.hpp:38
ranges::actions::slice_fn::operator()
constexpr auto operator()(detail::from_end_< D > from, end_fn const &to) const
Definition: slice.hpp:71
meta::front
_t< detail::front_< L > > front
Return the first element in meta::list L.
Definition: meta.hpp:1663
meta::not_equal_to
bool_< T::type::value !=U::type::value > not_equal_to
A Boolean integral constant wrapper around the result of comparing T::type::value and U::type::value ...
Definition: meta.hpp:241
take_while.hpp
ranges::transform
binary_transform_result< borrowed_iterator_t< Rng0 >, uncvref_t< I1Ref >, O > transform(Rng0 &&rng0, I1Ref &&begin1, O out, F fun, P0 proj0=P0{}, P1 proj1=P1{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: transform.hpp:132
ranges::views::sliding_base_fn
Definition: sliding.hpp:375
ranges::views::counted_fn
Definition: counted.hpp:89
ranges::views::intersperse_fn::operator()
constexpr auto operator()(T t) const
Definition: intersperse.hpp:245
meta::for_each
constexpr detail::for_each_fn for_each
for_each(L, Fn) calls the Fn for each argument in the L.
Definition: meta.hpp:2328
ranges::any_of
bool any_of(Rng &&rng, F pred, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: any_of.hpp:49
meta::multiplies
std::integral_constant< decltype(T::type::value *U::type::value), T::type::value *U::type::value > multiplies
An integral constant wrapper around the result of multiplying the two wrapped integers T::type::value...
Definition: meta.hpp:209
ranges::views::iter_take_while_base_fn
Definition: take_while.hpp:106
meta::lazy::flip
defer< flip, Fn > flip
Definition: meta.hpp:890
ranges::less_equal
Definition: comparisons.hpp:62
ranges::views::chunk_base_fn::operator()
constexpr chunk_view< all_t< Rng > > operator()(Rng &&rng, range_difference_t< Rng > n) const
Definition: chunk.hpp:437
ranges::common_view::size
auto size()
Definition: common.hpp:103
ranges::replace_copy_if
replace_copy_if_result< borrowed_iterator_t< Rng >, O > replace_copy_if(Rng &&rng, O out, C pred, T const &new_value, P proj={})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: replace_copy_if.hpp:55
meta::is_callable
bool_< is_callable_v< T > > is_callable
An alias for std::true_type if T::invoke exists and names a class template; otherwise,...
Definition: meta.hpp:580
ranges::generate
generate_result< borrowed_iterator_t< Rng >, F > generate(Rng &&rng, F fun)
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: generate.hpp:49
istream.hpp
ranges::cpp20::reverse_view
ranges::reverse_view< Rng > reverse_view
Definition: reverse.hpp:176
common_iterator.hpp
ranges::view_interface::data
constexpr std::add_pointer_t< range_reference_t< D< True > > > data()
Returns a pointer to the block of memory containing the elements of a contiguous range:
Definition: interface.hpp:303
ranges::take_while_view
take_while_view(Rng &&, Fun) -> take_while_view< views::all_t< Rng >, Fun >
ranges::actions::reverse_fn::operator()
Rng operator()(Rng &&rng) const
Definition: reverse.hpp:37
ranges::views::remove_if_base_fn
Given a source range, unary predicate, and optional projection, present a view of the elements that d...
Definition: remove_if.hpp:146
subrange.hpp
ranges::actions::sort_fn::sort
constexpr action_closure< sort_fn > sort
Definition: sort.hpp:55
ranges::views::delimit_base_fn::operator()
constexpr auto operator()(I_ &&begin_, Val value) const -> delimit_view< subrange< I, unreachable_sentinel_t >, Val >
Definition: delimit.hpp:89
meta::strict_and_
and_c< Bs::type::value... > strict_and_
Logically AND together all the integral constant-wrapped Boolean parameters, without short-circuiting...
Definition: meta.hpp:1073
unique.hpp
ranges::copy
constexpr copy_result< borrowed_iterator_t< Rng >, O > copy(Rng &&rng, O out)
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: copy.hpp:53
ranges::views::cpp20_common_fn::operator()
all_t< Rng > operator()(Rng &&rng) const
Definition: common.hpp:164
meta::greater
bool_<(T::type::value > U::type::value)> greater
A Boolean integral constant wrapper around true if T::type::value is greater than U::type::value; fal...
Definition: meta.hpp:247
map.hpp
random.hpp
ranges::common_view
Definition: common.hpp:54
ranges::views::unbounded_fn
Definition: unbounded.hpp:51
lexicographical_compare.hpp
ranges::iter_distance_compare
constexpr iter_distance_compare_fn iter_distance_compare
Definition: operations.hpp:335
ranges::tail_view::size
constexpr auto size()
Definition: tail.hpp:83
ranges::equal_range
borrowed_subrange_t< Rng > equal_range(Rng &&rng, V const &val, C pred=C{}, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: equal_range.hpp:96
ranges::make_compressed_tuple_fn
Definition: compressed_pair.hpp:99
ranges::views::drop_fn
Definition: drop.hpp:168
ranges::istream_view
Definition: range_fwd.hpp:459
ranges::aux::move_fn
Definition: move.hpp:30
ranges::cpp20::view_interface
ranges::view_interface< Derived, ranges::unknown > view_interface
Definition: interface.hpp:538
meta::fold
_t< detail::fold_< L, State, Fn > > fold
Return a new meta::list constructed by doing a left fold of the list L using binary invocable Fn and ...
Definition: meta.hpp:1219
meta::lazy::if_c
if_< bool_< If >, Args... > if_c
Definition: meta.hpp:999
ranges::stride_view::size
constexpr auto size()
Definition: stride.hpp:279
ranges::to
auto to(Rng &&rng) -> ContT< range_value_t< Rng >>
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: conversion.hpp:405
ranges::back_inserter
constexpr back_inserter_fn back_inserter
Definition: insert_iterators.hpp:73
meta::void_
void void_
An alias for void.
Definition: meta.hpp:556
ranges::sized_range_tag
Definition: concepts.hpp:252
ranges::views::partial_sum_fn
Definition: partial_sum.hpp:182
ranges::cache1_view
Definition: cache1.hpp:30
ranges::actions::adjacent_remove_if_fn::operator()
constexpr auto operator()(Pred pred, Proj proj={}) const
Definition: adjacent_remove_if.hpp:36
slice.hpp
view.hpp
transform.hpp
ranges::count_if
iter_difference_t< iterator_t< Rng > > count_if(Rng &&rng, R pred, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: count_if.hpp:50
ranges::operator==
constexpr bool operator==(S const &left, basic_iterator< Cur > const &right)
Definition: basic_iterator.hpp:775
ranges::adaptor_base::read
static iter_reference_t< I > read(I const &it, detail::adaptor_base_current_mem_fn={}) noexcept(noexcept(iter_reference_t< I >(*it)))
Definition: adaptor.hpp:133
ranges::actions::unique_fn::operator()
constexpr auto operator()(C pred, P proj=P{}) const
Definition: unique.hpp:37
memory.hpp
find.hpp
ranges::sized_sentinel_tag
Definition: concepts.hpp:574
bind.hpp
meta::detail::require_constant
Definition: meta_fwd.hpp:71
binary_search.hpp
meta::accumulate
fold< L, State, Fn > accumulate
An alias for meta::fold.
Definition: meta.hpp:1229
ranges::nth_element
borrowed_iterator_t< Rng > nth_element(Rng &&rng, iterator_t< Rng > nth, C pred=C{}, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: nth_element.hpp:301
ranges::merge
merge_result< borrowed_iterator_t< Rng0 >, borrowed_iterator_t< Rng1 >, O > merge(Rng0 &&rng0, Rng1 &&rng1, O out, C pred=C{}, P0 proj0=P0{}, P1 proj1=P1{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: merge.hpp:77
ranges::remove_if
borrowed_iterator_t< Rng > remove_if(Rng &&rng, C pred, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: remove_if.hpp:63
box.hpp
ranges::aux::move_t
meta::if_c< std::is_reference< R >::value, meta::_t< std::remove_reference< R > > &&, detail::decay_t< R > > move_t
Definition: move.hpp:56
ranges::replace
borrowed_iterator_t< Rng > replace(Rng &&rng, T1 const &old_value, T2 const &new_value, P proj={})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: replace.hpp:51
ranges::generate_n_view
Definition: generate_n.hpp:31
move_iterators.hpp
meta::bit_xor
std::integral_constant< decltype(T::type::value ^ U::type::value), T::type::value ^ U::type::value > bit_xor
An integral constant wrapper around the result of bitwise-exclusive-or'ing the two wrapped integers T...
Definition: meta.hpp:286
version.hpp
cycle.hpp
ranges::cartesian_product_view::size
static constexpr std::size_t size() noexcept
Definition: cartesian_product.hpp:406
ranges::experimental::shared_view::size
auto size() const
Definition: shared.hpp:56
ranges::contiguous_iterator_tag
Definition: traits.hpp:42
ranges::actions::stable_sort_fn::operator()
constexpr auto operator()(C pred, P proj=P{}) const
Definition: stable_sort.hpp:37
remove.hpp
ranges::views::generate_fn
Definition: generate.hpp:84
meta::push_front
apply< bind_front< quote< list >, Ts... >, L > push_front
Return a new meta::list by adding the element T to the front of L.
Definition: meta.hpp:1713
ranges::pipeable_access::impl
Definition: pipeable.hpp:66
ranges::views::reverse_fn::operator()
constexpr reverse_view< all_t< Rng > > operator()(Rng &&rng) const
Definition: reverse.hpp:156
ranges::views::keys_fn
Definition: map.hpp:93
ranges::equal_to::operator()
constexpr bool operator()(T &&t, U &&u) const
Definition: comparisons.hpp:30
meta::and_
_t< detail::_and_< Bs... > > and_
Logically AND together all the integral constant-wrapped Boolean parameters, with short-circuiting.
Definition: meta.hpp:1083
ranges::basic_view
Definition: range_fwd.hpp:423
inplace_merge.hpp
ranges::views::cpp20_filter_base_fn
Given a source range and a unary predicate, present a view of the elements that satisfy the predicate...
Definition: filter.hpp:51
ranges::chunk_view
Definition: chunk.hpp:408
concepts.hpp
concepts.hpp
ranges::remove
borrowed_iterator_t< Rng > remove(Rng &&rng, T const &val, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: remove.hpp:64
ranges::equal_to
Definition: comparisons.hpp:26
ranges::indirected
Definition: indirect.hpp:30
meta::defer
A wrapper that defers the instantiation of a template C with type parameters Ts in a lambda or let ex...
Definition: meta.hpp:629
meta::lazy::uncurry
defer< uncurry, Fn > uncurry
Definition: meta.hpp:862
meta::negate
std::integral_constant< decltype(-T::type::value), -T::type::value > negate
An integral constant wrapper around the result of negating the wrapped integer T::type::value.
Definition: meta.hpp:222
unique_copy.hpp
ranges::is_sorted_until
I is_sorted_until(I first, S last, R pred=R{}, P proj=P{})
template function is_sorted_until
Definition: is_sorted_until.hpp:46
remove_copy.hpp
ranges::tail_view
tail_view(Rng &&) -> tail_view< views::all_t< Rng >>
equal_range.hpp
ranges::drop_while_view
drop_while_view(Rng &&, Fun) -> drop_while_view< views::all_t< Rng >, Fun >
ranges::lower_bound
borrowed_iterator_t< Rng > lower_bound(Rng &&rng, V const &val, C pred=C{}, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: lower_bound.hpp:50
ranges::views::replace_fn::operator()
constexpr auto operator()(Val1 old_value, Val2 new_value) const
Definition: replace.hpp:105
ranges::views::drop_last_fn
Definition: drop_last.hpp:355
ranges::lexicographical_compare
bool lexicographical_compare(Rng0 &&rng0, Rng1 &&rng1, C pred=C{}, P0 proj0=P0{}, P1 proj1=P1{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: lexicographical_compare.hpp:52
ranges::views::group_by_base_fn::operator()
constexpr group_by_view< all_t< Rng >, Fun > operator()(Rng &&rng, Fun fun) const
Definition: group_by.hpp:151
min.hpp
meta::lazy::filter
defer< filter, L, Fn > filter
Definition: meta.hpp:2287
ranges::actions::stride_fn
Definition: stride.hpp:31
meta::lazy::transpose
defer< transpose, ListOfLists > transpose
Definition: meta.hpp:2345
ranges::iter_transform2_view
Definition: transform.hpp:181
ranges::set_difference
set_difference_result< borrowed_iterator_t< Rng1 >, O > set_difference(Rng1 &&rng1, Rng2 &&rng2, O out, C pred=C{}, P1 proj1=P1{}, P2 proj2=P2{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: set_algorithm.hpp:243
ranges::operator-
constexpr basic_iterator< Cur >::difference_type operator-(basic_iterator< Cur > const &left, S const &right)
Definition: basic_iterator.hpp:837
ranges::counted_view
Definition: range_fwd.hpp:502
ranges::views::stride_base_fn::operator()
constexpr stride_view< all_t< Rng > > operator()(Rng &&rng, range_difference_t< Rng > step) const
Definition: stride.hpp:313
stride.hpp
ranges::actions::drop_while_fn::operator()
constexpr auto operator()(Fun fun) const
Definition: drop_while.hpp:35
ranges::replace_copy
replace_copy_result< borrowed_iterator_t< Rng >, O > replace_copy(Rng &&rng, O out, T1 const &old_value, T2 const &new_value, P proj={})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: replace_copy.hpp:55
ranges::logical_negate
Definition: not_fn.hpp:30
ranges::views::cpp20_filter_fn
Definition: filter.hpp:65
min_element.hpp
ranges::partial_sort_copy
borrowed_iterator_t< OutRng > partial_sort_copy(InRng &&in_rng, OutRng &&out_rng, C pred=C{}, PI in_proj=PI{}, PO out_proj=PO{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: partial_sort_copy.hpp:63
remove_if.hpp
range_for.hpp
conversion.hpp
ranges::sort_heap
I sort_heap(I first, S last, C pred=C{}, P proj=P{})
Definition: heap_algorithm.hpp:399
ranges::reverse_copy
reverse_copy_result< borrowed_iterator_t< Rng >, O > reverse_copy(Rng &&rng, O out)
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: reverse_copy.hpp:54
group_by.hpp
ranges::ref_view
ref_view(R &) -> ref_view< R >
ranges::fill_n
O fill_n(O first, iter_difference_t< O > n, V const &val)
function template equal
Definition: fill_n.hpp:35
ranges::cpp20::single_view
ranges::single_view< T > single_view
Definition: single.hpp:127
ranges::views::drop_base_fn::operator()
auto operator()(Rng &&rng, range_difference_t< Rng > n) const
Definition: drop.hpp:160
meta::on_
detail::on_< Fns... > on_
Use as on<Fn, Gs...>. Creates an invocable that applies invocable Fn to the result of applying invoca...
Definition: meta.hpp:913
meta::if_
_t< detail::_if_< Args... > > if_
Select one type or another depending on a compile-time Boolean.
Definition: meta.hpp:983
operations.hpp
ranges::views::common_fn
Definition: common.hpp:179
ranges::views::iter_take_while_fn
Definition: take_while.hpp:119
meta::inc
std::integral_constant< decltype(T::type::value+1), T::type::value+1 > inc
An integral constant wrapper around the result of incrementing the wrapped integer T::type::value.
Definition: meta.hpp:183
ranges::views::generate_fn::operator()
generate_view< G > operator()(G g) const
Definition: generate.hpp:93
ranges::next_fn::operator()
constexpr I operator()(I it) const
Definition: operations.hpp:150
ranges::set_symmetric_difference
set_symmetric_difference_result< borrowed_iterator_t< Rng1 >, borrowed_iterator_t< Rng2 >, O > set_symmetric_difference(Rng1 &&rng1, Rng2 &&rng2, O out, C pred=C{}, P1 proj1=P1{}, P2 proj2=P2{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: set_algorithm.hpp:319
ranges::stable_partition
borrowed_iterator_t< Rng > stable_partition(Rng &&rng, C pred, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: stable_partition.hpp:309
ranges::bind_back_fn
Definition: bind_back.hpp:165
split_when.hpp
common_ref_tuple_like
push_front.hpp
ref.hpp
meta::count
_t< detail::count_< L, T > > count
Count the number of times a type T appears in the list L.
Definition: meta.hpp:2215
ranges::move_iterator::operator=
move_iterator & operator=(move_iterator< O > const &i)
Definition: move_iterators.hpp:54
ranges::partial_sort
I partial_sort(I first, I middle, S last, C pred=C{}, P proj=P{})
function template partial_sort
Definition: partial_sort.hpp:31
ranges::views::zip_fn
Definition: zip.hpp:130
offset_t< Const >
ranges::partition_point
I partition_point(I first, S last, C pred, P proj=P{})
function template partition_point
Definition: partition_point.hpp:51
meta::lazy::not_fn
defer< not_fn, Fn > not_fn
Definition: meta.hpp:2462
slice.hpp
find_if_not.hpp
copy_backward.hpp
shuffle.hpp
basic_iterator.hpp
meta::lazy::sort
defer< sort, L, Fn > sort
Definition: meta.hpp:2729
ranges::find_first_of
constexpr borrowed_iterator_t< Rng0 > find_first_of(Rng0 &&rng0, Rng1 &&rng1, R pred=R{}, P0 proj0=P0{}, P1 proj1=P1{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: find_first_of.hpp:54
ranges::views::enumerate_fn::operator()
auto operator()(Rng &&rng) const
Definition: enumerate.hpp:99
ranges::push_back_fn
Definition: push_back.hpp:74
ranges::views::take_fn::operator()
constexpr auto operator()(Int n) const
Definition: take.hpp:245
ranges::adjacent_remove_if
borrowed_iterator_t< Rng > adjacent_remove_if(Rng &&rng, Pred pred, Proj proj={})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: adjacent_remove_if.hpp:65
meta::lazy::front
defer< front, L > front
Definition: meta.hpp:1670
ranges::cpp20::ref_view
ranges::ref_view< Rng > ref_view
Definition: ref.hpp:114
meta::quote_i
Turn a template C taking literals of type T into a invocable.
Definition: meta.hpp:743
ranges::view_
concept view_
View concepts below.
Definition: concepts.hpp:190
ranges::views::concat_fn::operator()
concat_view< all_t< Rngs >... > operator()(Rngs &&... rngs) const
Definition: concat.hpp:412
ranges::is_partitioned
bool is_partitioned(Rng &&rng, C pred, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: is_partitioned.hpp:59
ranges::partial_sum_fn
Definition: partial_sum.hpp:72
ranges::views::take_while_fn
Definition: take_while.hpp:174
ranges::minmax
constexpr minmax_result< T > minmax(std::initializer_list< T > const &&rng, C pred=C{}, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: minmax.hpp:106
meta::lazy::find_index
defer< find_index, L, T > find_index
Definition: meta.hpp:1915
ranges::operator<
constexpr bool operator<(basic_iterator< Left > const &left, basic_iterator< Right > const &right)
Definition: basic_iterator.hpp:845
ranges::optional::emplace
T & emplace(Args &&... args) noexcept(std::is_nothrow_constructible< T, Args... >::value)
Definition: optional.hpp:587
ranges::iterator_range
Definition: range_fwd.hpp:462
ranges::actions::split_fn::operator()
std::vector< split_value_t< Rng > > operator()(Rng &&rng, Pattern &&pattern) const
Definition: split.hpp:69
ranges::iter_size
constexpr iter_size_fn iter_size
Definition: operations.hpp:354
meta::lazy::bind_front
defer< bind_front, Fn, Ts... > bind_front
Definition: meta.hpp:790
ranges::views::adjacent_filter_base_fn::operator()
constexpr adjacent_filter_view< all_t< Rng >, Pred > operator()(Rng &&rng, Pred pred) const
Definition: adjacent_filter.hpp:155
ranges::common_iterator::operator->
auto operator->() const noexcept(noexcept(common_iterator::operator_arrow_(std::declval< I const & >(), 42))) -> decltype(common_iterator::operator_arrow_(std::declval< J const & >(), 42))
Definition: common_iterator.hpp:155
count_if.hpp
meta::is_trait
bool_< is_trait_v< T > > is_trait
An alias for std::true_type if T::type exists and names a type; otherwise, it's an alias for std::fal...
Definition: meta.hpp:574
ranges::actions::stride_fn::operator()
constexpr auto operator()(D step) const
Definition: stride.hpp:35
ranges::views::ints_fn
Definition: iota.hpp:499
ranges::make_common_tuple_fn
Definition: common_tuple.hpp:265
ranges::views::exclusive_scan_base_fn
Definition: exclusive_scan.hpp:163
ranges::closed_iota_view
An iota view in a closed range.
Definition: range_fwd.hpp:566
ranges::tokenize_view
tokenize_view(Rng &&, Regex, SubMatchRange) -> tokenize_view< views::all_t< Rng >, Regex, SubMatchRange >
chunk.hpp
ranges::lower_bound
I lower_bound(I first, S last, V const &val, C pred=C{}, P proj=P{})
function template lower_bound
Definition: lower_bound.hpp:35
upper_bound.hpp
ranges::views::cartesian_product_fn
Definition: cartesian_product.hpp:436
ranges::make_pipeable_fn
Definition: pipeable.hpp:42
on.hpp
ranges::adjacent_find
borrowed_iterator_t< Rng > adjacent_find(Rng &&rng, C pred=C{}, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: adjacent_find.hpp:54
ranges::unique_copy
unique_copy_result< borrowed_iterator_t< Rng >, O > unique_copy(Rng &&rng, O out, C pred=C{}, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: unique_copy.hpp:137
ranges::ostreambuf_iterator
Definition: stream_iterators.hpp:142
ranges::bad_any_cast
Definition: any.hpp:35
To
ranges::views::cache1_fn::operator()
constexpr cache1_view< all_t< Rng > > operator()(Rng &&rng) const
Caches the most recent element within the view so that dereferencing the view's iterator multiple tim...
Definition: cache1.hpp:184
meta::lazy::let
defer< let, As... > let
Definition: meta.hpp:3112
ranges::front_inserter_fn
Definition: insert_iterators.hpp:113
ranges::starts_with
constexpr bool starts_with(R1 &&r1, R2 &&r2, Comp comp={}, Proj1 proj1={}, Proj2 proj2={})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: starts_with.hpp:60
ranges::operator-
constexpr basic_iterator< Cur > operator-(basic_iterator< Cur > left, typename basic_iterator< Cur >::difference_type n)
Definition: basic_iterator.hpp:811
minmax_element.hpp
ranges::views::take_last_fn
Definition: take_last.hpp:42
ranges::take_view::end
constexpr auto end()
Definition: take.hpp:155
ranges::views::tail_fn::operator()
meta::if_c< range_cardinality< Rng >::value==0, all_t< Rng >, tail_view< all_t< Rng > > > operator()(Rng &&rng) const
Definition: tail.hpp:129
ranges::cache1_view::size
constexpr auto size()
Definition: cache1.hpp:157
ranges::views::set_difference_base_fn::operator()
set_difference_view< all_t< Rng1 >, all_t< Rng2 >, C, P1, P2 > operator()(Rng1 &&rng1, Rng2 &&rng2, C pred=C{}, P1 proj1=P1{}, P2 proj2=P2{}) const
Definition: set_algorithm.hpp:221
ranges::views::values_fn::operator()
values_view< all_t< Rng > > operator()(Rng &&rng) const
Definition: map.hpp:110
ranges::views::for_each_base_fn
Lazily applies an unary function to each element in the source range that returns another range (poss...
Definition: for_each.hpp:38
partial_sort.hpp
adjacent_remove_if.hpp
ranges::move_into
constexpr move_into_fn move_into
Definition: move_iterators.hpp:444
heap_algorithm.hpp
meta::if_c
_t< detail::_if_< bool_< If >, Args... > > if_c
Select one type or another depending on a compile-time Boolean.
Definition: meta.hpp:988
ranges::cpp20::join_view
ranges::join_view< Rng > join_view
Definition: join.hpp:619
all_of.hpp
iter_swap
constexpr _iter_swap_::fn iter_swap
Definition: access.hpp:239
ranges::actions::shuffle_fn
Definition: shuffle.hpp:32
std_iterator_traits
meta::is_trait_v
constexpr bool is_trait_v
true if T::type exists and names a type; false otherwise.
Definition: meta.hpp:564
ranges::front_inserter
constexpr front_inserter_fn front_inserter
Definition: insert_iterators.hpp:122
move.hpp
ranges::static_const::value
static constexpr T value
Definition: static_const.hpp:23
meta::dec
std::integral_constant< decltype(T::type::value - 1), T::type::value - 1 > dec
An integral constant wrapper around the result of decrementing the wrapped integer T::type::value.
Definition: meta.hpp:188
ranges::front_fn
Definition: operations.hpp:107
operations.hpp
ranges::views::cpp20_common_fn
Definition: common.hpp:160
facade.hpp
ranges::stride_view
Definition: range_fwd.hpp:658
ranges::experimental::coroutine_owner
Definition: generator.hpp:44
count.hpp
ranges::views::cpp20_filter_base_fn::operator()
constexpr filter_view< all_t< Rng >, Pred > operator()(Rng &&rng, Pred pred) const
Definition: filter.hpp:56
ranges::unwrap_reference_fn::operator()
T & operator()(ref_view< T > t) const noexcept
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: reference_wrapper.hpp:164
meta::count_if
_t< detail::count_if_< L, Fn > > count_if
Count the number of times the predicate Fn evaluates to true for all the elements in the list L.
Definition: meta.hpp:2249
meta::list
A list of types.
Definition: meta.hpp:1308
meta::lazy::push_front
defer< push_front, Ts... > push_front
Definition: meta.hpp:1720
meta::not_c
bool_<!B > not_c
Logically negate the Boolean parameter.
Definition: meta.hpp:1051
ranges::not_fn
constexpr not_fn_fn not_fn
Definition: not_fn.hpp:88
ranges::in_place_t
Definition: in_place.hpp:26
ranges::actions::unstable_remove_if_fn
Definition: unstable_remove_if.hpp:33
ranges::join_with_view
Definition: range_fwd.hpp:578
ranges::views::adjacent_remove_if_base_fn
Definition: adjacent_remove_if.hpp:149
drop.hpp
ranges::make_ostream_joiner
constexpr make_ostream_joiner_fn make_ostream_joiner
Definition: stream_iterators.hpp:138
ranges::partial_sum_view
partial_sum_view(Rng &&, Fun) -> partial_sum_view< views::all_t< Rng >, Fun >
ranges::variant< I, S >
ranges::copy_tag
Definition: range_fwd.hpp:367
meta::find
drop< L, min< find_index< L, T >, size< L > >> find
Return the tail of the list L starting at the first occurrence of T, if any such element exists; the ...
Definition: meta.hpp:1981
meta::lazy::zip_with
defer< zip_with, Fn, ListOfLists > zip_with
Definition: meta.hpp:2364
ranges::minus
Definition: arithmetic.hpp:34
ranges::on_fn
Definition: on.hpp:55
ranges::push_back
insert_t< Cont, Rng > push_back(Cont &&cont, Rng &&rng)
Definition: push_back.hpp:54
copy.hpp
ranges::views::reverse_fn
Definition: reverse.hpp:152
ranges::exclusive_scan_view
exclusive_scan_view(Rng &&, T, Fun) -> exclusive_scan_view< views::all_t< Rng >, T, Fun >
ranges::views::linear_distribute_fn::operator()
constexpr auto operator()(T from, T to, std::ptrdiff_t n) const
Definition: linear_distribute.hpp:104
ranges::next_fn
Definition: operations.hpp:146
ranges::optional::value_or
constexpr T value_or(U &&u) const &
Definition: optional.hpp:635
meta::lazy::reverse_find_index
defer< reverse_find_index, L, T > reverse_find_index
Definition: meta.hpp:1970
meta::lazy::fold
defer< fold, L, State, Fn > fold
Definition: meta.hpp:1236
ranges::mismatch
mismatch_result< I1, I2 > mismatch(I1 begin1, S1 end1, I2 begin2, C pred=C{}, P1 proj1=P1{}, P2 proj2=P2{})
function template mismatch
Definition: mismatch.hpp:39
ranges::views::drop_while_bind_fn::operator()
constexpr auto operator()(Pred &&pred, Proj proj) const
Definition: drop_while.hpp:124
meta::conditional_t
typename detail::_cond< If >::template invoke< Then, Else > conditional_t
Select one type or another depending on a compile-time Boolean.
Definition: meta.hpp:949
repeat_n.hpp
ranges::partition
borrowed_iterator_t< Rng > partition(Rng &&rng, C pred, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: partition.hpp:112
ranges::enumerate_fn::operator()
std::pair< range_difference_t< Rng >, iterator_t< Rng > > operator()(Rng &&rng) const
Definition: operations.hpp:418
ranges::forward_range_tag
Definition: concepts.hpp:209
meta::reverse
_t< detail::reverse_< L > > reverse
Return a new meta::list by reversing the elements in the list L.
Definition: meta.hpp:2442
ranges::getlines_view
Definition: getlines.hpp:29
ranges::views::addressof_fn
Definition: addressof.hpp:30
meta::lazy::zip
defer< zip, ListOfLists > zip
Definition: meta.hpp:2383
ranges::less
Definition: comparisons.hpp:50
meta::size
meta::size_t< L::size()> size
An integral constant wrapper that is the size of the meta::list L.
Definition: meta.hpp:1320
ranges::actions::drop_while_fn
Definition: drop_while.hpp:31
view.hpp
meta::bool_
std::integral_constant< bool, B > bool_
An integral constant wrapper for bool.
Definition: meta.hpp:166
ranges::input_range_tag
Definition: concepts.hpp:207
ranges::operator+
constexpr basic_iterator< Cur > operator+(typename basic_iterator< Cur >::difference_type n, basic_iterator< Cur > right)
Definition: basic_iterator.hpp:802
ranges::cartesian_product_view
Definition: cartesian_product.hpp:123
ranges::views::tail_fn
Definition: tail.hpp:122
ranges::views::drop_last_base_fn
Definition: drop_last.hpp:343
ranges::make_move_iterator_fn
Definition: move_iterators.hpp:220
ranges::is_heap
bool is_heap(Rng &&rng, C pred=C{}, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: heap_algorithm.hpp:145
ranges::actions::take_while_fn::operator()
constexpr auto operator()(Fun fun) const
Definition: take_while.hpp:35
ranges::view_interface::back
constexpr range_reference_t< D< True > > back()
Access the last element in a range:
Definition: interface.hpp:268
ranges::views::take_exactly_base_fn
Definition: take_exactly.hpp:148
meta::lazy::reverse
defer< reverse, L > reverse
Definition: meta.hpp:2449
ranges::views::remove_base_fn::operator()
constexpr auto operator()(Rng &&rng, Value value) const
Definition: remove.hpp:53
ranges::indirectly_readable_traits
Definition: range_fwd.hpp:159
concepts::return_t_
Definition: concepts.hpp:229
ranges::actions::remove_if_fn
Definition: remove_if.hpp:34
ranges::upper_bound
borrowed_iterator_t< Rng > upper_bound(Rng &&rng, V const &val, C pred=C{}, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: upper_bound.hpp:57
ranges::find_if
borrowed_iterator_t< Rng > find_if(Rng &&rng, F pred, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: find_if.hpp:57
contains.hpp
ranges::views::cpp20_counted_fn::operator()
subrange< counted_iterator< I >, default_sentinel_t > operator()(I it, iter_difference_t< I > n) const
Definition: counted.hpp:75
ranges::iterator_wrapper
Definition: memory.hpp:164
adjacent_filter.hpp
ranges::pipeable_base
Definition: pipeable.hpp:72
ends_with.hpp
ranges::subrange
subrange(R &&, detail::iter_size_t< iterator_t< R >>) -> subrange< iterator_t< R >, sentinel_t< R >, subrange_kind::sized >
ranges::adaptor_base
Definition: adaptor.hpp:102
ranges::views::trim_base_fn
Definition: trim.hpp:99
meta::inherit
meta::_t< detail::inherit_< L > > inherit
A type that inherits from all the types in the list.
Definition: meta.hpp:2560
ranges::rotate_copy
rotate_copy_result< borrowed_iterator_t< Rng >, O > rotate_copy(Rng &&rng, iterator_t< Rng > middle, O out)
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: rotate_copy.hpp:48
ranges::raw_storage_iterator
Definition: memory.hpp:99
ranges::actions::slice_fn::operator()
constexpr auto operator()(D from, detail::from_end_< D > to) const
Definition: slice.hpp:49
std::__1::common_type
Definition: common_tuple.hpp:662
ranges::views::partial_sum_base_fn::operator()
constexpr partial_sum_view< all_t< Rng >, Fun > operator()(Rng &&rng, Fun fun={}) const
Definition: partial_sum.hpp:175
ranges::zip_with_view
Definition: range_fwd.hpp:778
split.hpp
ranges::views::set_union_base_fn::operator()
set_union_view< all_t< Rng1 >, all_t< Rng2 >, C, P1, P2 > operator()(Rng1 &&rng1, Rng2 &&rng2, C pred=C{}, P1 proj1=P1{}, P2 proj2=P2{}) const
Definition: set_algorithm.hpp:587
range.hpp
ranges::istream
istream_view< Val > istream(std::istream &sin)
Definition: istream.hpp:100
ranges::views::chunk_fn::operator()
constexpr auto operator()(Int n) const
Definition: chunk.hpp:450
meta::less_equal
bool_<(T::type::value<=U::type::value)> less_equal
A Boolean integral constant wrapper around true if T::type::value is less than or equal to U::type::v...
Definition: meta.hpp:265
ranges::index
constexpr index_fn index
Unchecked indexed range access.
Definition: operations.hpp:85
enumerate.hpp
ranges::view_interface::operator[]
constexpr range_reference_t< D< True > > operator[](range_difference_t< D< True >> n)
Simple indexing:
Definition: interface.hpp:285
ranges::move_backward
move_backward_result< I, O > move_backward(I first, S end_, O out)
function template move_backward
Definition: move_backward.hpp:40
ranges::experimental::views::shared_fn
Definition: shared.hpp:104
adjacent_find.hpp
meta::lazy::min
defer< min, Ts... > min
Definition: meta.hpp:1808
meta::is_callable_v
constexpr bool is_callable_v
true if T::invoke exists and names a class template; false otherwise.
Definition: meta.hpp:569
ranges::operator+
constexpr basic_iterator< Cur > operator+(basic_iterator< Cur > left, typename basic_iterator< Cur >::difference_type n)
Definition: basic_iterator.hpp:793
ranges::ref_fn
Definition: reference_wrapper.hpp:113
ranges::move_iterator
Definition: move_iterators.hpp:29
max_element.hpp
tuple_element
accumulate.hpp
sort.hpp
ranges::views::join_base_fn::operator()
join_with_view< all_t< Rng >, single_view< inner_value_t< Rng > > > operator()(Rng &&rng, inner_value_t< Rng > v) const
Definition: join.hpp:536
functional.hpp
ranges::make_ostream_joiner_fn
Definition: stream_iterators.hpp:126
ranges::views::filter_base_fn
Given a source range, unary predicate, and optional projection, present a view of the elements that s...
Definition: filter.hpp:79
take_while.hpp
ranges::delimit_view
delimit_view(Rng &&, Val) -> delimit_view< views::all_t< Rng >, Val >
partial_sum.hpp
ranges::any_view< Ref, Cat, meta::if_c<(Cat &category::forward)==category::input > >::any_view
any_view(Rng &&rng)
Definition: any_view.hpp:621
ranges::tuple_apply_fn
Definition: tuple_algorithm.hpp:35
concepts::common_type
Users should specialize this to hook the common_with concept until std gets a SFINAE-friendly std::co...
Definition: type_traits.hpp:184
ranges::remove_copy
remove_copy_result< borrowed_iterator_t< Rng >, O > remove_copy(Rng &&rng, O out, T const &val, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: remove_copy.hpp:62
ranges::iota_fn::operator()
O operator()(O first, S last, T val) const
Definition: iota.hpp:31
ranges::prev_permutation
bool prev_permutation(Rng &&rng, C pred=C{}, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: permutation.hpp:327
ranges::make_heap
borrowed_iterator_t< Rng > make_heap(Rng &&rng, C pred=C{}, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: heap_algorithm.hpp:374
meta::apply
_t< extension::apply< Fn, L > > apply
Applies the invocable Fn using the types in the type list L as arguments.
Definition: meta.hpp:831
meta::zip
transpose< ListOfLists > zip
Given a list of lists of types ListOfLists, construct a new list by grouping the elements from the li...
Definition: meta.hpp:2376
ranges::generate_view
Definition: generate.hpp:31
join.hpp
iota.hpp
meta::equal_to
bool_< T::type::value==U::type::value > equal_to
A Boolean integral constant wrapper around the result of comparing T::type::value and U::type::value ...
Definition: meta.hpp:235
ranges::inserter_fn
Definition: insert_iterators.hpp:164
trim.hpp
ranges::drop_exactly_view
Definition: drop_exactly.hpp:41
meta::pair
list< F, S > pair
A list with exactly two elements.
Definition: meta.hpp:1839
ranges::optional
Definition: optional.hpp:27
meta::size_t
std::integral_constant< std::size_t, N > size_t
An integral constant wrapper for std::size_t.
Definition: meta.hpp:161
ranges::compose
constexpr compose_fn compose
Definition: compose.hpp:93
sliding.hpp
ranges::view_facade
A utility for constructing a view from a (derived) type that implements begin and end cursors.
Definition: range_fwd.hpp:426
ranges::sentinel_tag
Definition: concepts.hpp:572
ranges::operator<=
constexpr bool operator<=(basic_iterator< Left > const &left, basic_iterator< Right > const &right)
Definition: basic_iterator.hpp:853
all.hpp
ranges::views::drop_exactly_base_fn::operator()
auto operator()(Rng &&rng, range_difference_t< Rng > n) const
Definition: drop_exactly.hpp:154
copy_n.hpp
ranges::actions::action_closure_base
Definition: action.hpp:66
ranges::iter_transform_view
Definition: range_fwd.hpp:714
drop_exactly.hpp
ranges::views::take_last_base_fn
Definition: take_last.hpp:30
concat.hpp
ranges::exclusive_scan_view
Definition: exclusive_scan.hpp:43
ranges::equal
constexpr bool equal(I0 begin0, S0 end0, I1 begin1, C pred=C{}, P0 proj0=P0{}, P1 proj1=P1{})
function template equal
Definition: equal.hpp:54
meta::flip
An invocable that reverses the order of the first two arguments.
Definition: meta.hpp:869
ranges::remove_copy_if
remove_copy_if_result< borrowed_iterator_t< Rng >, O > remove_copy_if(Rng &&rng, O out, C pred, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: remove_copy_if.hpp:61
ranges::actions::slice_fn::operator()
constexpr auto operator()(detail::from_end_< D > from, detail::from_end_< D > to) const
Definition: slice.hpp:56
ranges::make_ostream_joiner_fn::operator()
ostream_joiner< detail::decay_t< Delim >, Char, Traits > operator()(std::basic_ostream< Char, Traits > &s, Delim &&d) const
Definition: stream_iterators.hpp:131
copy.hpp
meta.hpp
ranges::views::generate_n_fn::operator()
generate_n_view< G > operator()(G g, std::size_t n) const
Definition: generate_n.hpp:101
meta::not_fn
compose< quote< not_ >, Fn > not_fn
Logically negate the result of invocable Fn.
Definition: meta.hpp:2455
ranges::actions::stable_sort_fn
Definition: stable_sort.hpp:33
ranges::views::drop_exactly_base_fn
Definition: drop_exactly.hpp:133
ranges::views::move_fn::operator()
move_view< all_t< Rng > > operator()(Rng &&rng) const
Definition: move.hpp:118
meta::lazy::equal_to
defer< equal_to, T, U > equal_to
Definition: meta.hpp:339
ranges::intersperse_view::cursor_adaptor::cursor_adaptor
cursor_adaptor(cursor_adaptor< Other > that)
Definition: intersperse.hpp:80
meta::lazy::or_
defer< or_, Bs... > or_
Definition: meta.hpp:1132
ranges::operator!=
bool operator!=(common_iterator< I1, S1 > const &x, common_iterator< I2, S2 > const &y)
Definition: common_iterator.hpp:246
ranges::concat_view
Definition: range_fwd.hpp:586
ranges::views::drop_base_fn
Definition: drop.hpp:139
ranges::greater
Definition: comparisons.hpp:86
search.hpp
ranges::actions::adjacent_remove_if_fn
Definition: adjacent_remove_if.hpp:32
partition_point.hpp
ranges::views::indices_fn::operator()
iota_view< Val, Val > operator()(Val to) const
Definition: indices.hpp:36
ranges::views::join_bind_fn::operator()
constexpr auto operator()(T &&t) const
Definition: join.hpp:565
ranges::incrementable_traits
Definition: range_fwd.hpp:166
range_fwd.hpp
meta::min_
fold< pop_front< list< Ts... > >, front< list< Ts... > >, quote< detail::min_ > > min_
An integral constant wrapper around the minimum of Ts::type::value...
Definition: meta.hpp:1790
ranges::unreachable_sentinel_t
Definition: unreachable_sentinel.hpp:25
ranges::dangling
Definition: dangling.hpp:30
ranges::actions::sort_fn
Definition: sort.hpp:33
ranges::advance_fn
Definition: operations.hpp:34
ranges::closed_iota_view
closed_iota_view(From, To) -> closed_iota_view< From, To >
ranges::remove_if
I remove_if(I first, S last, C pred, P proj=P{})
function template remove_if
Definition: remove_if.hpp:41
ranges::drop_view
Definition: drop.hpp:41
ranges::all_of
bool all_of(Rng &&rng, F pred, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: all_of.hpp:48
Rng2
reverse_iterator.hpp
meta::back
_t< detail::back_< L > > back
Return the last element in meta::list L.
Definition: meta.hpp:1696
meta::pop_front
_t< detail::pop_front_< L > > pop_front
Return a new meta::list by removing the first element from the front of L.
Definition: meta.hpp:1747
ranges::group_by_view
Definition: range_fwd.hpp:545
reverse.hpp
ranges::find_if_not
I find_if_not(I first, S last, F pred, P proj=P{})
template function find_if_not
Definition: find_if_not.hpp:44
ranges::operator>
constexpr bool operator>(basic_iterator< Left > const &left, basic_iterator< Right > const &right)
Definition: basic_iterator.hpp:861
ranges::default_sentinel_t
Definition: default_sentinel.hpp:24
invoke.hpp
Derived
tuple_algorithm.hpp
ranges::greater_equal
Definition: comparisons.hpp:74
adjacent_difference.hpp
iota.hpp
ranges::binary_search
bool binary_search(Rng &&rng, V const &val, C pred=C{}, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: binary_search.hpp:52
ranges::make_common_pair
constexpr make_common_pair_fn make_common_pair
Definition: common_tuple.hpp:499
ranges::views::drop_while_base_fn::operator()
auto operator()(Rng &&rng, Pred pred) const -> drop_while_view< all_t< Rng >, Pred >
Definition: drop_while.hpp:96
ranges::find_end
borrowed_subrange_t< Rng1 > find_end(Rng1 &&rng1, Rng2 &&rng2, R pred=R{}, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: find_end.hpp:202
ranges::coerce
Definition: arithmetic.hpp:77
ranges::min_element
borrowed_iterator_t< Rng > min_element(Rng &&rng, C pred=C{}, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: min_element.hpp:51
common_type_tuple_like
meta::curry
compose< Fn, Q > curry
An invocable that takes a bunch of arguments, bundles them into a type list, and then calls the invoc...
Definition: meta.hpp:844
meta::zip_with
transform< transpose< ListOfLists >, uncurry< Fn > > zip_with
Given a list of lists of types ListOfLists and an invocable Fn, construct a new list by calling Fn wi...
Definition: meta.hpp:2357
replace_if.hpp
ranges::common_tuple::operator=
common_tuple & operator=(std::tuple< Us... > &that) noexcept(meta::and_c< std::is_nothrow_assignable< Ts &, Us & >::value... >::value)
Definition: common_tuple.hpp:165
meta::lazy::push_back
defer< push_back, Ts... > push_back
Definition: meta.hpp:1773
remove_if.hpp
ranges::partition_point
borrowed_iterator_t< Rng > partition_point(Rng &&rng, C pred, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: partition_point.hpp:84
ranges::is_permutation
bool is_permutation(Rng1 &&rng1, Rng2 &&rng2, C pred=C{}, P1 proj1=P1{}, P2 proj2=P2{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: permutation.hpp:215
ranges::for_each
for_each_result< borrowed_iterator_t< Rng >, F > for_each(Rng &&rng, F fun, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: for_each.hpp:52
ranges::views::slice_base_fn
Definition: slice.hpp:188
meta::modulus
std::integral_constant< decltype(T::type::value % U::type::value), T::type::value % U::type::value > modulus
An integral constant wrapper around the remainder of dividing the two wrapped integers T::type::value...
Definition: meta.hpp:229
meta::greater_equal
bool_<(T::type::value >=U::type::value)> greater_equal
A Boolean integral constant wrapper around true if T::type::value is greater than or equal to U::type...
Definition: meta.hpp:259
meta::is_v
constexpr bool is_v
is_v Test whether a type T is an instantiation of class template C.
Definition: meta_fwd.hpp:60
ranges::take_while_view
Definition: range_fwd.hpp:697
ranges::views::replace_if_base_fn::operator()
constexpr replace_if_view< all_t< Rng >, Pred, Val > operator()(Rng &&rng, Pred pred, Val new_value) const
Definition: replace_if.hpp:115
ranges::views::zip_with_fn
Definition: zip_with.hpp:415
ranges::ref_fn::operator()
reference_wrapper< T > operator()(std::reference_wrapper< T > t) const
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: reference_wrapper.hpp:129
ranges::views::chunk_base_fn
Definition: chunk.hpp:432
take.hpp
ranges::size
constexpr _size_::fn size
Definition: primitives.hpp:151
ranges::operator==
constexpr bool operator==(basic_iterator< Cur > const &left, basic_iterator< Cur2 > const &right)
Definition: basic_iterator.hpp:743
ranges::actions::take_while_fn
Definition: take_while.hpp:31
ranges::index_fn
Unchecked indexed range access.
Definition: operations.hpp:66
traits.hpp
ranges::set_intersection
O set_intersection(Rng1 &&rng1, Rng2 &&rng2, O out, C pred=C{}, P1 proj1=P1{}, P2 proj2=P2{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: set_algorithm.hpp:177
ranges::semiregular_box
Definition: semiregular_box.hpp:60
ranges::adaptor_base::distance_to
static iter_difference_t< I > distance_to(I const &it0, I const &it1)
Definition: adaptor.hpp:163
indices.hpp
ranges::view_interface::size
static constexpr std::size_t size() noexcept
If the size of the range is known at compile-time and finite, return it.
Definition: interface.hpp:219
tail.hpp
set_algorithm.hpp
ranges::views::move_fn
Definition: move.hpp:114
compressed_pair.hpp
max.hpp
drop.hpp
ranges::actions::remove_fn::operator()
constexpr auto operator()(V &&value, P proj) const
Definition: remove.hpp:35
ranges::iter_zip_with_view
Definition: range_fwd.hpp:775
meta::_v
constexpr T::type::value_type _v
Variable alias for T::type::value.
Definition: meta.hpp:146
ranges::enumerate
constexpr enumerate_fn enumerate
Definition: operations.hpp:428
stable_sort.hpp
meta::quote
Turn a template C into an invocable.
Definition: meta.hpp:731
ranges::static_const
Definition: static_const.hpp:22
ranges::back_insert_iterator
Definition: insert_iterators.hpp:28
ranges::common_comparison_category
Definition: compare.hpp:29
meta::lazy::join
defer< join, ListOfLists > join
Definition: meta.hpp:1417
ranges::views::intersperse_base_fn
Definition: intersperse.hpp:225
ranges::partial_sum_view
Definition: range_fwd.hpp:594
ranges::views::cpp20_counted_fn
Definition: counted.hpp:70
meta::id
A trait that always returns its argument T. It is also an invocable that always returns T.
Definition: meta.hpp:525
indirect.hpp
concepts.hpp
stride.hpp
concepts::detail::ignore
Definition: concepts.hpp:240
ranges::views::for_each_base_fn::operator()
constexpr auto operator()(Rng &&rng, Fun fun) const
Definition: for_each.hpp:43
concepts::is_swappable
Definition: swap.hpp:45
ranges::actions::slice_fn::operator()
constexpr auto operator()(D from, D to) const
Definition: slice.hpp:42
ranges::split_when_view
Definition: split_when.hpp:38
ranges::move_tag
Definition: range_fwd.hpp:369
remove_if.hpp
is_partitioned.hpp
ranges::random_access_range_tag
Definition: concepts.hpp:213
ranges::aux::move_fn::operator|
constexpr decltype(auto) friend operator|(T &&t, move_fn move) noexcept
Definition: move.hpp:41
meta::reverse_find_if
_t< detail::reverse_find_if_< L, Fn > > reverse_find_if
Return the tail of the list L starting at the last element A such that invoke<Fn, A>::value is true,...
Definition: meta.hpp:2112
ranges::views::take_exactly_fn
Definition: take_exactly.hpp:178
ranges::indirect_fn
Definition: indirect.hpp:80
meta::is
bool_< is_v< T, C > > is
is Test whether a type T is an instantiation of class template C.
Definition: meta.hpp:694
ranges::views::stride_base_fn
Definition: stride.hpp:308
meta::second
front< pop_front< Pair > > second
Retrieve the first element of the pair Pair.
Definition: meta.hpp:1849
ranges::yield_from_fn
Definition: for_each.hpp:79
ranges::pipeable_access
Definition: pipeable.hpp:63
meta::first
front< Pair > first
Retrieve the first element of the pair Pair.
Definition: meta.hpp:1844
ranges::views::remove_base_fn
Definition: remove.hpp:32
ranges::search
borrowed_subrange_t< Rng1 > search(Rng1 &&rng1, Rng2 &&rng2, C pred=C{}, P1 proj1=P1{}, P2 proj2=P2{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: search.hpp:182
std::__1::basic_common_reference
Definition: common_tuple.hpp:704
for_each_n.hpp
ranges::unwrap_reference
constexpr unwrap_reference_fn unwrap_reference
Definition: reference_wrapper.hpp:172
meta::quote_trait
compose< quote< _t >, quote< C > > quote_trait
Turn a trait template C into an invocable.
Definition: meta.hpp:756
ranges::views::single_fn
Definition: single.hpp:103
traits.hpp
generate_n.hpp
meta::bit_not
std::integral_constant< decltype(~T::type::value), ~T::type::value > bit_not
An integral constant wrapper around the result of bitwise-complementing the wrapped integer T::type::...
Definition: meta.hpp:292
ranges::drop_while_view
Definition: drop_while.hpp:37
concepts::detail::Nil
Definition: concepts.hpp:264
ranges::tuple_transform_fn
Definition: tuple_algorithm.hpp:61
concepts::detail::tag
Definition: concepts.hpp:252
ranges::rotate
subrange< I > rotate(I first, I middle, S last)
function template rotate
Definition: rotate.hpp:195
ranges::views::sliding_base_fn::operator()
constexpr sliding_view< all_t< Rng > > operator()(Rng &&rng, range_difference_t< Rng > n) const
Definition: sliding.hpp:380
meta::vararg
detail::vararg_< T > vararg
For defining variadic placeholders.
Definition: meta.hpp:3053
ranges::min_element
I min_element(I first, S last, C pred=C{}, P proj=P{})
function template min_element
Definition: min_element.hpp:36
ranges::overloaded
Definition: overload.hpp:56
ranges::view_interface
Definition: range_fwd.hpp:456
ranges::is_heap_until
borrowed_iterator_t< Rng > is_heap_until(Rng &&rng, C pred=C{}, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: heap_algorithm.hpp:112
replace_copy_if.hpp
access.hpp
ranges::compressed_pair
Definition: range_fwd.hpp:447
ranges::operator!=
constexpr bool operator!=(basic_iterator< Cur > const &left, basic_iterator< Cur2 > const &right)
Definition: basic_iterator.hpp:751
ranges::views::single_fn::operator()
single_view< Val > operator()(Val value) const
Definition: single.hpp:107
ranges::take_view
Definition: range_fwd.hpp:666
ranges::partition_copy
partition_copy_result< I, O0, O1 > partition_copy(I first, S last, O0 o0, O1 o1, C pred, P proj=P{})
function template partition_copy
Definition: partition_copy.hpp:38
ranges::views::take_exactly_base_fn::operator()
constexpr auto operator()(Rng &&rng, range_difference_t< Rng > n) const
Definition: take_exactly.hpp:170
meta::lazy::concat
defer< concat, Lists... > concat
Definition: meta.hpp:1399
ranges::count
iter_difference_t< iterator_t< Rng > > count(Rng &&rng, V const &val, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: count.hpp:51
ranges::views::intersperse_base_fn::operator()
constexpr intersperse_view< all_t< Rng > > operator()(Rng &&rng, range_value_t< Rng > val) const
Definition: intersperse.hpp:232
ranges::indirect_view
Definition: range_fwd.hpp:553
ranges::views::repeat_n_fn::operator()
repeat_n_view< Val > operator()(Val value, std::ptrdiff_t n) const
Definition: repeat_n.hpp:110
empty.hpp
ranges::actions::take_fn::operator()
constexpr auto operator()(Int n) const
Definition: take.hpp:35
pipeable.hpp
ranges::empty
constexpr _empty_::fn empty
Definition: primitives.hpp:316
inner_product.hpp
ranges::getlines_fn
Definition: getlines.hpp:95
find_end.hpp
meta_fwd.hpp
ranges::views::filter_base_fn::operator()
constexpr filter_view< all_t< Rng >, composed< Pred, Proj > > operator()(Rng &&rng, Pred pred, Proj proj) const
Definition: filter.hpp:87
is_sorted.hpp
ranges::split_view
Definition: split.hpp:466
meta
Tiny metaprogramming library.
Definition: meta.hpp:114
ranges::slice_view
Definition: range_fwd.hpp:634
partial_sum.hpp
concepts.hpp
ranges::filter_view
Definition: filter.hpp:28
ranges::adjacent_remove_if_view
adjacent_remove_if_view(Rng &&, Fun) -> adjacent_remove_if_view< views::all_t< Rng >, Fun >
meta::integer_range
_t< detail::coerce_indices_< T, From, make_index_sequence< detail::range_distance_(From, To)> >> integer_range
Makes the integer sequence [From, To).
Definition: meta.hpp:460
move.hpp
ranges::views::iter_transform_base_fn
Definition: transform.hpp:422
ranges::make_compressed_tuple
constexpr make_compressed_tuple_fn make_compressed_tuple
Definition: compressed_pair.hpp:112
ranges::includes
bool includes(Rng1 &&rng1, Rng2 &&rng2, C pred=C{}, P1 proj1=P1{}, P2 proj2=P2{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: set_algorithm.hpp:57
fill_n.hpp
take.hpp
cartesian_product.hpp
ranges::pipeable_base::operator|
constexpr friend auto operator|(Arg &&arg, Pipe pipe)
Definition: pipeable.hpp:81
take_exactly.hpp
ranges::views::repeat_fn::operator()
repeat_view< Val > operator()(Val value) const
Definition: repeat.hpp:102
ranges::push_front_fn
Definition: push_front.hpp:74
ranges::filter_view
filter_view(Rng &&, Pred) -> filter_view< views::all_t< Rng >, Pred >
ranges::detail::bind_back_fn_
Definition: bind_back.hpp:32
meta::npos
meta::size_t< std::size_t(-1)> npos
A special value used to indicate no matches. It equals the maximum value representable by std::size_t...
Definition: meta.hpp:1300
ranges::actions::take_fn
Definition: take.hpp:31
ranges::actions::join_fn
Definition: join.hpp:40
move.hpp
ranges::views::replace_if_base_fn
Definition: replace_if.hpp:112
ranges::views::remove_if_bind_fn
Definition: remove_if.hpp:171
adjacent_remove_if.hpp
ranges::back
constexpr back_fn back
Definition: operations.hpp:103
ranges::actions::slice_fn
Definition: slice.hpp:32
ranges::category
category
An enum that denotes the supported subset of range concepts supported by a range.
Definition: any_view.hpp:36
concepts::is_nothrow_swappable_with
Definition: swap.hpp:54
meta::lazy::partition
defer< partition, L, Fn > partition
Definition: meta.hpp:2662
ranges::crbegin
constexpr _crbegin_::fn crbegin
Definition: access.hpp:669
interface.hpp
ranges::views::exclusive_scan_base_fn::operator()
constexpr exclusive_scan_view< all_t< Rng >, T, Fun > operator()(Rng &&rng, T init, Fun fun=Fun{}) const
Definition: exclusive_scan.hpp:168
ranges::overload
constexpr overload_fn overload
Definition: overload.hpp:171
ranges::views::replace_if_fn
Definition: replace_if.hpp:123
ranges::get_cursor
constexpr get_cursor_fn get_cursor
Definition: basic_iterator.hpp:896
sample.hpp
ranges::tuple_apply
constexpr tuple_apply_fn tuple_apply
Definition: tuple_algorithm.hpp:58
ranges::view_adaptor
Definition: range_fwd.hpp:430
ranges::make_compressed_pair
constexpr make_compressed_pair_fn make_compressed_pair
Definition: compressed_pair.hpp:185
ranges::minmax_element
minmax_element_result< borrowed_iterator_t< Rng > > minmax_element(Rng &&rng, C pred=C{}, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: minmax_element.hpp:88
ranges::views::set_union_fn
Definition: set_algorithm.hpp:602
for_each.hpp
ranges::adaptor_cursor
Definition: adaptor.hpp:96
ranges::experimental::enable_coroutine_owner
Definition: generator.hpp:47
meta::lazy::if_
defer< if_, Args... > if_
Definition: meta.hpp:994
ranges::end
constexpr _end_::fn end
Definition: access.hpp:326
ranges::end_tag
Definition: range_fwd.hpp:365
ranges::not_equal_to
Definition: comparisons.hpp:38
ranges::aux::copy_fn::operator|
constexpr friend auto operator|(T &&t, copy_fn) -> detail::decay_t< T >
Definition: copy.hpp:42
getlines.hpp
ranges::views::replace_base_fn::operator()
constexpr replace_view< all_t< Rng >, detail::decay_t< Val1 >, detail::decay_t< Val2 > > operator()(Rng &&rng, Val1 &&old_value, Val2 &&new_value) const
Definition: replace.hpp:88
ranges::begin
constexpr _begin_::fn begin
Definition: access.hpp:181
ranges::unstable_remove_if
borrowed_iterator_t< Rng > unstable_remove_if(Rng &&rng, C pred, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: unstable_remove_if.hpp:72
ranges::sized_iterator_range
Definition: range_fwd.hpp:465
set_algorithm.hpp
ranges::begin_tag
Definition: range_fwd.hpp:363
ranges::protector
Definition: bind.hpp:70
ranges::views::iter_take_while_base_fn::operator()
constexpr iter_take_while_view< all_t< Rng >, Pred > operator()(Rng &&rng, Pred pred) const
Definition: take_while.hpp:112
shuffle.hpp
ranges::is_sorted_until
borrowed_iterator_t< Rng > is_sorted_until(Rng &&rng, R pred=R{}, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: is_sorted_until.hpp:67
ranges::actions::split_fn
Definition: split.hpp:34
ranges::box
Definition: box.hpp:152
ranges::move_sentinel
Definition: move_iterators.hpp:234
ranges::actions::split_fn::operator()
constexpr auto operator()(T &t) const
Definition: split.hpp:43
ranges::experimental::shared_view
Definition: shared.hpp:32
ranges::make_view_closure
constexpr make_view_closure_fn make_view_closure
Definition: view.hpp:88
ranges::repeat_n_view
Definition: repeat_n.hpp:38
ranges::actions::unstable_remove_if_fn::operator()
constexpr auto operator()(C pred, P proj=P{}) const
Definition: unstable_remove_if.hpp:37
ranges::view_interface::empty
constexpr auto empty() const noexcept -> bool
Test whether a range can be empty:
Definition: interface.hpp:146
ranges::actions::transform_fn::operator()
constexpr auto operator()(F fun, P proj=P{}) const
Definition: transform.hpp:36
ranges::unwrap_reference_fn::operator()
reference_wrapper< T >::reference operator()(reference_wrapper< T > t) const noexcept
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: reference_wrapper.hpp:151
ranges::views::replace_base_fn
Definition: replace.hpp:82
ranges::plus
Definition: arithmetic.hpp:24
ranges::make_action_closure
constexpr make_action_closure_fn make_action_closure
Definition: action.hpp:43
ranges::views::sample_fn::operator()
constexpr auto operator()(Size n, URNG &urng=detail::get_random_engine()) const
Definition: sample.hpp:244
fill.hpp
Rng1
ranges::transform_view
transform_view(Rng &&, Fun) -> transform_view< views::all_t< Rng >, Fun >
ranges::views::for_each_fn
Definition: for_each.hpp:50
partition.hpp
unique
constexpr action_closure< unique_fn > unique
Definition: unique.hpp:58
ranges::group_by_view
group_by_view(Rng &&, Fun) -> group_by_view< views::all_t< Rng >, Fun >
meta::unique
fold< L, list<>, quote_trait< detail::insert_back_ > > unique
Return a new meta::list where all duplicate elements have been removed.
Definition: meta.hpp:2603
ranges::cdata
constexpr _cdata_::fn cdata
Definition: primitives.hpp:243
concepts::is_nothrow_swappable
Definition: swap.hpp:48
meta::drop
drop_c< L, N::type::value > drop
Return a new meta::list by removing the first N elements from L.
Definition: meta.hpp:1630
ranges::swap_ranges
swap_ranges_result< I1, I2 > swap_ranges(I1 begin1, S1 end1, I2 begin2)
function template swap_ranges
Definition: swap_ranges.hpp:38
meta::find_if
_t< detail::find_if_< L, Fn > > find_if
Return the tail of the list L starting at the first element A such that invoke<Fn,...
Definition: meta.hpp:2069
generate_n.hpp
range_difference_t< Rng >
ranges::bind_back
constexpr bind_back_fn bind_back
Definition: bind_back.hpp:181
meta::lazy::size
defer< size, L > size
Definition: meta.hpp:1327
meta::char_
std::integral_constant< char, Ch > char_
An integral constant wrapper for char.
Definition: meta.hpp:176
ranges::basic_iterator
Definition: basic_iterator.hpp:514
meta::uncurry
bind_front< quote< apply >, Fn > uncurry
An invocable that takes a type list, unpacks the types, and then calls the invocable Fn with the type...
Definition: meta.hpp:850
ranges::rend
constexpr _rend_::fn rend
Definition: access.hpp:648
ranges::sample_view
Definition: sample.hpp:77
ranges::cpp20::take_view
ranges::take_view< Rng > take_view
Definition: take.hpp:264
ranges::actions::shuffle_fn::operator()
constexpr auto operator()(Gen &gen) const
Definition: shuffle.hpp:36
arithmetic.hpp
meta::bind_front
An invocable that partially applies the invocable Fn by binding the arguments Ts to the front of Fn.
Definition: meta.hpp:770
ranges::actions::join_fn::join
constexpr action_closure< join_fn > join
Definition: join.hpp:57
ranges::max_element
borrowed_iterator_t< Rng > max_element(Rng &&rng, C pred=C{}, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: max_element.hpp:51
ranges::on
constexpr on_fn on
Definition: on.hpp:65
ranges::accumulate_fn
Definition: accumulate.hpp:28
none_of.hpp
ranges::views::take_while_base_fn::operator()
constexpr take_while_view< all_t< Rng >, Pred > operator()(Rng &&rng, Pred pred) const
Definition: take_while.hpp:137
ranges::rbegin
constexpr _rbegin_::fn rbegin
Definition: access.hpp:510
ranges::equal
constexpr bool equal(Rng0 &&rng0, Rng1 &&rng1, C pred=C{}, P0 proj0=P0{}, P1 proj1=P1{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: equal.hpp:131
ranges::views::set_difference_base_fn
Definition: set_algorithm.hpp:218
single.hpp
ranges::copy_n
copy_n_result< I, O > copy_n(I first, iter_difference_t< I > n, O out)
function template copy_n
Definition: copy_n.hpp:42
meta::lazy::max
defer< max, Ts... > max
Definition: meta.hpp:1813
ranges::ostream_iterator::operator=
ostream_iterator & operator=(U &&value)
Definition: stream_iterators.hpp:49
ranges::rotate
borrowed_subrange_t< Rng > rotate(Rng &&rng, I middle)
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: rotate.hpp:213
ranges::common_tuple
Definition: common_tuple.hpp:69
replace.hpp
ranges::views::delimit_base_fn
Definition: delimit.hpp:83
ranges::front_insert_iterator
Definition: insert_iterators.hpp:77
ranges::make_action_closure_fn
Definition: action.hpp:34
ranges::raw_buffer
Definition: memory.hpp:223
ranges::sample
sample_result< borrowed_iterator_t< IRng >, borrowed_iterator_t< ORng > > sample(IRng &&rng, ORng &&out, Gen &&gen=detail::get_random_engine())
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: sample.hpp:185
meta::id_t
_t< id< T > > id_t
An alias for type T. Useful in non-deduced contexts.
Definition: meta.hpp:536
ranges::views::const_fn
Definition: const.hpp:121
ranges::chunk_view_
Definition: chunk.hpp:75
ranges::ref_fn::operator()
reference_wrapper< T > operator()(T &t) const
Definition: reference_wrapper.hpp:117
adaptor.hpp
meta::in
not_< empty< find< L, T > >> in
A Boolean integral constant wrapper around true if there is at least one occurrence of T in L.
Definition: meta.hpp:2527
ranges::operator!=
constexpr bool operator!=(S const &left, basic_iterator< Cur > const &right)
Definition: basic_iterator.hpp:783
ranges::any_view::any_view
any_view(Rng &&rng)
Definition: any_view.hpp:555
meta::compose_
Compose the Invocables Fns in the parameter pack Ts.
Definition: meta.hpp:699
ranges::shuffle
borrowed_iterator_t< Rng > shuffle(Rng &&rng, Gen &&rand=detail::get_random_engine())
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: shuffle.hpp:67
meta::lazy::reverse_find
defer< reverse_find, L, T > reverse_find
Definition: meta.hpp:2033
meta::lazy::replace
defer< replace, T, U > replace
Definition: meta.hpp:2153
ranges::views::ref_fn
Definition: ref.hpp:92
ranges::reverse_view
Definition: range_fwd.hpp:626
meta::at_c
_t< detail::at_< L, N > > at_c
Return the N th element in the meta::list L.
Definition: meta.hpp:1555
ranges::views::indices_fn
Half-open range of indices: [from, to).
Definition: indices.hpp:30
exclusive_scan.hpp
ranges::distance
constexpr distance_fn distance
Definition: operations.hpp:459
in_place.hpp
ranges::upper_bound
I upper_bound(I first, S last, V const &val, C pred=C{}, P proj=P{})
function template upper_bound
Definition: upper_bound.hpp:43
meta::lazy::invoke
defer< invoke, Fn, Args... > invoke
Definition: meta.hpp:516
common_tuple.hpp
core.hpp
reverse.hpp
ranges::views::take_while_bind_fn
Definition: take_while.hpp:154
ranges::views::filter_fn
Definition: filter.hpp:96
variant.hpp
overload.hpp
ranges::common_iterator::operator=
common_iterator & operator=(common_iterator< I2, S2 > const &that)
Definition: common_iterator.hpp:133
ranges::views::adjacent_remove_if_base_fn::operator()
constexpr adjacent_remove_if_view< all_t< Rng >, Pred > operator()(Rng &&rng, Pred pred) const
Definition: adjacent_remove_if.hpp:155
is_sorted_until.hpp
ranges::for_each_n
borrowed_iterator_t< Rng > for_each_n(Rng &&rng, range_difference_t< Rng > n, F fun, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: for_each_n.hpp:52
nth_element.hpp
ranges::inner_product_fn
Definition: inner_product.hpp:40
meta::less
bool_<(T::type::value< U::type::value)> less
A Boolean integral constant wrapper around true if T::type::value is less than U::type::value; false,...
Definition: meta.hpp:253
ActionFn
ranges::actions::split_when_fn
Definition: split_when.hpp:35
ranges::replace_if
borrowed_iterator_t< Rng > replace_if(Rng &&rng, C pred, T const &new_value, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: replace_if.hpp:51
ranges::actions::drop_fn
Definition: drop.hpp:31
meta::any_of
not_< empty< find_if< L, Fn > >> any_of
A Boolean integral constant wrapper around true if invoke<Fn, A>::value is true for any element A in ...
Definition: meta.hpp:2491
meta::lazy::inherit
defer< inherit, L > inherit
Definition: meta.hpp:2567
ranges::invoke_result
Definition: invoke.hpp:148
meta::alignof_
meta::size_t< alignof(T)> alignof_
An alias that computes the alignment required for any instance of the type T.
Definition: meta.hpp:673
stable_partition.hpp
intersperse.hpp
ranges::prev_fn
Definition: operations.hpp:184
ranges::single_view
Definition: range_fwd.hpp:650
swap_ranges.hpp
find_first_of.hpp
ranges::operator>=
constexpr bool operator>=(basic_iterator< Left > const &left, basic_iterator< Right > const &right)
Definition: basic_iterator.hpp:869
ranges::adjacent_filter_view
Definition: range_fwd.hpp:473
ranges::views::cache1_fn
Definition: cache1.hpp:174
meta::not_
not_c< B::type::value > not_
Logically negate the integral constant-wrapped Boolean parameter.
Definition: meta.hpp:1056
meta::lazy::less
defer< less, T, U > less
Definition: meta.hpp:354
ranges::views::keys_fn::operator()
keys_range_view< all_t< Rng > > operator()(Rng &&rng) const
Definition: map.hpp:98
ranges::swap_ranges
swap_ranges_result< borrowed_iterator_t< Rng1 >, borrowed_iterator_t< Rng2 > > swap_ranges(Rng1 &&rng1, Rng2 &&rng2)
Definition: swap_ranges.hpp:76
ranges::is_indirectly_movable
Definition: access.hpp:143
ranges::views::take_last_base_fn::operator()
auto operator()(Rng &&rng, range_difference_t< Rng > n) const
Definition: take_last.hpp:34
stream_iterators.hpp
reverse_copy.hpp
ranges::push_heap
borrowed_iterator_t< Rng > push_heap(Rng &&rng, C pred=C{}, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: heap_algorithm.hpp:275
ranges::iter_ref
iterator_wrapper< I > iter_ref(I &i)
Definition: memory.hpp:211
ranges::views::view_closure
Definition: range_fwd.hpp:141
semiregular_box.hpp
meta::lazy::all_of
defer< all_of, L, Fn > all_of
Definition: meta.hpp:2480
ranges::make_subrange_fn
Definition: subrange.hpp:387
ranges::views::set_intersection_base_fn
Definition: set_algorithm.hpp:388
ranges::views::unique_base_fn::operator()
constexpr adjacent_filter_view< all_t< Rng >, logical_negate< C > > operator()(Rng &&rng, C pred={}) const
Definition: unique.hpp:39
ranges::views::stride_fn::operator()
constexpr auto operator()(Difference step) const
Definition: stride.hpp:326
ranges::views::addressof_fn::operator()
constexpr auto operator()(Rng &&rng) const CPP_AUTO_FUN_RETURNS_CONST_0(return transform(all(static_cast< Rng && >(rng))
ranges::make_compressed_pair_fn
Definition: compressed_pair.hpp:171
meta::make_integer_sequence
_t< detail::coerce_indices_< T, 0, make_index_sequence< static_cast< std::size_t >(N)> >> make_integer_sequence
Generate integer_sequence containing integer constants [0,1,2,...,N-1].
Definition: meta.hpp:448
ranges::split_when_view
split_when_view(Rng &&, Fun) -> split_when_view< views::all_t< Rng >, Fun >
ranges::invoke_fn
Definition: invoke.hpp:87
ranges::optional::explicit
constexpr explicit(!convertible_to< U, T >) optional(U &&v)
Definition: optional.hpp:504
search_n.hpp
sample.hpp
common_type.hpp
meta::repeat_n
repeat_n_c< N::type::value, T > repeat_n
Generate list<T,T,T...T> of size N arguments.
Definition: meta.hpp:1504
ranges::span
Definition: span.hpp:140
ranges::views::closed_iota_fn
Definition: iota.hpp:477
replace_if.hpp
ranges::iter_distance
constexpr iter_distance_fn iter_distance
Definition: operations.hpp:292
ranges::views::take_base_fn::operator()
take_view< all_t< Rng > > operator()(Rng &&rng, range_difference_t< Rng > n) const
Definition: take.hpp:232
meta::or_v
constexpr bool or_v
Logically OR together all the Boolean parameters.
Definition: meta.hpp:1094
insert.hpp
ranges::join_with_view
join_with_view(Rng &&, ValRng &&) -> join_with_view< views::all_t< Rng >, views::all_t< ValRng >>
ranges::views::sample_base_fn
Returns a random sample of a range of length size(range).
Definition: sample.hpp:206
ranges::make_heap
I make_heap(I first, S last, C pred=C{}, P proj=P{})
function template make_heap
Definition: heap_algorithm.hpp:358
ranges::chunk_view_::size
constexpr auto size() const
Definition: chunk.hpp:214
compare.hpp
ranges::aux::move
constexpr move_fn move
Definition: move.hpp:49
ranges::empty_view
Definition: range_fwd.hpp:537
ranges::sliding_view
Definition: sliding.hpp:54
ranges::actions::stable_sort_fn::stable_sort
constexpr action_closure< stable_sort_fn > stable_sort
Definition: stable_sort.hpp:55
ranges::views::iter_zip_with_fn
Definition: zip_with.hpp:389
meta::minus
std::integral_constant< decltype(T::type::value - U::type::value), T::type::value - U::type::value > minus
An integral constant wrapper around the result of subtracting the two wrapped integers T::type::value...
Definition: meta.hpp:202
ranges::trim_view
Definition: range_fwd.hpp:738
ranges::tokenize_view::end
iterator_t< Const > end() const
Definition: tokenize.hpp:78
meta::none_of
empty< find_if< L, Fn > > none_of
A Boolean integral constant wrapper around true if invoke<Fn, A>::value is false for all elements A i...
Definition: meta.hpp:2509
ranges::common_range_tag
Definition: concepts.hpp:241
action.hpp
ranges::make_view_closure_fn
Definition: view.hpp:78
indirect.hpp
meta::strict_or_
or_c< Bs::type::value... > strict_or_
Logically OR together all the integral constant-wrapped Boolean parameters, without short-circuiting.
Definition: meta.hpp:1105
ranges::make_subrange_fn::operator()
constexpr auto operator()(R &&r) const -> subrange< iterator_t< R >, sentinel_t< R >,(sized_range< R >||sized_sentinel_for< sentinel_t< R >, iterator_t< R >>) ? subrange_kind::sized :subrange_kind::unsized >
Definition: subrange.hpp:404
meta::lazy::transform
defer< transform, Args... > transform
Definition: meta.hpp:1468
meta::make_index_sequence
_t< detail::make_indices_< N, index_sequence< 0 >, detail::strategy_(1, N)> > make_index_sequence
Generate index_sequence containing integer constants [0,1,2,...,N-1].
Definition: meta.hpp:440
ranges::views::tokenize_base_fn
Definition: tokenize.hpp:99
ranges::front
constexpr front_fn front
Definition: operations.hpp:120
addressof.hpp
ranges::cbegin
constexpr _cbegin_::fn cbegin
Definition: access.hpp:347
ranges::common_pair::operator=
common_pair const & operator=(std::pair< F2, S2 > &&that) const noexcept(std::is_nothrow_assignable< F const &, F2 && >::value &&std::is_nothrow_assignable< S const &, S2 && >::value)
Definition: common_tuple.hpp:425
ranges::is_indirectly_swappable
Definition: access.hpp:268
ranges::iota_view
iota_view(From, To) -> iota_view< From, To >
meta::lazy::compose
defer< compose, Fns... > compose
Definition: meta.hpp:724
ranges::actions::drop_fn::operator()
constexpr auto operator()(Int n) const
Definition: drop.hpp:35
any.hpp
mismatch.hpp
ranges::views::transform_base_fn
Definition: transform.hpp:495
take_last.hpp
ranges::view_interface::at
constexpr range_reference_t< D< True > > at(range_difference_t< D< True >> n)
Returns a reference to the element at specified location pos, with bounds checking.
Definition: interface.hpp:320
meta::lazy::reverse_fold
defer< reverse_fold, L, State, Fn > reverse_fold
Definition: meta.hpp:1292
meta::drop_c
_t< detail::drop_< L, N > > drop_c
Return a new meta::list by removing the first N elements from L.
Definition: meta.hpp:1623
ranges::inplace_merge
borrowed_iterator_t< Rng > inplace_merge(Rng &&rng, iterator_t< Rng > middle, C pred=C{}, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: inplace_merge.hpp:275
ranges::adjacent_remove_if_view
Definition: range_fwd.hpp:481
ranges::partial_sort
borrowed_iterator_t< Rng > partial_sort(Rng &&rng, iterator_t< Rng > middle, C pred=C{}, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: partial_sort.hpp:54
ranges::range_cardinality
Definition: traits.hpp:123
ranges::max
constexpr T max(std::initializer_list< T > const &&rng, C pred=C{}, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: max.hpp:68
ranges::const_view::size
constexpr auto size()
Definition: const.hpp:93
ranges::views::cpp20_join_fn
Definition: join.hpp:514
ranges::accumulate_fn::operator()
T operator()(I first, S last, T init, Op op=Op{}, P proj=P{}) const
Definition: accumulate.hpp:35
ranges::dangling::dangling
constexpr dangling(T &&)
Implicit converting constructor; ignores argument.
Definition: dangling.hpp:36
span.hpp
merge.hpp
access.hpp
meta::nil_
An empty type.
Definition: meta.hpp:133
ranges::views::concat_fn
Definition: concat.hpp:408
stable_sort.hpp
meta::requires
requires(sizeof...(Ts) > 0) using lambda
For creating anonymous Invocables.
ranges::yield_fn
Definition: for_each.hpp:65
ranges::common_view
common_view(Rng &&) -> common_view< views::all_t< Rng >>
ranges::find
constexpr borrowed_iterator_t< Rng > find(Rng &&rng, V const &val, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: find.hpp:56
replace.hpp
ranges::sort
borrowed_iterator_t< Rng > sort(Rng &&rng, C pred=C{}, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: sort.hpp:202
ranges::set_union
set_union_result< borrowed_iterator_t< Rng1 >, borrowed_iterator_t< Rng2 >, O > set_union(Rng1 &&rng1, Rng2 &&rng2, O out, C pred=C{}, P1 proj1=P1{}, P2 proj2=P2{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: set_algorithm.hpp:119
ranges::multiplies
Definition: arithmetic.hpp:44
cache1.hpp
ranges::views::take_while_base_fn
Definition: take_while.hpp:131
ranges::advance
constexpr advance_fn advance
Definition: operations.hpp:144
ranges::views::trim_base_fn::operator()
constexpr trim_view< all_t< Rng >, Pred > operator()(Rng &&rng, Pred pred) const
Definition: trim.hpp:106
ranges::pop_heap
borrowed_iterator_t< Rng > pop_heap(Rng &&rng, C pred=C{}, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: heap_algorithm.hpp:336
numeric.hpp
unreachable_sentinel.hpp
utility.hpp
unique.hpp
ranges::views::drop_last_base_fn::operator()
constexpr auto operator()(Rng &&rng, range_difference_t< Rng > n) const -> drop_last_view< all_t< Rng >>
Definition: drop_last.hpp:347
ranges::common_pair
Definition: common_tuple.hpp:282
ranges::move_view
Definition: range_fwd.hpp:602
ranges::next_permutation
bool next_permutation(Rng &&rng, C pred=C{}, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: permutation.hpp:282
ranges::inner_product_fn::operator()
T operator()(I1 begin1, S1 end1, I2 begin2, S2 end2, T init, BOp1 bop1=BOp1{}, BOp2 bop2=BOp2{}, P1 proj1=P1{}, P2 proj2=P2{}) const
Definition: inner_product.hpp:47
meta::bit_or
std::integral_constant< decltype(T::type::value|U::type::value), T::type::value|U::type::value > bit_or
An integral constant wrapper around the result of bitwise-or'ing the two wrapped integers T::type::va...
Definition: meta.hpp:279
ranges::logical_negate::operator()
constexpr bool operator()(Args &&... args) &
Definition: not_fn.hpp:52
permutation.hpp
ranges::zip_view
Definition: range_fwd.hpp:781
split_when.hpp
meta::transform
_t< detail::transform_< Args... > > transform
Return a new meta::list constructed by transforming all the elements in L with the unary invocable Fn...
Definition: meta.hpp:1457
ranges::unbounded_view
Definition: range_fwd.hpp:746
ranges::distance_compare
constexpr distance_compare_fn distance_compare
Definition: operations.hpp:498
ranges::protect
constexpr protect_fn protect
Protect a callable so that it can be safely used in a bind expression without accidentally becoming a...
Definition: bind.hpp:117
ranges::push_front
insert_t< Cont, Rng > push_front(Cont &&cont, Rng &&rng)
Definition: push_front.hpp:54
meta::and_c
bool_<(true &&... &&Bs)> and_c
Logically AND together all the Boolean parameters.
Definition: meta.hpp:1068
meta::concat_
_t< detail::concat_< Ls... > > concat_
Concatenates several lists into a single list.
Definition: meta.hpp:1389
meta::max_
fold< pop_front< list< Ts... > >, front< list< Ts... > >, quote< detail::max_ > > max_
An integral constant wrapper around the maximum of Ts::type::value...
Definition: meta.hpp:1798
ranges::semiregular_box::operator()
constexpr decltype(auto) operator()(Args &&... args) &noexcept(is_nothrow_invocable_v< T &, Args... >)
Definition: semiregular_box.hpp:205
ranges::remove_if_view
Definition: remove_if.hpp:38
ranges::min
constexpr T min(std::initializer_list< T > const &&rng, C pred=C{}, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: min.hpp:68
ranges::adjacent_filter_view
adjacent_filter_view(Rng &&, Fun) -> adjacent_filter_view< views::all_t< Rng >, Fun >
meta::join
apply< quote< concat >, ListOfLists > join
Joins a list of lists into a single list.
Definition: meta.hpp:1410
ranges::any
Definition: any.hpp:63
ranges::views::const_fn::operator()
const_view< all_t< Rng > > operator()(Rng &&rng) const
Definition: const.hpp:125
ranges::ref
constexpr ref_fn ref
Definition: reference_wrapper.hpp:137
ranges::generate_n
generate_n_result< O, F > generate_n(O first, iter_difference_t< O > n, F fun)
function template generate_n
Definition: generate_n.hpp:40
ranges::intersperse_view
Definition: intersperse.hpp:39
drop_while.hpp
ranges::views::generate_n_fn
Definition: generate_n.hpp:92
ranges::drop_last_view
Definition: drop_last.hpp:117
meta::lazy::bind_back
defer< bind_back, Fn, Ts... > bind_back
Definition: meta.hpp:795
get.hpp
ranges::transformed
Definition: on.hpp:26
not_fn.hpp
concepts::is_swappable_with
Definition: swap.hpp:51
ranges::move_backward
move_backward_result< borrowed_iterator_t< Rng >, O > move_backward(Rng &&rng, O out)
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: move_backward.hpp:54
ranges::join_view
Definition: range_fwd.hpp:575
sort.hpp
push_back.hpp
ranges::iter_enumerate
constexpr iter_enumerate_fn iter_enumerate
Definition: operations.hpp:260
ranges::none_of
bool none_of(Rng &&rng, F pred, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: none_of.hpp:49
unstable_remove_if.hpp
ranges::cend
constexpr _cend_::fn cend
Definition: access.hpp:368
ranges::find_if_not
borrowed_iterator_t< Rng > find_if_not(Rng &&rng, F pred, P proj=P{})
This is an overloaded member function, provided for convenience. It differs from the above function o...
Definition: find_if_not.hpp:58
ranges::actions::action_closure
Definition: action.hpp:121
concepts
INTERNAL ONLY.
Definition: compare.hpp:27
ranges::bad_optional_access
Definition: optional.hpp:30
ranges::identity
Definition: identity.hpp:24
meta::lazy::cartesian_product
defer< cartesian_product, ListOfLists > cartesian_product
Definition: meta.hpp:3172
ranges::scope_exit
Definition: scope_exit.hpp:26
ranges::prev
constexpr prev_fn prev
Definition: operations.hpp:211
ranges::view_facade< iter_transform2_view< Rng1, Rng2, Fun >, detail::transform2_cardinality(range_cardinality< Rng1 >::value, range_cardinality< Rng2 >::value)>::end
constexpr auto end() -> detail::facade_sentinel_t< D >
Let d be static_cast<Derived &>(*this). Let e be std::as_const(d).end_cursor() if that expression is ...
Definition: facade.hpp:112
ranges::views::drop_last_fn::operator()
constexpr auto operator()(Int n) const
Definition: drop_last.hpp:361
meta::int_
std::integral_constant< int, I > int_
An integral constant wrapper for int.
Definition: meta.hpp:171
ranges::views::adjacent_filter_base_fn
Definition: adjacent_filter.hpp:150
copy_if.hpp
compose.hpp
ranges::composed
Definition: compose.hpp:28
ranges::views::cycle_fn
Returns an infinite range that endlessly repeats the source range.
Definition: cycle.hpp:219
replace_copy.hpp
tokenize.hpp
ranges::views::unbounded_fn::operator()
constexpr unbounded_view< I > operator()(I it) const
Definition: unbounded.hpp:55
unstable_remove_if.hpp
optional.hpp