*
* Implementation of GiNaC's initially known functions. */
+/*
+ * GiNaC Copyright (C) 1999 Johannes Gutenberg University Mainz, Germany
+ *
+ * This program is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation; either version 2 of the License, or
+ * (at your option) any later version.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program; if not, write to the Free Software
+ * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
+ */
+
#include <vector>
#include <stdexcept>
-#include "ginac.h"
+#include "inifcns.h"
+#include "ex.h"
+#include "constant.h"
+#include "lst.h"
+#include "matrix.h"
+#include "mul.h"
+#include "ncmul.h"
+#include "numeric.h"
+#include "power.h"
+#include "relational.h"
+#include "series.h"
+#include "symbol.h"
+
+namespace GiNaC {
//////////
// 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;
REGISTER_FUNCTION(Order, Order_eval, NULL, NULL, Order_series);
/** linear solve. */
-ex lsolve(ex eqns, ex symbols)
+ex lsolve(ex const &eqns, ex const &symbols)
{
// solve a system of linear equations
if (eqns.info(info_flags::relation_equal)) {
} 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();
}
}
/** non-commutative power. */
-ex ncpower(ex basis, unsigned exponent)
+ex ncpower(ex const &basis, unsigned exponent)
{
if (exponent==0) {
return exONE();
return ncmul(v,1);
}
+} // namespace GiNaC