speedup

yjqiang · sybrenstuvel · commit 11bf33264c62 · 2018-09-16T12:14:27.000+02:00
"if A and B"  if mostly A is True then we should judge B at first
diff --git a/rsa/key.py b/rsa/key.py
@@ -783,7 +783,7 @@ def newkeys(nbits, accurate=True, poolsize=1, exponent=DEFAULT_EXPONENT):
             if failures:
                 break
 
-            if (count and count % 10 == 0) or count == 1:
+            if (count % 10 == 0 and count) or count == 1:
                 print('%i times' % count)
     except KeyboardInterrupt:
         print('Aborted')
diff --git a/rsa/parallel.py b/rsa/parallel.py
@@ -95,7 +95,7 @@ def getprime(nbits, poolsize):
         if failures:
             break
 
-        if count and count % 10 == 0:
+        if count % 10 == 0 and count:
             print('%i times' % count)
 
     print('Doctests done')
diff --git a/rsa/pkcs1.py b/rsa/pkcs1.py
@@ -433,7 +433,7 @@ def _find_method_hash(clearsig):
         if failures:
             break
 
-        if count and count % 100 == 0:
+        if count % 100 == 0 and count:
             print('%i times' % count)
 
     print('Doctests done')
diff --git a/rsa/pkcs1_v2.py b/rsa/pkcs1_v2.py
@@ -97,7 +97,7 @@ def mgf1(seed, length, hasher='SHA-1'):
         if failures:
             break
 
-        if count and count % 100 == 0:
+        if count % 100 == 0 and count:
             print('%i times' % count)
 
     print('Doctests done')
diff --git a/rsa/prime.py b/rsa/prime.py
@@ -195,7 +195,7 @@ def are_relatively_prime(a, b):
         if failures:
             break
 
-        if count and count % 100 == 0:
+        if count % 100 == 0 and count:
             print('%i times' % count)
 
     print('Doctests done')
diff --git a/rsa/randnum.py b/rsa/randnum.py
@@ -88,7 +88,7 @@ def randint(maxvalue):
         if value <= maxvalue:
             break
 
-        if tries and tries % 10 == 0:
+        if tries % 10 == 0 and tries:
             # After a lot of tries to get the right number of bits but still
             # smaller than maxvalue, decrease the number of bits by 1. That'll
             # dramatically increase the chances to get a large enough number.
