Automatic Differentiation
 
Loading...
Searching...
No Matches
round.hpp
Go to the documentation of this file.
1#ifndef STAN_MATH_PRIM_FUN_ROUND_HPP
2#define STAN_MATH_PRIM_FUN_ROUND_HPP
3
8#include <cmath>
9
10namespace stan {
11namespace math {
12
13template <typename T, require_arithmetic_t<T>* = nullptr>
14inline auto round(T&& x) {
15 return std::round(x);
16}
17
25struct round_fun {
26 template <typename T>
27 static inline auto fun(T&& x) {
28 return round(std::forward<T>(x));
29 }
30};
31
39template <typename Container,
42 Container>* = nullptr,
44inline auto round(Container&& x) {
46 std::forward<Container>(x));
47}
48
57template <typename Container,
59inline auto round(Container&& x) {
61 std::forward<Container>(x), [](auto&& v) { return v.array().round(); });
62}
63
64} // namespace math
65} // namespace stan
66
67#endif
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.
fvar< T > round(const fvar< T > &x)
Return the closest integer to the specified argument, with halfway cases rounded away from zero.
Definition round.hpp:24
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 round.hpp:27
Structure to wrap round() so it can be vectorized.
Definition round.hpp:25