filter_map.hpp File Reference

#include <stan/math/prim/functor/apply.hpp>
#include <stan/math/prim/functor/make_holder_tuple.hpp>
#include <stan/math/prim/functor/tuple_concat.hpp>
#include <stan/math/prim/meta.hpp>
#include <functional>
#include <tuple>
#include <utility>

Go to the source code of this file.

Classes
struct	stan::math::internal::inspect_tuple< Filter, T >
struct	stan::math::internal::inspect_tuple< Filter, std::tuple< Types... > >
struct	stan::math::internal::inspect_tuple< Filter, std::vector< T, VecArgs... > >

Namespaces
namespace	stan
	The lgamma implementation in stan-math is based on either the reentrant safe lgamma_r implementation from C or the boost::math::lgamma implementation.
namespace	stan::math
	Matrices and templated mathematical functions.
namespace	stan::math::internal
	A comparator that works for any container type that has the brackets operator.

Functions
template<template< typename... > class Filter, bool InVector = false, bool InTuple = false, typename F , typename T >
constexpr decltype(auto)	stan::math::internal::filter_map (F &&f, T &&x)
	Filter a tuple and apply a functor to each element that passes the filter.
template<template< typename... > class Filter, typename F , typename T , require_tuple_t< T > * = nullptr>
constexpr decltype(auto)	stan::math::filter_map (F &&f, T &&x)
	Filter a tuple and apply a functor to each element that passes the filter.

Variables
template<template< typename... > class Filter, typename T >
constexpr bool	stan::math::internal::inspect_tuple_v = internal::inspect_tuple<Filter, std::decay_t<T>>::value
	Check if a tuple or type contains a tuple that passes the filter.