* This file must be processed with yacc/bison. */
/*
- * GiNaC Copyright (C) 1999-2003 Johannes Gutenberg University Mainz, Germany
+ * GiNaC Copyright (C) 1999-2004 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
%token T_EQUAL T_NOTEQ T_LESSEQ T_GREATEREQ
%token T_QUIT T_WARRANTY T_PRINT T_IPRINT T_PRINTLATEX T_PRINTCSRC T_TIME
-%token T_XYZZY T_INVENTORY T_LOOK T_SCORE
+%token T_XYZZY T_INVENTORY T_LOOK T_SCORE T_COMPLEX_SYMBOLS T_REAL_SYMBOLS
/* Operator precedence and associativity */
%right '='
cout << (syms.size() > 350 ? 350 : syms.size());
cout << " out of a possible 350.\n";
}
+ | T_REAL_SYMBOLS { symboltype = domain::real; }
+ | T_COMPLEX_SYMBOLS { symboltype = domain::complex; }
| T_TIME {getrusage(RUSAGE_SELF, &start_time);} '(' exp ')' {
getrusage(RUSAGE_SELF, &end_time);
cout << (end_time.ru_utime.tv_sec - start_time.ru_utime.tv_sec) +
static ex f_collect(const exprseq &e) {return e[0].collect(e[1]);}
static ex f_collect_distributed(const exprseq &e) {return e[0].collect(e[1], true);}
static ex f_collect_common_factors(const exprseq &e) {return collect_common_factors(e[0]);}
+static ex f_convert_H_to_Li(const exprseq &e) {return convert_H_to_Li(e[0], e[1]);}
static ex f_degree(const exprseq &e) {return e[0].degree(e[1]);}
static ex f_denom(const exprseq &e) {return e[0].denom();}
static ex f_eval1(const exprseq &e) {return e[0].eval();}
static ex f_charpoly(const exprseq &e)
{
CHECK_ARG(0, matrix, charpoly);
- CHECK_ARG(1, symbol, charpoly);
- return ex_to<matrix>(e[0]).charpoly(ex_to<symbol>(e[1]));
+ return ex_to<matrix>(e[0]).charpoly(e[1]);
}
static ex f_coeff(const exprseq &e)
static ex f_content(const exprseq &e)
{
- CHECK_ARG(1, symbol, content);
- return e[0].content(ex_to<symbol>(e[1]));
+ return e[0].content(e[1]);
}
static ex f_decomp_rational(const exprseq &e)
{
- CHECK_ARG(1, symbol, decomp_rational);
- return decomp_rational(e[0], ex_to<symbol>(e[1]));
+ return decomp_rational(e[0], e[1]);
}
static ex f_determinant(const exprseq &e)
return found;
}
+static ex f_integer_content(const exprseq &e)
+{
+ return e[0].integer_content();
+}
+
static ex f_inverse(const exprseq &e)
{
CHECK_ARG(0, matrix, inverse);
static ex f_prem(const exprseq &e)
{
- CHECK_ARG(2, symbol, prem);
- return prem(e[0], e[1], ex_to<symbol>(e[2]));
+ return prem(e[0], e[1], e[2]);
}
static ex f_primpart(const exprseq &e)
{
- CHECK_ARG(1, symbol, primpart);
- return e[0].primpart(ex_to<symbol>(e[1]));
+ return e[0].primpart(e[1]);
}
static ex f_quo(const exprseq &e)
{
- CHECK_ARG(2, symbol, quo);
- return quo(e[0], e[1], ex_to<symbol>(e[2]));
+ return quo(e[0], e[1], e[2]);
+}
+
+static ex f_rank(const exprseq &e)
+{
+ CHECK_ARG(0, matrix, rank);
+ return ex_to<matrix>(e[0]).rank();
}
static ex f_rem(const exprseq &e)
{
- CHECK_ARG(2, symbol, rem);
- return rem(e[0], e[1], ex_to<symbol>(e[2]));
+ return rem(e[0], e[1], e[2]);
+}
+
+static ex f_resultant(const exprseq &e)
+{
+ CHECK_ARG(2, symbol, resultant);
+ return resultant(e[0], e[1], ex_to<symbol>(e[2]));
}
static ex f_series(const exprseq &e)
static ex f_sprem(const exprseq &e)
{
- CHECK_ARG(2, symbol, sprem);
- return sprem(e[0], e[1], ex_to<symbol>(e[2]));
+ return sprem(e[0], e[1], e[2]);
}
static ex f_sqrfree2(const exprseq &e)
static ex f_unit(const exprseq &e)
{
- CHECK_ARG(1, symbol, unit);
- return e[0].unit(ex_to<symbol>(e[1]));
+ return e[0].unit(e[1]);
}
static ex f_dummy(const exprseq &e)
{"collect_common_factors", f_collect_common_factors, 1},
{"collect_distributed", f_collect_distributed, 2},
{"content", f_content, 2},
+ {"convert_H_to_Li", f_convert_H_to_Li, 2},
{"decomp_rational", f_decomp_rational, 2},
{"degree", f_degree, 2},
{"denom", f_denom, 1},
{"find", f_find, 2},
{"gcd", f_gcd, 2},
{"has", f_has, 2},
+ {"integer_content", f_integer_content, 1},
{"inverse", f_inverse, 1},
{"iprint", f_dummy, 0}, // for Tab-completion
{"is", f_is, 1},
{"print_csrc", f_dummy, 0}, // for Tab-completion
{"print_latex", f_dummy, 0}, // for Tab-completion
{"quo", f_quo, 3},
+ {"rank", f_rank, 1},
{"rem", f_rem, 3},
+ {"resultant", f_resultant, 3},
{"series", f_series, 3},
{"sprem", f_sprem, 3},
{"sqrfree", f_sqrfree1, 1},
{"sinh", "hyperbolic sine function"},
{"tan", "tangent function"},
{"tanh", "hyperbolic tangent function"},
- {"zeta", "zeta function\nzeta(x) is Riemann's zeta function, zeta(n,x) its nth derivative"},
+ {"zeta", "zeta function\nzeta(x) is Riemann's zeta function, zetaderiv(n,x) its nth derivative.\nIf x is a GiNaC::lst, it is a multiple zeta value\nzeta(x,s) is an alternating Euler sum"},
{"Li2", "dilogarithm"},
{"Li3", "trilogarithm"},
+ {"Li", "(multiple) polylogarithm"},
+ {"S", "Nielsen's generalized polylogarithm"},
+ {"H", "harmonic polylogarithm"},
{"Order", "order term function (for truncated power series)"},
{"Derivative", "inert differential operator"},
{NULL, NULL} // End marker
void greeting(void)
{
cout << "ginsh - GiNaC Interactive Shell (" << PACKAGE << " V" << VERSION << ")" << endl;
- cout << " __, _______ Copyright (C) 1999-2003 Johannes Gutenberg University Mainz,\n"
+ cout << " __, _______ Copyright (C) 1999-2004 Johannes Gutenberg University Mainz,\n"
<< " (__) * | Germany. This is free software with ABSOLUTELY NO WARRANTY.\n"
<< " ._) i N a C | You are welcome to redistribute it under certain conditions.\n"
<< "<-------------' For details type `warranty;'.\n" << endl;
git://www.ginac.de / ginac.git / blobdiff