Automatic Differentiation
 
Loading...
Searching...
No Matches
is_plain_type.hpp File Reference

Go to the source code of this file.

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 S >
using stan::is_plain_type = std::is_same< std::decay_t< S >, plain_type_t< S > >
 Checks whether the template type T is an assignable type.
 
template<typename T >
using stan::require_plain_type_t = require_t< is_plain_type< std::decay_t< T > > >
 Require type satisfies is_plain_type.
 
template<typename T >
using stan::require_not_plain_type_t = require_not_t< is_plain_type< std::decay_t< T > > >
 Require type does not satisfy is_plain_type.
 
template<typename... Types>
using stan::require_all_plain_type_t = require_all_t< is_plain_type< std::decay_t< Types > >... >
 Require all of the types satisfy is_plain_type.
 
template<typename... Types>
using stan::require_any_not_plain_type_t = require_any_not_t< is_plain_type< std::decay_t< Types > >... >
 Require any of the types satisfy is_plain_type.