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
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
|
"""Taken from the Python source distribution and modified to test
numarray and Numeric as well.
Sort performance test.
See main() for command line syntax.
See tabulate() for output format.
"""
import sys
import time
import random
import marshal
import tempfile
import operator
import os
td = tempfile.gettempdir()
def randrange(n):
"""Return a random shuffle of range(n)."""
fn = os.path.join(td, "rr%06d" % n)
try:
fp = open(fn, "rb")
except IOError:
result = []
for i in range(n):
result.append(random.random())
try:
try:
fp = open(fn, "wb")
marshal.dump(result, fp)
fp.close()
fp = None
finally:
if fp:
try:
os.unlink(fn)
except os.error:
pass
except IOError, msg:
print "can't write", fn, ":", msg
else:
result = marshal.load(fp)
fp.close()
##assert len(result) == n
# Shuffle it a bit...
for i in range(10):
i = random.randrange(0, n)
temp = result[:i]
del result[:i]
temp.reverse()
result[len(result):] = temp
del temp
return result
def fl():
sys.stdout.flush()
def doit_numarray(L):
import numarray
L = numarray.array(L)
t0 = time.clock()
numarray.sort(L)
t1 = time.clock()
print "%6.2f" % (t1-t0),
fl()
def doit_numeric(L):
import Numeric
L = Numeric.array(L)
t0 = time.clock()
Numeric.sort(L)
t1 = time.clock()
print "%6.2f" % (t1-t0),
fl()
def doit_list(L):
t0 = time.clock()
L.sort()
t1 = time.clock()
print "%6.2f" % (t1-t0),
# print L
fl()
def tabulate(r, doit):
"""Tabulate sort speed for lists of various sizes.
The sizes are 2**i for i in r (the argument, a list).
The output displays i, 2**i, and the time to sort numarray of 2**i
floating point numbers with the following properties:
*sort: random data
\sort: descending data
/sort: ascending data
~sort: many duplicates
-sort: all equal
!sort: worst case scenario
"""
cases = ("*sort", "\\sort", "/sort", "~sort", "-sort", "!sort", "%sort")
fmt = ("%2s %6s" + " %6s"*len(cases))
print fmt % (("i", "2**i") + cases)
for i in r:
n = 1<<i
L = randrange(n)
##assert len(L) == n
print "%2d %6d" % (i, n),
fl()
doit(L) # *sort
# L = L[::-1]
L.reverse()
doit(L) # \sort
doit(L) # /sort
if n > 4:
del L[4:]
L = L*(n/4)
L = map(lambda x: --x, L)
doit(L) # ~sort
del L
L = map(abs, [-0.5]*n)
doit(L) # -sort
L = range(n/2-1, -1, -1)
L[len(L):] = range(n/2)
doit(L) # !sort
L = ([1] * (n/2)) + ([0]*(n/2))
doit(L) # %sort
print
def main(k1=15, k2=19, doit=doit_numarray):
"""Main program when invoked as a script.
One argument: tabulate a single row.
Two arguments: tabulate a range (inclusive).
Extra arguments are used to seed the random generator.
"""
# default range (inclusive)
# k1 = 15
# k2 = 19
if sys.argv[1:]:
# one argument: single point
k1 = k2 = int(sys.argv[1])
if sys.argv[2:]:
# two arguments: specify range
k2 = int(sys.argv[2])
if sys.argv[3:]:
# derive random seed from remaining arguments
x, y, z = 0, 0, 0
for a in sys.argv[3:]:
h = hash(a)
h, d = divmod(h, 256)
h = h & 0xffffff
x = (x^h^d) & 255
h = h>>8
y = (y^h^d) & 255
h = h>>8
z = (z^h^d) & 255
whrandom.seed(x, y, z)
r = range(k1, k2+1) # include the end point
tabulate(r, doit)
def main_numarray(k1=15, k2=19):
return main(k1,k2,doit_numarray)
def main_numeric(k1=15,k2=19):
return main(k1,k2,doit_numeric)
def main_list(k1=15, k2=19):
return main(k1, k2, doit_list)
def main_all(k1=15, k2=19):
import profile
profile.run("main_numarray()")
profile.run("main_numeric()")
profile.run("main_list()")
if __name__ == '__main__':
main_all()
|
