- added numer_denom()

[ginac.git] / ginsh / ginsh_parser.yy

diff --git a/ginsh/ginsh_parser.yy b/ginsh/ginsh_parser.yy
index ee4e4360c161eb17db53a43e8289c4e37da97506..ce27972dbfc0f51385c9a31a3622d1d20ff03266 100644 (file)
--- a/ginsh/ginsh_parser.yy
+++ b/ginsh/ginsh_parser.yy
@@ -44,7 +44,7 @@
 
 // Original readline settings
 static int orig_completion_append_character;
-#if (GINAC_RLVERSION_MAJOR < 4) || (GINAC_RLVERSION_MAJOR == 4 && GINAC_RLVERSION_MINOR < 2)
+#if (GINAC_RL_VERSION_MAJOR < 4) || (GINAC_RL_VERSION_MAJOR == 4 && GINAC_RL_VERSION_MINOR < 2)
 static char *orig_basic_word_break_characters;
 #else
 static const char *orig_basic_word_break_characters;
@@ -274,19 +274,28 @@ static void push(const ex &e)
  *  Built-in functions
  */
 
+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_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_evalf1(const exprseq &e) {return e[0].evalf();}
 static ex f_expand(const exprseq &e) {return e[0].expand();}
 static ex f_gcd(const exprseq &e) {return gcd(e[0], e[1]);}
+static ex f_has(const exprseq &e) {return e[0].has(e[1]) ? ex(1) : ex(0);}
 static ex f_lcm(const exprseq &e) {return lcm(e[0], e[1]);}
+static ex f_lcoeff(const exprseq &e) {return e[0].lcoeff(e[1]);}
+static ex f_ldegree(const exprseq &e) {return e[0].ldegree(e[1]);}
 static ex f_lsolve(const exprseq &e) {return lsolve(e[0], e[1]);}
 static ex f_nops(const exprseq &e) {return e[0].nops();}
 static ex f_normal1(const exprseq &e) {return e[0].normal();}
 static ex f_numer(const exprseq &e) {return e[0].numer();}
+static ex f_numer_denom(const exprseq &e) {return e[0].numer_denom();}
 static ex f_pow(const exprseq &e) {return pow(e[0], e[1]);}
 static ex f_sqrt(const exprseq &e) {return sqrt(e[0]);}
+static ex f_sqrfree1(const exprseq &e) {return sqrfree(e[0]);}
 static ex f_subs2(const exprseq &e) {return e[0].subs(e[1]);}
+static ex f_tcoeff(const exprseq &e) {return e[0].tcoeff(e[1]);}
 
 #define CHECK_ARG(num, type, fcn) if (!is_ex_of_type(e[num], type)) throw(std::invalid_argument("argument " #num " to " #fcn "() must be a " #type))
 
@@ -303,27 +312,12 @@ static ex f_coeff(const exprseq &e)
        return e[0].coeff(e[1], ex_to_numeric(e[2]).to_int());
 }
 
-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_content(const exprseq &e)
 {
        CHECK_ARG(1, symbol, content);
        return e[0].content(ex_to_symbol(e[1]));
 }
 
-static ex f_degree(const exprseq &e)
-{
-       return e[0].degree(e[1]);
-}
-
 static ex f_determinant(const exprseq &e)
 {
        CHECK_ARG(0, matrix, determinant);
@@ -373,11 +367,6 @@ static ex f_evalf2(const exprseq &e)
        return e[0].evalf(ex_to_numeric(e[1]).to_int());
 }
 
-static ex f_has(const exprseq &e)
-{
-       return e[0].has(e[1]) ? ex(1) : ex(0);
-}
-
 static ex f_inverse(const exprseq &e)
 {
        CHECK_ARG(0, matrix, inverse);
@@ -390,14 +379,13 @@ static ex f_is(const exprseq &e)
        return (bool)ex_to_relational(e[0]) ? ex(1) : ex(0);
 }
 
-static ex f_lcoeff(const exprseq &e)
+static ex f_match(const exprseq &e)
 {
-       return e[0].lcoeff(e[1]);
-}
-
-static ex f_ldegree(const exprseq &e)
-{
-       return e[0].ldegree(e[1]);
+       lst repl_lst;
+       if (e[0].match(e[1], repl_lst))
+               return repl_lst;
+       else
+               return fail();
 }
 
 static ex f_normal2(const exprseq &e)
@@ -445,11 +433,6 @@ static ex f_series(const exprseq &e)
        return e[0].series(e[1], ex_to_numeric(e[2]).to_int());
 }
 
-static ex f_sqrfree1(const exprseq &e)
-{
-       return sqrfree(e[0]);
-}
-
 static ex f_sqrfree2(const exprseq &e)
 {
        CHECK_ARG(1, lst, sqrfree);
@@ -463,11 +446,6 @@ static ex f_subs3(const exprseq &e)
        return e[0].subs(ex_to_lst(e[1]), ex_to_lst(e[2]));
 }
 
-static ex f_tcoeff(const exprseq &e)
-{
-       return e[0].tcoeff(e[1]);
-}
-
 static ex f_trace(const exprseq &e)
 {
        CHECK_ARG(0, matrix, trace);
@@ -530,10 +508,12 @@ static const fcn_init builtin_fcns[] = {
        {"lcoeff", fcn_desc(f_lcoeff, 2)},
        {"ldegree", fcn_desc(f_ldegree, 2)},
        {"lsolve", fcn_desc(f_lsolve, 2)},
+       {"match", fcn_desc(f_match, 2)},
        {"nops", fcn_desc(f_nops, 1)},
        {"normal", fcn_desc(f_normal1, 1)},
        {"normal", fcn_desc(f_normal2, 2)},
        {"numer", fcn_desc(f_numer, 1)},
+       {"numer_denom", fcn_desc(f_numer_denom, 1)},
        {"op", fcn_desc(f_op, 2)},
        {"pow", fcn_desc(f_pow, 2)},
        {"prem", fcn_desc(f_prem, 3)},
@@ -706,7 +686,7 @@ static char **fcn_completion(char *text, int start, int end)
                rl_completion_append_character = orig_completion_append_character;
                rl_basic_word_break_characters = orig_basic_word_break_characters;
                rl_completer_word_break_characters = rl_basic_word_break_characters;
-#if (GINAC_RLVERSION_MAJOR < 4) || (GINAC_RLVERSION_MAJOR == 4 && GINAC_RLVERSION_MINOR < 2)
+#if (GINAC_RL_VERSION_MAJOR < 4) || (GINAC_RL_VERSION_MAJOR == 4 && GINAC_RL_VERSION_MINOR < 2)
                return completion_matches(text, (CPFunction *)filename_completion_function);
 #else
                return rl_completion_matches(text, (CPFunction *)rl_filename_completion_function);
@@ -716,7 +696,7 @@ static char **fcn_completion(char *text, int start, int end)
                rl_completion_append_character = '(';
                rl_basic_word_break_characters = " \t\n\"#$%&'()*+,-./:;<=>?@[\\]^`{|}~";
                rl_completer_word_break_characters = rl_basic_word_break_characters;
-#if (GINAC_RLVERSION_MAJOR < 4) || (GINAC_RLVERSION_MAJOR == 4 && GINAC_RLVERSION_MINOR < 2)
+#if (GINAC_RL_VERSION_MAJOR < 4) || (GINAC_RL_VERSION_MAJOR == 4 && GINAC_RL_VERSION_MINOR < 2)
                return completion_matches(text, (CPFunction *)fcn_generator);
 #else
                return rl_completion_matches(text, (CPFunction *)fcn_generator);