1#ifndef STAN_MATH_PRIM_FUN_ANY_HPP
2#define STAN_MATH_PRIM_FUN_ANY_HPP
20template <
typename T, require_t<std::is_convertible<T,
bool>>* =
nullptr>
21constexpr inline bool any(T x) {
35template <
typename ContainerT,
37inline bool any(
const ContainerT& x) {
42template <
typename... Types>
43inline bool any(
const std::tuple<Types...>& x);
56template <
typename InnerT>
57inline bool any(
const std::vector<InnerT>& x) {
58 return std::any_of(x.begin(), x.end(), [](
const auto& i) { return any(i); });
70template <
typename... Types>
71inline bool any(
const std::tuple<Types...>& x) {
72 bool any_true =
false;
74 [&any_true](
const auto& i) {
75 any_true = any_true ||
any(i);
require_t< container_type_check_base< is_eigen, scalar_type_t, TypeCheck, Check... > > require_eigen_st
Require type satisfies is_eigen.
constexpr auto for_each(F &&f, T &&t)
Apply a function to each element of a tuple.
constexpr bool any(T x)
Return true if any values in the input are true.
The lgamma implementation in stan-math is based on either the reentrant safe lgamma_r implementation ...