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_bt<std::is_arithmetic, T>* =
nullptr>
19inline auto fabs(T&& x) {
20 return std::hypot(x.real(), x.imag());
32 static inline auto fun(T&& x) {
33 return fabs(std::forward<T>(x));
45template <
typename Container,
49 Container>* =
nullptr,
52inline auto fabs(Container&& x) {
54 std::forward<Container>(x));
65template <
typename Container,
67inline auto fabs(Container&& x) {
69 std::forward<Container>(x), [](
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_t< is_container< std::decay_t< T > > > require_container_t
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...
Structure to wrap fabs() so that it can be vectorized.