1#ifndef STAN_MATH_PRIM_FUN_SQUARE_HPP
2#define STAN_MATH_PRIM_FUN_SQUARE_HPP
26template <
typename T, require_arithmetic_t<T>* =
nullptr>
28 return std::pow(x, 2);
40 static inline auto fun(T&& x) {
41 return square(std::forward<T>(x));
52template <
typename Container, require_ad_container_t<Container>* =
nullptr>
55 std::forward<Container>(x));
66template <
typename Container,
68inline auto square(Container&& x) {
69 return apply_vector_unary<Container>::apply(
70 std::forward<Container>(x), [](
auto&& v) {
return v.array().
square(); });
require_t< container_type_check_base< is_container, base_type_t, TypeCheck, Check... > > require_container_bt
Require type satisfies is_container.
fvar< T > square(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 square() so that it can be vectorized.