Go to the source code of this file.
|
| namespace | stan |
| | The lgamma implementation in stan-math is based on either the reentrant safe lgamma_r implementation from C or the boost::math::lgamma implementation.
|
| |
| namespace | stan::math |
| | Matrices and templated mathematical functions.
|
| |
| namespace | stan::math::internal |
| | A comparator that works for any container type that has the brackets operator.
|
| |
|
| template<typename T , typename... Ptrs, require_all_kernel_expressions_t< T, Ptrs... > * = nullptr> |
| auto | stan::math::holder_cl (T &&a, Ptrs *... ptrs) |
| | Constructs a no-op operation that also holds pointer to some other expressions, allocated on heap.
|
| |
| template<typename T , std::size_t... Is, typename... Args> |
| auto | stan::math::internal::make_holder_cl_impl_step2 (T &&expr, std::index_sequence< Is... >, const std::tuple< Args *... > &ptrs) |
| | Second step in implementation of construction holder_cl from a functor.
|
| |
| template<typename T , std::size_t... Is, typename... Args> |
| auto | stan::math::internal::make_holder_cl_impl_step1 (const T &func, std::index_sequence< Is... >, Args &&... args) |
| | First step in implementation of construction holder_cl from a functor.
|
| |
| template<typename T , typename... Args, require_all_kernel_expressions_t< decltype(std::declval< T >()(std::declval< Args & >()...)), Args... > * = nullptr> |
| auto | stan::math::make_holder_cl (const T &func, Args &&... args) |
| | Constructs an expression from given arguments using given functor.
|
| |