;
#endif // def INLINE_EX_CONSTRUCTORS
+ /** Construct ex from string and a list of symbols. The input grammar is
+ * similar to the GiNaC output format. All symbols to be used in the
+ * expression must be specified in a lst in the second argument. Undefined
+ * symbols and other parser errors will throw an exception. */
+ ex(const string &s, const ex &l)
+#ifdef INLINE_EX_CONSTRUCTORS
+ {
+ construct_from_string_and_lst(s, l);
+#ifdef OBSCURE_CINT_HACK
+ update_last_created_or_assigned_bp();
+#endif // def OBSCURE_CINT_HACK
+ }
+#else
+;
+#endif // def INLINE_EX_CONSTRUCTORS
+
// functions overriding virtual functions from bases classes
// none
ex primpart(const symbol &x, const basic &cont) const { return primpart(x,ex(cont)); }
#endif // def CINT_CONVERSION_WORKAROUND
ex normal(int level = 0) const;
+ ex to_rational(lst &repl_lst) const;
ex smod(const numeric &xi) const;
numeric max_coefficient(void) const;
ex collect(const symbol & s) const;
void construct_from_long(long i);
void construct_from_ulong(unsigned long i);
void construct_from_double(double d);
+ void construct_from_string_and_lst(const string &s, const ex &l);
void makewriteable();
#ifdef OBSCURE_CINT_HACK
inline ex normal(const ex & thisex, int level=0)
{ return thisex.normal(level); }
+inline ex to_rational(const ex & thisex, lst & repl_lst)
+{ return thisex.to_rational(repl_lst); }
+
inline ex collect(const ex & thisex, const symbol & s)
{ return thisex.collect(s); }