22from six import print_
33from functools import reduce
44import operator
5+ import sys
56
67try :
78 import unittest2 as unittest
@@ -202,9 +203,15 @@ def st_comp_no_com_fac(draw):
202203 # the factorization() sometimes takes a long time to finish
203204 HYP_SETTINGS ["deadline" ] = 5000
204205
206+ if "--fast" in sys .argv :
207+ HYP_SETTINGS ["max_examples" ] = 20
208+
205209
206210HYP_SLOW_SETTINGS = dict (HYP_SETTINGS )
207- HYP_SLOW_SETTINGS ["max_examples" ] = 10
211+ if "--fast" in sys .argv :
212+ HYP_SLOW_SETTINGS ["max_examples" ] = 2
213+ else :
214+ HYP_SLOW_SETTINGS ["max_examples" ] = 20
208215
209216
210217class TestNumbertheory (unittest .TestCase ):
@@ -239,6 +246,7 @@ def test_gcd_with_uncom_factor(self, numbers):
239246 n = gcd (numbers )
240247 assert n == 1
241248
249+ @settings (** HYP_SLOW_SETTINGS )
242250 @given (
243251 st .lists (
244252 st .integers (min_value = 1 , max_value = 2 ** 8192 ),
@@ -257,6 +265,7 @@ def test_lcm(self):
257265 assert lcm ([3 , 5 * 3 , 7 * 3 ]) == 3 * 5 * 7
258266 assert lcm (3 ) == 3
259267
268+ @settings (** HYP_SLOW_SETTINGS )
260269 @given (
261270 st .lists (
262271 st .integers (min_value = 1 , max_value = 2 ** 8192 ),
@@ -275,7 +284,7 @@ def test_lcm_with_random_numbers(self, numbers):
275284 "meet requirements (like `is_prime()`), the test "
276285 "case times-out on it" ,
277286 )
278- @settings (** HYP_SETTINGS )
287+ @settings (** HYP_SLOW_SETTINGS )
279288 @given (st_num_square_prime ())
280289 def test_square_root_mod_prime (self , vals ):
281290 square , prime = vals
@@ -313,6 +322,7 @@ def test_jacobi(self, mod):
313322 c *= jacobi (a , i [0 ]) ** i [1 ]
314323 assert c == jacobi (a , mod )
315324
325+ @settings (** HYP_SETTINGS )
316326 @given (st_two_nums_rel_prime ())
317327 def test_inverse_mod (self , nums ):
318328 num , mod = nums
0 commit comments