Automatic Differentiation
 
Loading...
Searching...
No Matches
cbrt.hpp
Go to the documentation of this file.
1#ifndef STAN_MATH_PRIM_FUN_CBRT_HPP
2#define STAN_MATH_PRIM_FUN_CBRT_HPP
3
6#include <cmath>
7
8namespace stan {
9namespace math {
10
11template <typename T, require_arithmetic_t<T>* = nullptr>
12inline auto cbrt(T&& x) {
13 return std::cbrt(x);
14}
15
23struct cbrt_fun {
24 template <typename T>
25 static inline auto fun(T&& x) {
26 return cbrt(std::forward<T>(x));
27 }
28};
29
38template <
39 typename T, require_not_var_matrix_t<T>* = nullptr,
41 require_container_t<T>* = nullptr>
42inline auto cbrt(T&& x) {
43 return apply_scalar_unary<cbrt_fun, T>::apply(std::forward<T>(x));
44}
45
46} // namespace math
47} // namespace stan
48
49#endif
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_var_matrix< std::decay_t< T > > > require_not_var_matrix_t
Require type does not satisfy is_var_matrix.
fvar< T > cbrt(const fvar< T > &x)
Return cube root of specified argument.
Definition cbrt.hpp:20
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(T &&x)
Definition cbrt.hpp:25
Structure to wrap cbrt() so it can be vectorized.
Definition cbrt.hpp:23