is_real.hpp File Reference

#include <stan/math/prim/meta/conjunction.hpp>
#include <stan/math/prim/meta/disjunction.hpp>
#include <stan/math/prim/meta/is_complex.hpp>
#include <stan/math/prim/meta/is_fvar.hpp>
#include <stan/math/prim/meta/is_var.hpp>
#include <stan/math/prim/meta/is_var_or_arithmetic.hpp>
#include <stan/math/prim/meta/scalar_type.hpp>
#include <stan/math/prim/meta/value_type.hpp>
#include <stan/math/prim/meta/require_helpers.hpp>
#include <type_traits>

Go to the source code of this file.

Classes
struct	stan::is_real< T >
	Checks if decayed type is a var, fvar, or arithmetic. More...

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.

Typedefs
template<typename T >
using	stan::require_real_t = require_t< is_real< std::decay_t< T > > >
	Require type satisfies is_real.
template<typename T >
using	stan::require_not_real_t = require_not_t< is_real< std::decay_t< T > > >
	Require type does not satisfy is_real.
template<typename... Types>
using	stan::require_all_real_t = require_all_t< is_real< std::decay_t< Types > >... >
	Require all of the types satisfy is_real.
template<typename... Types>
using	stan::require_any_real_t = require_any_t< is_real< std::decay_t< Types > >... >
	Require any of the types satisfy is_real.
template<typename... Types>
using	stan::require_all_not_real_t = require_all_not_t< is_real< std::decay_t< Types > >... >
	Require none of the types satisfy is_real.
template<typename... Types>
using	stan::require_any_not_real_t = require_any_not_t< is_real< std::decay_t< Types > >... >
	Require at least one of the types do not satisfy is_real.

Variables
template<typename T >
constexpr bool	stan::is_real_v = is_real<T>::value