/[dtapublic]/projs/dtats/trunk/projs/2018/20180707_cgi_web_tools_aux_exe/dtats_cgi_aux_arith_large/subfunc_pfact_18.c

Diff of /projs/dtats/trunk/projs/2018/20180707_cgi_web_tools_aux_exe/dtats_cgi_aux_arith_large/subfunc_pfact_18.c

Parent Directory | Revision Log | View Patch Patch

-revision 206 by dashley,
Sat Jul 14 00:10:29 2018 UTC
+revision 207 by dashley,
Sun Jul 15 21:50:56 2018 UTC
 Line 35
  //integer, which speeds the division.  Additionally, there isn't
  //much use in trying to factor larger integers on a web page.
  //This subfunction is "parlor trivia" grade only.
  //
  //INPUT PARAMETERS
  //----------------
  //This subfunction accepts the following parameters, in order.
 Line 98
  //       the code of the last factor.
  //
  //The return value (exit code) from this subfunction is always 0.
  //
  #define MODULE_SUBFUNC_PFACT_18
 Line 174 
 int SUBFUNC_PFACT_18_main(int argc, char
        return(0);
        }
     //Copy the command-line arguments to a safe place where we can manipulate them.
     //Leave 2 characters of space in case we assign a "0".
     arg1 = (char *)malloc((AUXFUNCS_size_t_max(1, strlen(argv[2])) + 1) * sizeof(char));
     arg2 = (char *)malloc((AUXFUNCS_size_t_max(1, strlen(argv[3])) + 1) * sizeof(char));
 Line 215 
 int SUBFUNC_PFACT_18_main(int argc, char
        return(0);
        }
     //If the number to factor exceeds 18 digits, abort.  Anything that has
     //18 or fewer digits is allowed.
     if (strlen(arg1) >18)
        {
 Line 227 
 int SUBFUNC_PFACT_18_main(int argc, char
     //GMP type.
     mpz_set_str(number_to_factor, arg1, 10);
     //Assign the number of Miller-Rabin repetitons to use, subject to an
     //absolute maximum of 1000 and minimum of 1.
     miller_rabin_iterations = 25;
     if (strlen(arg2) > 3)
 Line 238 
 int SUBFUNC_PFACT_18_main(int argc, char
        {
        sscanf(arg2, "%d", &miller_rabin_iterations);
        if (miller_rabin_iterations < 1)
-          miller_rabin_iterations = 1;
+     miller_rabin_iterations = 1;
        }
     //Assign the maximum time allowed, subject to a maximum of 1000 and minimum of 3.
 Line 250 
 int SUBFUNC_PFACT_18_main(int argc, char
        {
        sscanf(arg3, "%d", &max_time);
        if (max_time < 3)
-          max_time = 3;
+     max_time = 3;
        }
     //Output the header information before beginning the search.
     printf("S\n");
     mpz_out_str(stdout, 10, number_to_factor);
     printf("\n");
     printf("%d\n", miller_rabin_iterations);
     printf("%d\n", max_time);
 Line 270 
 int SUBFUNC_PFACT_18_main(int argc, char
        //Factor out all occurrences that we can.
        while (mpz_divisible_ui_p(number_to_factor, SIEVE_ERATOSTHENES_sieve_factors[i]))
-          {
+     {
-          mpz_divexact_ui(number_to_factor, number_to_factor, SIEVE_ERATOSTHENES_sieve_factors[i]);
+     mpz_divexact_ui(number_to_factor, number_to_factor, SIEVE_ERATOSTHENES_sieve_factors[i]);
-          multiplicity++;
+     multiplicity++;
-          }
+     }
        //Now output the information record to the stdout if we could factor it.
        if (multiplicity)
-          {
+     {
           printf("P\n");
           printf("%u\n", SIEVE_ERATOSTHENES_sieve_factors[i]);
           printf("%d\n", multiplicity);
           }
        }
     //Gear up for tabulated operation as we sieve.
     new_trial_divisor = trial_divisor     = SIEVE_ERATOSTHENES_FIRST_TRIAL_DIVISOR;
     sieve_table_index                     = SIEVE_ERATOSTHENES_FIRST_SIEVE_INDEX;
 Line 299 
 int SUBFUNC_PFACT_18_main(int argc, char
        exit_flag = 1;
     //Effectively, we may have broken down the number to factor
     //with just a few operations.  So, effectively, we are
     //starting afresh here.  We only need to proceed to the
     //square root of the current number to factor (not the
     //original one.
     mpz_sqrt(square_root_limit, number_to_factor);
 Line 312 
 int SUBFUNC_PFACT_18_main(int argc, char
        {
        if (mpz_cmp_ui(number_to_factor, 1))
           {
-          exit_flag = 1;
+     exit_flag = 1;
-          printf("P\n");
+     printf("P\n");
           mpz_out_str(stdout, 10, number_to_factor);
           printf("\n");
-          printf("1\n");
+     printf("1\n");
           goto done;
-          }
+     }
       }
     //If Miller-Rabin says that the remaining number is probably prime, that is good
 Line 327 
 int SUBFUNC_PFACT_18_main(int argc, char
        {
        exit_flag = 1;
        printf("p\n");
        mpz_out_str(stdout, 10, number_to_factor);
        printf("\n");
        printf("1\n");
        goto done;
        }
     //Loop entry condition.
 Line 347 
 int SUBFUNC_PFACT_18_main(int argc, char
        //Factor out all occurrences that we can of the trial divisor, if we can.
        while (mpz_divisible_ui_p(number_to_factor, trial_divisor))
-          {
+     {
-          mpz_divexact_ui(number_to_factor, number_to_factor, trial_divisor);
+     mpz_divexact_ui(number_to_factor, number_to_factor, trial_divisor);
-          multiplicity++;
+     multiplicity++;
-          }
+     }
        //Now output the information record to the stdout if we could factor it.
        if (multiplicity)
-          {
+     {
           printf("P\n");
           printf("%u\n", trial_divisor);
           printf("%d\n", multiplicity);
 Line 365 
 int SUBFUNC_PFACT_18_main(int argc, char
           //If we are over the square root bound, the remaining number to factor
           //is prime and we should exit.
           if (mpz_cmp_ui(square_root_limit,  trial_divisor) <= 0)
-             exit_flag = 1;
+        exit_flag = 1;
           //Are we over the time bound?  We might has well check here,
           //because finding prime factors is rare.
           if ((time(NULL) - time_snapshot) > max_time)
-             exit_flag = 1;
+        exit_flag = 1;
           //Does the Miller-Rabin test say that the remaining number
           //is with near perfect certainty prime?
           if (mpz_probab_prime_p(number_to_factor, miller_rabin_iterations) >= 1)
-             exit_flag = 1;
+        exit_flag = 1;
           //Is the remaining number "1", indicating we've factored it fully?
           if (!mpz_cmp_ui(number_to_factor, 1))
-             exit_flag = 1;
+        exit_flag = 1;
           //Set multiplicity to zero again so don't re-enter until successful
           //division again.
 Line 391 
 int SUBFUNC_PFACT_18_main(int argc, char
        //If the new is < the old, we've rolled over.  This means an exit is necessary.
        if (new_trial_divisor < trial_divisor)
-          exit_flag = 1;
+     exit_flag = 1;
        //Advance the sieve index.
        sieve_table_index = (sieve_table_index + 1) % SIEVE_ERATOSTHENES_N_SIEVE;
        //This is our only chance to check for termination conditions that
        //don't come about from a successful division.  But we don't do
        //this often.
        mask_counter++;
        if (!(mask_counter & 0xFFFFF))
-          {
+     {
           //First, have we exceeded the square root bound?
           if (mpz_cmp_ui(square_root_limit,  trial_divisor) <= 0)
-             exit_flag = 1;
+        exit_flag = 1;
           //Second, are we over the time budget?
           if ((time(NULL) - time_snapshot) > max_time)
-             exit_flag = 1;
+        exit_flag = 1;
-          }
+     }
        }
     //If we've made it out of the loop, there are a variety of reasons for that.
     //Find the right one and close up.
     if (!mpz_cmp_ui(number_to_factor, 1))
 Line 421 
 int SUBFUNC_PFACT_18_main(int argc, char
        {
        //We are at or over the square root limit.  The remaining number is definitely prime.
        printf("P\n");
        mpz_out_str(stdout, 10, number_to_factor);
        printf("\n");
        printf("1\n");
        }
     else if (mpz_probab_prime_p(number_to_factor, miller_rabin_iterations) == 0)
        {
        //Miller-Rabin says the remaining number is definitely composite.
        printf("C\n");
        mpz_out_str(stdout, 10, number_to_factor);
        printf("\n");
        printf("1\n");
        }
     else if (mpz_probab_prime_p(number_to_factor, miller_rabin_iterations) == 1)
        {
        //Miller-Rabin says the remaining number is probably prime.
        printf("p\n");
        mpz_out_str(stdout, 10, number_to_factor);
        printf("\n");
        printf("1\n");
        }
     else if (mpz_probab_prime_p(number_to_factor, miller_rabin_iterations) == 2)
        {
        //Miller-Rabin says the remaining number is definitely prime.
        printf("P\n");
        mpz_out_str(stdout, 10, number_to_factor);
        printf("\n");
        printf("1\n");
        }
     //Output the invariant footer information.
     done:
     printf("X\n");
     printf("S\n");
     //Always return 0.
     return(0);
     }
  //********************************************************************************
  // End of SUBFUNC_PFACT_18.C.

 Legend:



Removed from v.206
 


changed lines


 
Added in v.207
 Legend:



Removed from v.206
 


changed lines


 
Added in v.207
-Removed from v.206
+Added in v.207

dashley@gmail.com	ViewVC Help
Powered by ViewVC 1.1.25