X-Git-Url: https://www.ginac.de/ginac.git//ginac.git?p=ginac.git;a=blobdiff_plain;f=ginac%2Finifcns.cpp;h=70eaf758a104bf0564d78a647e1e0e4960fc42ec;hp=28cadfb174ecf16680dd18d37d9af8ad0f1af1d2;hb=83911244e28161e51b863851726e574c792b1f4c;hpb=4afb5bbe2c0b0a60928120a042997ba7d89e8f5c

diff --git a/ginac/inifcns.cpp b/ginac/inifcns.cpp
index 28cadfb1..70eaf758 100644
--- a/ginac/inifcns.cpp
+++ b/ginac/inifcns.cpp
@@ -3,7 +3,7 @@
  *  Implementation of GiNaC's initially known functions. */
 
 /*
- *  GiNaC Copyright (C) 1999 Johannes Gutenberg University Mainz, Germany
+ *  GiNaC Copyright (C) 1999-2000 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
@@ -33,19 +33,42 @@
 #include "numeric.h"
 #include "power.h"
 #include "relational.h"
-#include "series.h"
+#include "pseries.h"
 #include "symbol.h"
 #include "utils.h"
 
-#ifndef NO_GINAC_NAMESPACE
+#ifndef NO_NAMESPACE_GINAC
 namespace GiNaC {
-#endif // ndef NO_GINAC_NAMESPACE
+#endif // ndef NO_NAMESPACE_GINAC
+
+//////////
+// absolute value
+//////////
+
+static ex abs_evalf(const ex & x)
+{
+    BEGIN_TYPECHECK
+        TYPECHECK(x,numeric)
+    END_TYPECHECK(abs(x))
+    
+    return abs(ex_to_numeric(x));
+}
+
+static ex abs_eval(const ex & x)
+{
+    if (is_ex_exactly_of_type(x, numeric))
+        return abs(ex_to_numeric(x));
+    else
+        return abs(x).hold();
+}
+
+REGISTER_FUNCTION(abs, abs_eval, abs_evalf, NULL, NULL);
 
 //////////
 // dilogarithm
 //////////
 
-static ex Li2_eval(ex const & x)
+static ex Li2_eval(const ex & x)
 {
     if (x.is_zero())
         return x;
@@ -62,7 +85,7 @@ REGISTER_FUNCTION(Li2, Li2_eval, NULL, NULL, NULL);
 // trilogarithm
 //////////
 
-static ex Li3_eval(ex const & x)
+static ex Li3_eval(const ex & x)
 {
     if (x.is_zero())
         return x;
@@ -75,12 +98,12 @@ REGISTER_FUNCTION(Li3, Li3_eval, NULL, NULL, NULL);
 // factorial
 //////////
 
-static ex factorial_evalf(ex const & x)
+static ex factorial_evalf(const ex & x)
 {
     return factorial(x).hold();
 }
 
-static ex factorial_eval(ex const & x)
+static ex factorial_eval(const ex & x)
 {
     if (is_ex_exactly_of_type(x, numeric))
         return factorial(ex_to_numeric(x));
@@ -94,12 +117,12 @@ REGISTER_FUNCTION(factorial, factorial_eval, factorial_evalf, NULL, NULL);
 // binomial
 //////////
 
-static ex binomial_evalf(ex const & x, ex const & y)
+static ex binomial_evalf(const ex & x, const ex & y)
 {
     return binomial(x, y).hold();
 }
 
-static ex binomial_eval(ex const & x, ex const &y)
+static ex binomial_eval(const ex & x, const ex &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));
@@ -113,7 +136,7 @@ REGISTER_FUNCTION(binomial, binomial_eval, binomial_evalf, NULL, NULL);
 // Order term function (for truncated power series)
 //////////
 
-static ex Order_eval(ex const & x)
+static ex Order_eval(const ex & x)
 {
 	if (is_ex_exactly_of_type(x, numeric)) {
 
@@ -132,12 +155,12 @@ static ex Order_eval(ex const & x)
 	return Order(x).hold();
 }
 
-static ex Order_series(ex const & x, symbol const & s, ex const & point, int order)
+static ex Order_series(const ex & x, const symbol & s, const ex & point, int order)
 {
-	// Just wrap the function into a series object
+	// Just wrap the function into a pseries object
 	epvector new_seq;
 	new_seq.push_back(expair(Order(_ex1()), numeric(min(x.ldegree(s), order))));
-	return series(s, point, new_seq);
+	return pseries(s, point, new_seq);
 }
 
 REGISTER_FUNCTION(Order, Order_eval, NULL, NULL, Order_series);
@@ -146,7 +169,7 @@ REGISTER_FUNCTION(Order, Order_eval, NULL, NULL, Order_series);
 // Solve linear system
 //////////
 
-ex lsolve(ex const &eqns, ex const &symbols)
+ex lsolve(const ex &eqns, const ex &symbols)
 {
     // solve a system of linear equations
     if (eqns.info(info_flags::relation_equal)) {
@@ -165,7 +188,7 @@ ex lsolve(ex const &eqns, ex const &symbols)
     if (!eqns.info(info_flags::list)) {
         throw(std::invalid_argument("lsolve: 1st argument must be a list"));
     }
-    for (int i=0; i<eqns.nops(); i++) {
+    for (unsigned i=0; i<eqns.nops(); i++) {
         if (!eqns.op(i).info(info_flags::relation_equal)) {
             throw(std::invalid_argument("lsolve: 1st argument must be a list of equations"));
         }
@@ -173,7 +196,7 @@ ex lsolve(ex const &eqns, ex const &symbols)
     if (!symbols.info(info_flags::list)) {
         throw(std::invalid_argument("lsolve: 2nd argument must be a list"));
     }
-    for (int i=0; i<symbols.nops(); i++) {
+    for (unsigned i=0; i<symbols.nops(); i++) {
         if (!symbols.op(i).info(info_flags::symbol)) {
             throw(std::invalid_argument("lsolve: 2nd argument must be a list of symbols"));
         }
@@ -184,10 +207,10 @@ ex lsolve(ex const &eqns, ex const &symbols)
     matrix rhs(eqns.nops(),1);
     matrix vars(symbols.nops(),1);
     
-    for (int r=0; r<eqns.nops(); r++) {
+    for (unsigned r=0; r<eqns.nops(); r++) {
         ex eq=eqns.op(r).op(0)-eqns.op(r).op(1); // lhs-rhs==0
         ex linpart=eq;
-        for (int c=0; c<symbols.nops(); c++) {
+        for (unsigned c=0; c<symbols.nops(); c++) {
             ex co=eq.coeff(ex_to_symbol(symbols.op(c)),1);
             linpart -= co*symbols.op(c);
             sys.set(r,c,co);
@@ -197,7 +220,7 @@ ex lsolve(ex const &eqns, ex const &symbols)
     }
     
     // test if system is linear and fill vars matrix
-    for (int i=0; i<symbols.nops(); i++) {
+    for (unsigned i=0; i<symbols.nops(); i++) {
         vars.set(i,0,symbols.op(i));
         if (sys.has(symbols.op(i))) {
             throw(std::logic_error("lsolve: system is not linear"));
@@ -211,7 +234,7 @@ ex lsolve(ex const &eqns, ex const &symbols)
     matrix solution;
     try {
         solution=sys.fraction_free_elim(vars,rhs);
-    } catch (runtime_error const & e) {
+    } catch (const runtime_error & e) {
         // probably singular matrix (or other error)
         // return empty solution list
         // cerr << e.what() << endl;
@@ -230,7 +253,7 @@ ex lsolve(ex const &eqns, ex const &symbols)
     
     // return list of the form lst(var1==sol1,var2==sol2,...)
     lst sollist;
-    for (int i=0; i<symbols.nops(); i++) {
+    for (unsigned i=0; i<symbols.nops(); i++) {
         sollist.append(symbols.op(i)==solution(i,0));
     }
     
@@ -238,7 +261,7 @@ ex lsolve(ex const &eqns, ex const &symbols)
 }
 
 /** non-commutative power. */
-ex ncpower(ex const &basis, unsigned exponent)
+ex ncpower(const ex &basis, unsigned exponent)
 {
     if (exponent==0) {
         return _ex1();
@@ -258,6 +281,6 @@ ex ncpower(ex const &basis, unsigned exponent)
 unsigned force_include_gamma = function_index_gamma;
 unsigned force_include_zeta1 = function_index_zeta1;
 
-#ifndef NO_GINAC_NAMESPACE
+#ifndef NO_NAMESPACE_GINAC
 } // namespace GiNaC
-#endif // ndef NO_GINAC_NAMESPACE
+#endif // ndef NO_NAMESPACE_GINAC