1#ifndef STAN_MATH_PRIM_FUN_SQRT_HPP
2#define STAN_MATH_PRIM_FUN_SQRT_HPP
23 static inline auto fun(
const T& x) {
36template <
typename Container,
39 Container>* =
nullptr,
41inline auto sqrt(
const Container& x) {
53template <
typename Container,
56inline auto sqrt(
const Container& x) {
58 x, [](
const auto& v) {
return v.array().
sqrt(); });
72 auto at = 0.5 *
atan2(z.imag(), z.real());
73 return {m *
cos(at), m *
sin(at)};
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_var_matrix< std::decay_t< T > > > require_not_var_matrix_t
Require type does not satisfy is_var_matrix.
std::complex< V > complex_sqrt(const std::complex< V > &z)
Return the square root of the complex argument.
fvar< T > hypot(const fvar< T > &x1, const fvar< T > &x2)
Return the length of the hypotenuse of a right triangle with opposite and adjacent side lengths given...
fvar< T > sin(const fvar< T > &x)
fvar< T > atan2(const fvar< T > &x1, const fvar< T > &x2)
fvar< T > sqrt(const fvar< T > &x)
fvar< T > cos(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 sqrt() so that it can be vectorized.