WebSVN – wimsdev – Diff – /trunk/wims/src/Misc/sigdigits/sigdigits.c

 Treats a number as string array : no numerical evaluation !
 (pfffff...)
 example
 !exec sigdigits 1.23 1.230 1.2300 1.23e5 1.23*10^5 1.2300e5 01.23*10^5 1.2.3.4
-,2,1,2,1,0,1
+,1,2,1,0,1
-,2,1,3,1,0,0
+,1,3,1,0,1
-,2,1,4,1,0,1
+,1,4,1,0,1
-,2,1,2,10,5,1
+,1,2,10,5,1
-,2,1,2,10,5,1
+,1,2,10,5,1
-,4,1,4,10,5,1
+,1,4,10,5,1
-,2,2,2,10,5,0
+,2,2,10,5,0
--1,-1,-1,-1,-1,-1,-1
+-1,-1,-1,-1,-1,-1
 result is
 line per input number
 items per line:
 item 1) real number of significant digits in number_x (eg without leading zeros)
-item 2) real number of "significant decimals" (eg without trailing zero's)
+item 2) number of digits left from decimal point or if no decimals: total number of digits (length)
-item 3) number of digits left from decimal point (including non-significant)
-        or if no decimals: total number of digits (length)
-item 4) number of digits right from decimal point (including non-significant)
+item 3) number of digits right from decimal point
-item 5) exponent base (if not present : 1)
+item 4) exponent base (if not present : 1)
-item 6) exponent (if not present : 0)
+item 5) exponent (if not present : 0)
-item 7) indication : is the number correctly written ?  1 or 0  ( 000.1 is not correct...)
+item 6) indication : is the number correctly written ?  1 or 0  ( 000.1 is not correct...)
         scientiffic: [1-9.*] *10^exp : 1.2345*10^5 is OK ... 12.345*10^4 or 0.12345*10^6 is "NOK"
         a*10^b  : 1 <= a <= 9
 remarks:
 - exponent: any other base will be tolerated : 4*7^5  base=7 exponent=5 -> 1,0,1,0,7,5,1
-- if number is 'nonsense' : -1,-1,-1,-1,-1,-1 (1.23.4567  10^1.23.4 ; number will produce NaN in other math software)
+- if number is 'nonsense' : -1,-1,-1,-1,-1 (1.23.4567  10^1.23.4 ; number will produce NaN in other math software)
 ruleset:
 .2           : 4 significant digits
-.2000        : 4 significant digits
+.2000        : 7 significant digits
 .2          : 4 significant digits
 scientiffic notation:
 .202*10^5      : 4 significant digits
 .20200*10^5    : 6 significant digits
         exit(0);
+    }
     char word[MAX_DIGITS];
     char *input;
     char exp[MAX_DIGITS];
