Python yield_slow_factorize Examples

Example #1

 def testYieldSlowFactorize(self):
     self.assertEquals(list(intalg.yield_slow_factorize(1)), [])
     self.assertEquals(list(intalg.yield_slow_factorize(36)), [2, 2, 3, 3])
     self.assertEquals(list(intalg.yield_slow_factorize(180)),
                       [2, 2, 3, 3, 5])
     self.assertEquals(list(intalg.yield_slow_factorize(3**1000 * 29**57)),
                       [3] * 1000 + [29] * 57)
     self.assertEquals(
         list(
             intalg.yield_slow_factorize(2 * 3 * 5 * 7 * 7 * 11 * 13 * 17 *
                                         19)),
         [2, 3, 5, 7, 7, 11, 13, 17, 19])

Example #2

File: intalg_large_test.py Project: abgoyal/pts-mini-gpl

 def testFactorizeSmall(self):
   for n in xrange(1, 100025):
     a = list(intalg.yield_slow_factorize(n))
     b = intalg.finder_slow_factorize(n)
     c = intalg.factorize(n, divisor_finder=intalg.brent)
     d = intalg.factorize(n, divisor_finder=intalg.pollard)
     assert a == b == c == d, (n, a, b, c, d)

Example #3

File: intalg_large_test.py Project: pts/pybasealgo

 def testFactorizeSmall(self):
     for n in xrange(1, 100025):
         a = list(intalg.yield_slow_factorize(n))
         b = intalg.finder_slow_factorize(n)
         c = intalg.factorize(n, divisor_finder=intalg.brent)
         d = intalg.factorize(n, divisor_finder=intalg.pollard)
         assert a == b == c == d, (n, a, b, c, d)

Example #4

File: intalg_large_test.py Project: abgoyal/pts-mini-gpl

 def testFactorizeMedium(self):
   n = intalg.next_prime(intalg._SMALL_PRIME_LIMIT) ** 2 - 10
   limit = n + 20025
   while n < limit:  # xrange can't take a long (n).
     a = list(intalg.yield_slow_factorize(n))
     b = intalg.finder_slow_factorize(n)
     c = intalg.factorize(n)
     c = intalg.factorize(n, divisor_finder=intalg.brent)
     d = intalg.factorize(n, divisor_finder=intalg.pollard)
     assert a == b == c == d, (n, a, b, c, d)
     n += 1

Example #5

File: intalg_large_test.py Project: pts/pybasealgo

 def testFactorizeMedium(self):
     n = intalg.next_prime(intalg._SMALL_PRIME_LIMIT)**2 - 10
     limit = n + 20025
     while n < limit:  # xrange can't take a long (n).
         a = list(intalg.yield_slow_factorize(n))
         b = intalg.finder_slow_factorize(n)
         c = intalg.factorize(n)
         c = intalg.factorize(n, divisor_finder=intalg.brent)
         d = intalg.factorize(n, divisor_finder=intalg.pollard)
         assert a == b == c == d, (n, a, b, c, d)
         n += 1

Example #6

File: intalg_smoke_test.py Project: abgoyal/pts-mini-gpl

 def testYieldSlowFactorize(self):
   self.assertEquals(list(intalg.yield_slow_factorize(1)), [])
   self.assertEquals(list(intalg.yield_slow_factorize(36)), [2, 2, 3, 3])
   self.assertEquals(list(intalg.yield_slow_factorize(180)), [2, 2, 3, 3, 5])
   self.assertEquals(list(intalg.yield_slow_factorize(3 ** 1000 * 29 ** 57)), [3] * 1000 + [29] * 57)
   self.assertEquals(list(intalg.yield_slow_factorize(2 * 3 * 5 * 7 * 7 * 11 * 13 * 17 * 19)), [2, 3, 5, 7, 7, 11, 13, 17, 19])