range: lean and mean

Lib/test/test_random.py

 #!/usr/bin/env python
 
 import unittest
 import random
 import time
 import pickle
 import warnings
 from math import log, exp, sqrt, pi
 from test import test_support
 
@@ skipping 28 matching lines @@
             self.gen.seed(arg)
         for arg in [list(range(3)), dict(one=1)]:
             self.assertRaises(TypeError, self.gen.seed, arg)
         self.assertRaises(TypeError, self.gen.seed, 1, 2)
         self.assertRaises(TypeError, type(self.gen), [])
 
     def test_sample(self):
         # For the entire allowable range of 0 <= k <= N, validate that
         # the sample is of the correct length and contains only unique items
         N = 100
-        population = range(N)
+        population = list(range(N))
         for k in range(N+1):
             s = self.gen.sample(population, k)
             self.assertEqual(len(s), k)
             uniq = set(s)
             self.assertEqual(len(uniq), k)
             self.failUnless(uniq <= set(population))
         self.assertEqual(self.gen.sample([], 0), [])  # test edge case N==k==0
 
     def test_sample_distribution(self):
         # For the entire allowable range of 0 <= k <= N, validate that
         # sample generates all possible permutations
         n = 5
-        pop = range(n)
+        pop = list(range(n))
         trials = 10000  # large num prevents false negatives without slowing normal case
         def factorial(n):
             if n == 0:
                 return 1
             return n * factorial(n - 1)
         for k in range(n):
             expected = factorial(n) // factorial(n-k)
             perms = {}
             for i in range(trials):
                 perms[tuple(self.gen.sample(pop, k))] = None
                 if len(perms) == expected:
                     break
             else:
                 self.fail()
 
     def test_sample_inputs(self):
         # SF bug #801342 -- population can be any iterable defining __len__()
         self.gen.sample(set(range(20)), 2)
-        self.gen.sample(range(20), 2)
-        self.gen.sample(range(20), 2)
+        self.gen.sample(list(range(20)), 2)
+        self.gen.sample(list(range(20)), 2)
         self.gen.sample(str('abcdefghijklmnopqrst'), 2)
         self.gen.sample(tuple('abcdefghijklmnopqrst'), 2)
 
     def test_sample_on_dicts(self):
         self.assertRaises(TypeError, self.gen.sample, dict.fromkeys('abcdef'), 2)
 
     def test_gauss(self):
         # Ensure that the seed() method initializes all the hidden state.  In
         # particular, through 2.2.1 it failed to reset a piece of state used
         # by (and only by) the .gauss() method.
@@ skipping 387 matching lines @@
     import sys
     if verbose and hasattr(sys, "gettotalrefcount"):
         counts = [None] * 5
         for i in range(len(counts)):
             test_support.run_unittest(*testclasses)
             counts[i] = sys.gettotalrefcount()
         print(counts)
 
 if __name__ == "__main__":
     test_main(verbose=True)