1#ifndef STAN_MATH_PRIM_FUN_FABS_HPP
2#define STAN_MATH_PRIM_FUN_FABS_HPP
13template <
typename T, require_arithmetic_t<T>* =
nullptr>
18template <
typename T, require_complex_t<T>* =
nullptr>
19inline auto fabs(T x) {
20 return std::hypot(x.real(), x.imag());
32 static inline auto fun(
const T& x) {
45template <
typename Container,
49 Container>* =
nullptr,
51inline auto fabs(
const Container& x) {
63template <
typename Container,
65inline auto fabs(
const Container& x) {
67 x, [](
const auto& v) {
return v.array().
abs(); });
require_not_t< container_type_check_base< is_container, scalar_type_t, TypeCheck, Check... > > require_not_container_st
Require type does not satisfy is_container.
require_t< container_type_check_base< is_container, scalar_type_t, TypeCheck, Check... > > require_container_st
Require type satisfies is_container.
require_all_not_t< is_nonscalar_prim_or_rev_kernel_expression< std::decay_t< Types > >... > require_all_not_nonscalar_prim_or_rev_kernel_expression_t
Require none of the types satisfy is_nonscalar_prim_or_rev_kernel_expression.
require_not_t< is_stan_scalar< std::decay_t< T > > > require_not_stan_scalar_t
Require type does not satisfy is_stan_scalar.
require_not_t< is_var_matrix< std::decay_t< T > > > require_not_var_matrix_t
Require type does not satisfy is_var_matrix.
fvar< T > abs(const fvar< T > &x)
fvar< T > fabs(const fvar< T > &x)
The lgamma implementation in stan-math is based on either the reentrant safe lgamma_r implementation ...
Base template class for vectorization of unary scalar functions defined by a template class F to a sc...
static auto fun(const T &x)
Structure to wrap fabs() so that it can be vectorized.