- constructor from strings once again accepts Lisp-style numbers like

[ginac.git] / ginac / numeric.cpp

diff --git a/ginac/numeric.cpp b/ginac/numeric.cpp
index f1a073aa61ebf37af51a4170ac3d3cbcfec5cdd0..f4dd738087de9fe0cc71b9f8a436694120b519e3 100644 (file)
--- a/ginac/numeric.cpp
+++ b/ginac/numeric.cpp
@@ -231,7 +231,7 @@ numeric::numeric(const char *s) : basic(TINFO_numeric)
     // ss should represent a simple sum like 2+5*I
     std::string ss(s);
     // make it safe by adding explicit sign
-    if (ss.at(0) != '+' && ss.at(0) != '-')
+    if (ss.at(0) != '+' && ss.at(0) != '-' && ss.at(0) != '#')
         ss = '+' + ss;
     std::string::size_type delim;
     do {
@@ -1504,7 +1504,7 @@ const numeric bernoulli(const numeric & nn)
     // return Bern;
     // 
     // But if somebody works with the n'th Bernoulli number she is likely to
-    // also need all previous Bernoulli numbers we need a complete remember
+    // also need all previous Bernoulli numbers. So we need a complete remember
     // table and above divide and conquer algorithm is not suited to build one
     // up.  The code below is adapted from Pari's function bernvec().
     //