Automatic Differentiation
 
Loading...
Searching...
No Matches
is_tuple.hpp File Reference
#include <cstddef>
#include <stan/math/prim/meta/require_helpers.hpp>
#include <tuple>
#include <type_traits>

Go to the source code of this file.

Classes

struct  stan::math::internal::is_tuple_impl< Types >
 
struct  stan::math::internal::is_tuple_impl< std::tuple< Types... > >
 
struct  stan::math::is_tuple< T >
 
struct  stan::is_tuple_of_size< T, N, typename >
 Checks both that T is a tuple and that its size is N. More...
 
struct  stan::is_tuple_of_size< T, N, std::enable_if_t< stan::is_tuple_v< T > > >
 

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.
 

Typedefs

template<typename T >
using stan::math::require_tuple_t = require_t< is_tuple< std::decay_t< T > > >
 Require type satisfies is_tuple.
 
template<typename T >
using stan::math::require_not_tuple_t = require_not_t< is_tuple< std::decay_t< T > > >
 Require type does not satisfy is_tuple.
 
template<typename... Types>
using stan::math::require_all_tuple_t = require_all_t< is_tuple< std::decay_t< Types > >... >
 Require all of the types satisfy is_tuple.
 
template<typename... Types>
using stan::math::require_all_not_tuple_t = require_all_not_t< is_tuple< std::decay_t< Types > >... >
 Require none of the types satisfy is_tuple.
 
template<typename T >
using stan::is_tuple = math::is_tuple< T >
 

Variables

template<typename T >
constexpr bool stan::math::is_tuple_v = is_tuple<T>::value
 
template<typename T >
constexpr bool stan::is_tuple_v = math::is_tuple_v<T>
 
template<typename T , std::size_t N>
constexpr bool stan::is_tuple_of_size_v = stan::is_tuple_of_size<T, N>::value