Classes | |
class | PrimeGenerator |
class | PrimeBatchGenerator |
Functions | |
def | PrimeTest |
def | FactorTest |
def | SgmftrTest |
Variables | |
wheel = None | |
wheel_array = None | |
dictionary | hash = { } |
tuple | arg = int( argv ) |
tuple | count = int( argv[1:] ) |
def PrimeGenerator::FactorTest | ( | clPG1, | ||
clPG2, | ||||
anInteger, | ||||
fTime, | ||||
fVerbose | ||||
) |
Definition at line 109 of file PrimeGenerator.py.
00109 : 00110 # Test routine. 00111 # Compute the number of pseudo-primes in the interval. 00112 # Display the number of primes, non-primes, and pseudo-primes. 00113 00114 print "PrimeGenerator.FactorTest: %d" % anInteger 00115 00116 if fTime: 00117 beg = time.time( ) 00118 00119 cc = 0 00120 pc = 0 00121 g1 = PrimeGenerator.PrimeGenerator( order ) 00122 g2 = PrimeGenerator.PrimeGenerator( order ) 00123 while True: 00124 p = g1.NextPrime( ) 00125 if p >= anInteger: 00126 break 00127 00128 f = Factors.Factors( p ) 00129 f = f.factor( p, g2 ) 00130 00131 if len( f ) == 1 and f.values()[0].isPrime: 00132 pc += 1 00133 if fVerbose: 00134 print " %d %s - prime" % ( p, f ) 00135 else: 00136 cc += 1 00137 if fVerbose: 00138 print " %d %s - not prime" % ( p, f ) 00139 00140 print " %d primes, %d non-primes, %d total" % ( pc, cc, pc + cc ) 00141 if fTime: 00142 fin = time.time( ) 00143 print "%4.3f" % ( fin - beg ) 00144 00145 sys.stdout.flush( ) 00146 def SgmftrTest( ):
def PrimeGenerator::PrimeTest | ( | PrimeCount, | ||
MaxNumber | ||||
) |
Definition at line 81 of file PrimeGenerator.py.
00081 : 00082 # Test routine. 00083 00084 import PrimeGenerator30 00085 import PrimeGenerator210 00086 00087 count = PrimeCount 00088 print "PrimeGenerator.PrimeTest: %d" % count 00089 00090 # PrimeTest: 25 00091 # 1: [2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25] 00092 # 6: [2, 3, 5, 7, 11, 13, 17, 19, 23, 25, 29, 31, 35, 37, 41, 43, 47, 49, 53, 55, 59, 61, 65, 67] 00093 # 210: [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89] 00094 print " 1: %s" % PrimeGenerator( ).PrimeTest( count ) 00095 print " 6: %s" % PrimeGenerator30.PrimeGenerator30( ).PrimeTest( count ) 00096 print " 210: %s" % PrimeGenerator210.PrimeGenerator210( ).PrimeTest( count ) 00097 00098 # FactorTest: 100 25 primes, 0 non-primes, 25 total 00099 # FactorTest: 200 46 primes, 4 non-primes, 50 total 00100 # FactorTest: 500 95 primes, 23 non-primes, 118 total 00101 # FactorTest: 1000 168 primes, 63 non-primes, 231 total 00102 # FactorTest: 10000 1229 primes, 1059 non-primes, 2288 total 00103 # FactorTest: 100000 9592 primes, 13268 non-primes, 22860 total 00104 # FactorTest: 1000000 78498 primes, 150076 non-primes, 228574 total 00105 for number in ( 100, 200, 500, 1000, 10000, 100000, 1000000 ): 00106 if number <= MaxNumber: 00107 FactorTest( PrimeGenerator210, PrimeGenerator210, number, False, False ) 00108 def FactorTest( clPG1, clPG2, anInteger, fTime, fVerbose):
def PrimeGenerator::SgmftrTest | ( | ) |
Definition at line 147 of file PrimeGenerator.py.
00147 : 00148 00149 print "PrimeGenerator.SgmftrTest:" 00150 00151 for p in range( 5,9,2 ): 00152 for q in range( 1,4 ): 00153 n = Number.Number( p, q) 00154 print " %s %s" % ( n, n.sgmftr( ) ) 00155 if __name__ == '__main__':
tuple PrimeGenerator::arg = int( argv ) |
Definition at line 166 of file PrimeGenerator.py.
tuple PrimeGenerator::count = int( argv[1:] ) |
Definition at line 202 of file PrimeGenerator.py.
dictionary PrimeGenerator::hash = { } |
Definition at line 158 of file PrimeGenerator.py.
PrimeGenerator::wheel = None |
Definition at line 11 of file PrimeGenerator.py.
PrimeGenerator::wheel_array = None |
Definition at line 12 of file PrimeGenerator.py.