1#ifndef STAN_MATH_PRIM_FUN_SQRT_HPP
2#define STAN_MATH_PRIM_FUN_SQRT_HPP
21template <
typename T, require_arithmetic_t<T>* =
nullptr>
33template <
typename T, require_complex_bt<std::is_arithmetic, T>* =
nullptr>
34inline auto sqrt(T&& x) {
47 static inline auto fun(T&& x) {
48 return sqrt(std::forward<T>(x));
59template <
typename Container, require_ad_container_t<Container>* =
nullptr>
60inline auto sqrt(Container&& x) {
62 std::forward<Container>(x));
73template <
typename Container,
76inline auto sqrt(Container&& x) {
78 std::forward<Container>(x), [](
auto&& v) {
return v.array().
sqrt(); });
92 auto at = 0.5 *
atan2(z.imag(), z.real());
93 return {m *
cos(at), m *
sin(at)};
require_t< container_type_check_base< is_container, base_type_t, TypeCheck, Check... > > require_container_bt
Require type satisfies is_container.
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...
Structure to wrap sqrt() so that it can be vectorized.