1#ifndef STAN_MATH_PRIM_FUN_CEIL_HPP
2#define STAN_MATH_PRIM_FUN_CEIL_HPP
22 static inline auto fun(
const T& x) {
36template <
typename Container,
39 Container>* =
nullptr>
40inline auto ceil(
const Container& x) {
52template <
typename Container,
55inline auto ceil(
const Container& x) {
56 return apply_vector_unary<Container>::apply(
57 x, [](
const auto& v) {
return v.array().
ceil(); });
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 > ceil(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...
static auto fun(const T &x)
Structure to wrap ceil() so it can be vectorized.