// dilogarithm
//////////
-ex Li2_eval(ex const & x)
+static ex Li2_eval(ex const & x)
{
if (x.is_zero())
return x;
// trilogarithm
//////////
-ex Li3_eval(ex const & x)
+static ex Li3_eval(ex const & x)
{
if (x.is_zero())
return x;
// factorial
//////////
-ex factorial_evalf(ex const & x)
+static ex factorial_evalf(ex const & x)
{
return factorial(x).hold();
}
-ex factorial_eval(ex const & x)
+static ex factorial_eval(ex const & x)
{
if (is_ex_exactly_of_type(x, numeric))
return factorial(ex_to_numeric(x));
// binomial
//////////
-ex binomial_evalf(ex const & x, ex const & y)
+static ex binomial_evalf(ex const & x, ex const & y)
{
return binomial(x, y).hold();
}
-ex binomial_eval(ex const & x, ex const &y)
+static ex binomial_eval(ex const & x, ex const &y)
{
if (is_ex_exactly_of_type(x, numeric) && is_ex_exactly_of_type(y, numeric))
return binomial(ex_to_numeric(x), ex_to_numeric(y));
// Order term function (for truncated power series)
//////////
-ex Order_eval(ex const & x)
+static ex Order_eval(ex const & x)
{
if (is_ex_exactly_of_type(x, numeric)) {
return Order(x).hold();
}
-ex Order_series(ex const & x, symbol const & s, ex const & point, int order)
+static ex Order_series(ex const & x, symbol const & s, ex const & point, int order)
{
// Just wrap the function into a series object
epvector new_seq;
} catch (runtime_error const & e) {
// probably singular matrix (or other error)
// return empty solution list
- cerr << e.what() << endl;
+ // cerr << e.what() << endl;
return lst();
}
return ncmul(v,1);
}
+/** Force inclusion of functions from initcns_gamma and inifcns_zeta
+ * for static lib (so ginsh will see them). */
+unsigned force_include_gamma = function_index_gamma;
+unsigned force_include_zeta = function_index_zeta;
+
} // namespace GiNaC