Automatic Differentiation
 
Loading...
Searching...
No Matches
require_helpers.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<class Check >
using stan::require_t = std::enable_if_t< Check::value >
 If condition is true, template is enabled.
 
template<typename Check >
using stan::require_not_t = std::enable_if_t<!Check::value >
 If condition is false, template is disabled.
 
template<class... Checks>
using stan::require_all_t = std::enable_if_t< math::conjunction< Checks... >::value >
 If all conditions are true, template is enabled Returns a type void if all conditions are true and otherwise fails.
 
template<class... Checks>
using stan::require_any_t = std::enable_if_t< math::disjunction< Checks... >::value >
 If any condition is true, template is enabled.
 
template<class... Checks>
using stan::require_all_not_t = std::enable_if_t<!math::disjunction< Checks... >::value >
 If all conditions are false, template is enabled.
 
template<class... Checks>
using stan::require_any_not_t = std::enable_if_t<!math::conjunction< Checks... >::value >
 If any condition is false, template is enabled.
 
template<template< class... > class ContainerCheck, template< class... > class ValueCheck, template< class... > class TypeCheck, class... Check>
using stan::container_type_check_base = bool_constant< math::conjunction< ContainerCheck< std::decay_t< Check > >..., TypeCheck< ValueCheck< Check > >... >::value >
 Used as the base for checking whether a type is a container with an underlying scalar type.