-    int cnt,i,ok,length,zeros,sig1,sig2,found_digit,found_point,dec1,dec2,pow,found_power,found_multiply,points,base_start,base_end;
+    int cnt,i,ok,length,zeros,sig1,sig2,found_digit,found_point,dec1,pow,found_power,found_multiply,points,base_start,base_end,bracket;
-    const char *invalid_characters = "\n\"\',!=ABCDFGHIJKLMNOPQRSTUVWXYZabcdfghijklmnopqrstuvwxyz@#$%&()[]{};:~><?/\\|";
+    const char *invalid_characters = "\n\"\',!=ABCDFGHIJKLMNOPQRSTUVWXYZabcdfghijklmnopqrstuvwxyz@#$%&;:~><?/\\|";
     /* Ee +- are allowed : 12.34e+05  12.34e-08  1.234*10^123*/
     cnt = 1;
     input = argv[cnt];
     while( input != NULL){
         if(cnt > MAX_CONV){fprintf(stdout,"error : number of conversions exceeds limit of %d\n",MAX_CONV);return 0;}
         strncpy( word, input, length );
         // reset
         found_digit = 0;
         found_point = 0;
         found_power = 0;
+        bracket = 0;
         found_multiply = 0;
         sig1 = 0; // real significant digits
-        dec1 = 0; // real "significant decimals"
         sig2 = 0; // integer part [including leading zeros]
-        dec2 = 0; // decimal part [including trailing zeros]
+        dec1 = 0; // decimal part [including trailing zeros]
         pow = 0; // exponent
         zeros = 0; // leading or trailing zeros
         points = 0; // number of points in number...
         exp[0]='\0';
         base_start = 0;
         base_end = 0;
         ok = 0;
         for( i = length - 1 ; i >= 0 ; i--){ // walk from rightside to left through the 'number'
             switch( word[i] ){
+                case '(' : bracket = 1 ;break; //  10^(-4) -> exp= (-4) : remove bracket from exponent.
+                case ')' : bracket = 1 ;break;
+                case '{' : bracket = 1 ;break;
+                case '}' : bracket = 1 ;break;
+                case '[' : bracket = 1 ;break;
+                case ']' : bracket = 1 ;break;
                 case '^' : base_start = i;found_power++;break;
                 case '*' :
                     found_multiply++;
                     if(found_power == 1){
                         base_end = i;
                         if(found_point == 1){points--;found_point = 0;}  // point in exponent... 10^4.5 (hmmm)
                         pow = length - i;
                         sig1 = 0; // reset counting significant digits and all other stuff
-                        dec1 = 0;
                         sig2 = 0;
-                        dec2 = 0;
+                        dec1 = 0;
                         found_digit = 0;
                         zeros = 0;
+                    }
                     break;
-                case 'e' : if(found_point == 1){points--;found_point = 0;} found_power++;pow = length - i;sig1 = 0;dec1 = 0;sig2 = 0;dec2 = 0;found_digit = 0;zeros = 0;found_multiply++;break;
+                case 'e' : if(found_point == 1){points--;found_point = 0;} found_power++;pow = length - i;sig1 = 0;sig2 = 0;dec1 = 0;found_digit = 0;zeros = 0;found_multiply++;break;
-                case 'E' : if(found_point == 1){points--;found_point = 0;} found_power++;pow = length - i;sig1 = 0;dec1 = 0;sig2 = 0;dec2 = 0;found_digit = 0;zeros = 0;found_multiply++;break;
+                case 'E' : if(found_point == 1){points--;found_point = 0;} found_power++;pow = length - i;sig1 = 0;sig2 = 0;dec1 = 0;found_digit = 0;zeros = 0;found_multiply++;break;
                 case '0' :
                     if(i == 0){//last char
                         sig1 = sig1 - zeros;
                         sig2++;
                         if(found_power == 1){zeros++;}
+                    }
                     else
+                    {
                         // 1.000*10^5 -> 4 sig
-                        if( found_point == 0 && found_power == 1){
+                        if( found_point == 0 ){
                             sig1++;
+                        }
                         else
+                        {
+                            sig2++;
                             if( found_digit == 1 ){ sig1++; }
+                        }
-                        if( found_point == 1 ){ sig2++; }
                         zeros++;
+                    }
                     break;
-                case '.' : dec1 = sig1; dec2 = length - i - pow - 1;found_point = 1;points++; break;
+                case '.' : dec1 = length - i - pow - 1;found_point = 1;points++; break;
                 case '1' : sig1++;if(found_point == 1){sig2++;} found_digit = 1;zeros = 0; break;
                 case '2' : sig1++;if(found_point == 1){sig2++;} found_digit = 1;zeros = 0; break;
                 case '3' : sig1++;if(found_point == 1){sig2++;} found_digit = 1;zeros = 0; break;
                 case '4' : sig1++;if(found_point == 1){sig2++;} found_digit = 1;zeros = 0; break;
                 case '5' : sig1++;if(found_point == 1){sig2++;} found_digit = 1;zeros = 0; break;
                 case '7' : sig1++;if(found_point == 1){sig2++;} found_digit = 1;zeros = 0; break;
                 case '8' : sig1++;if(found_point == 1){sig2++;} found_digit = 1;zeros = 0; break;
                 case '9' : sig1++;if(found_point == 1){sig2++;} found_digit = 1;zeros = 0; break;
                 default :  break;
+            }
-            if(found_power == 0){ append(exp,word[i]); } // maybe a power was used ?
+            if(found_power == 0 && bracket == 0){ append(exp,word[i]); } // maybe a power was used ?
+            bracket = 0;
+        }
         if( found_power > 1 || found_multiply > 1){ // 2*2 10^5^7
             fprintf(stdout,"error \n");
             return 0;
+        }
         if( points > 1){ // "nonsense" number 1.23.45  or 1.23*10^1.5
-            fprintf(stdout,"-1,-1,-1,-1,-1,-1,-1\n");
+            fprintf(stdout,"-1,-1,-1,-1,-1,-1\n");
+        }
         else
+        {
             // extra check for handling "special cases"
             if(found_point == 0 && found_power == 0){ sig2 = length;ok = 1; }   // just a number 12345
             else
-            if(found_point == 0 && found_multiply == 0 && found_power == 1){ sig1 = 0; dec1 = 0; sig2 = 0 ; dec2 = 0; } // 10^5
+            if(found_point == 0 && found_multiply == 0 && found_power == 1){ sig1 = 0; sig2 = 0 ; dec1 = 0; }   // 10^5
             else
-            if(found_point == 1 && found_multiply == 0 && found_power == 1){ sig1 = 0; dec1 = 0; sig2 = 0 ; dec2 = 0; } // 10^5.1
+            if(found_point == 1 && found_multiply == 0 && found_power == 1){ sig1 = 0; sig2 = 0 ; dec1 = 0; }   // 10^5.1
             else
-            if(found_point == 0 && found_multiply == 1 && found_power == 1){ dec1 = 0; dec2 = 0; sig2 = length - zeros - pow;}  // 3*10^5
+            if(found_point == 0 && found_multiply == 1 && found_power == 1){ dec1 = 0; sig2 = length - zeros - pow;}    // 3*10^5
             if( found_power == 1){
                 // find out if scientiffic number is correctly written ; ok=0 -> ok=1
                 // rule [1-9].[0-9]* x10^exp
                 if( word[0] != '0' && word[1] == '.' ){ //  0.120*10^5 => 1.20*10^4
                     for(i = s ; i < base_start ; i++){
                         c_base[c] = word[i];
                         c++;
+                    }
                     c_base[c] = '\0';
-                    fprintf(stdout,"%d,%d,%d,%d,%s,%s,%d\n",sig1,dec1,sig2,dec2,c_base,exponent,ok);
+                    fprintf(stdout,"%d,%d,%d,%s,%s,%d\n",sig1,sig2,dec1,c_base,exponent,ok);
+                }
                 else
                 { // base = 10 : used 4e+5
-                    fprintf(stdout,"%d,%d,%d,%d,10,%s,%d\n",sig1,dec1,sig2,dec2,exponent,ok);
+                    fprintf(stdout,"%d,%d,%d,10,%s,%d\n",sig1,sig2,dec1,exponent,ok);
+                }
+            }
             else
             {   // no exponent : base = '1' exponent = '0'
                 //several possible correct way of writing...
-                if( ok == 0 && ( ( sig1 == sig2 + dec2 ) || ( sig1 + dec1 == sig2 + dec2 ) || ( dec1 == dec2 && sig2 == 1 ) )){ ok  = 1; }
+                if( ok == 0 && (  sig1 == sig2 + dec1 ) ){ ok  = 1; }
-                fprintf(stdout,"%d,%d,%d,%d,1,0,%d\n",sig1,dec1,sig2,dec2,ok);
+                fprintf(stdout,"%d,%d,%d,1,0,%d\n",sig1,sig2,dec1,ok);
+            }
+        }
         cnt++;
         input = argv[cnt];
+    }

Subversion Repositories wimsdev

(root)/trunk/wims/src/Misc/sigdigits/sigdigits.c – Rev 5227 → 5283