added integer_content() function

diff --git a/ginsh/ginsh.1.in b/ginsh/ginsh.1.in
index 21db17e61a2344378ac5dfced2a164888aa1403b..f964920d12052dbcd33b7c0a5024e8f049e32e79 100644 (file)
--- a/ginsh/ginsh.1.in
+++ b/ginsh/ginsh.1.in
@@ -299,6 +299,9 @@ detail here. Please refer to the GiNaC documentation.
 .BI has( expression ", " pattern )
 \- returns "1" if the first expression contains the pattern as a subexpression, "0" otherwise
 .br
 .BI has( expression ", " pattern )
 \- returns "1" if the first expression contains the pattern as a subexpression, "0" otherwise
 .br

+.BI integer_content( expression )
+\- integer content of a polynomial
+.br

 .BI inverse( matrix )
 \- inverse of a matrix
 .br
 .BI inverse( matrix )
 \- inverse of a matrix
 .br

diff --git a/ginsh/ginsh_parser.yy b/ginsh/ginsh_parser.yy
index be65cf8e0f8f2a81d32d438b1edfdb39362d19a0..2c99794548e9303b091084227774d0f79027ce9d 100644 (file)
--- a/ginsh/ginsh_parser.yy
+++ b/ginsh/ginsh_parser.yy
@@ -404,6 +404,11 @@ static ex f_find(const exprseq &e)
        return found;
 }
 
        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_inverse(const exprseq &e)
 {
        CHECK_ARG(0, matrix, inverse);


@@ -571,6 +576,7 @@ static const fcn_init builtin_fcns[] = {
        {"find", f_find, 2},
        {"gcd", f_gcd, 2},
        {"has", f_has, 2},
        {"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},
        {"inverse", f_inverse, 1},
        {"iprint", f_dummy, 0},      // for Tab-completion
        {"is", f_is, 1},