Automatic Differentiation
 
Loading...
Searching...
No Matches
floor.hpp
Go to the documentation of this file.
1#ifndef STAN_MATH_PRIM_FUN_FLOOR_HPP
2#define STAN_MATH_PRIM_FUN_FLOOR_HPP
3
8#include <cmath>
9
10namespace stan {
11namespace math {
12
20struct floor_fun {
21 template <typename T>
22 static inline auto fun(const T& x) {
23 using std::floor;
24 return floor(x);
25 }
26};
27
36template <typename Container,
39 Container>* = nullptr,
41inline auto floor(const Container& x) {
43}
44
53template <typename Container,
56inline auto floor(const Container& x) {
58 x, [](const auto& v) { return v.array().floor(); });
59}
60
61} // namespace math
62} // namespace stan
63
64#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_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 > floor(const fvar< T > &x)
Definition floor.hpp:12
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)
Definition floor.hpp:22
Structure to wrap floor() so that it can be vectorized.
Definition floor.hpp:20