test/test_factorize.cpp
// I used this speed test to do a quick and dirty initial performance tuning of
// PollardRhoTrial and PollardRhoBrentTrial.  This test is not needed normally.
I used this speed test to do a quick and dirty initial performance tuning of
PollardRhoTrial and PollardRhoBrentTrial.  This test is not needed normally.
I used this speed test to do a quick and dirty initial performance tuning of PollardRhoTrial and PollardRhoBrentTrial . This test is not needed normally .
TEST(HurchallaFactoringFactorize, speed_test32) {
        using T = std::uint32_t;
        T max = ut_numeric_limits<T>::max()/2;
        for (T x = max; x >= max - 8000000; x = x-2) {
            int num_factors;
            auto arr = factorize(x, num_factors);
            EXPECT_TRUE(arr[0] != 0);
        }
    }
TEST ( HurchallaFactoringFactorize , speed_test32 ) { using T = std :: uint32_t ; T max = ut_numeric_limits < T > :: max ( ) / 2 ; for ( T x = max ; x >= max - 8000000 ; x = x - 2 ) { int num_factors ; auto arr = factorize ( x , num_factors ) ; EXPECT_TRUE ( arr [ 0 ] != 0 ) ; } }
I used this speed test to do a quick and dirty initial performance tuning of
PollardRhoTrial and PollardRhoBrentTrial.
I used this speed test to do a quick and dirty initial performance tuning of PollardRhoTrial and PollardRhoBrentTrial .
// We need to prevent the compiler from completely removing // the factorize calls due to arr never being used. // So we'll check arr[0] (which is never 0) just so it's used.