falling_factorial.hpp File Reference

#include <stan/math/prim/meta.hpp>
#include <stan/math/prim/err.hpp>
#include <stan/math/prim/fun/boost_policy.hpp>
#include <stan/math/prim/functor/apply_scalar_binary.hpp>
#include <boost/math/special_functions/factorials.hpp>

Go to the source code of this file.

Namespaces
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.

Functions
template<typename T , require_arithmetic_t< T > * = nullptr>
return_type_t< T >	stan::math::falling_factorial (const T &x, int n)
	Return the falling factorial function evaluated at the inputs.
template<typename T1 , typename T2 , require_any_container_t< T1, T2 > * = nullptr, require_all_not_var_matrix_t< T1, T2 > * = nullptr>
auto	stan::math::falling_factorial (T1 &&a, T2 &&b)
	Enables the vectorized application of the falling factorial function, when the first and/or second arguments are containers.