| Current Path : /usr/local/lib/python2.5/test/ |
FreeBSD hs32.drive.ne.jp 9.1-RELEASE FreeBSD 9.1-RELEASE #1: Wed Jan 14 12:18:08 JST 2015 root@hs32.drive.ne.jp:/sys/amd64/compile/hs32 amd64 |
| Current File : //usr/local/lib/python2.5/test/sortperf.pyc |
³ò
h”Rc @ s£ d Z d d k Z d d k Z d d k Z d d k Z d d k Z d d k Z e i ƒ Z d „ Z d „ Z
d „ Z d „ Z d „ Z
e d j o e
ƒ n d S( s_ Sort performance test.
See main() for command line syntax.
See tabulate() for output format.
iÿÿÿÿNc C s– t i i t d | ƒ } y t | d ƒ } Wnß t j
oÓ t i } g } t | ƒ D] } | | ƒ qW ~ } yp z3 t | d ƒ } t i | | ƒ | i
ƒ d } Wd | o. y t i | ƒ WqÞ t i
j
o qÞ Xn XWqxt j
o } d G| Gd G| GHqxXnl Xt i | ƒ } | i
ƒ xN t d ƒ D]@ } t i | ƒ } | | } | | 4| i ƒ | i | ƒ ~ q4Wt | ƒ | j p t ‚ | S( s+ Return a list of n random floats in [0, 1).s rr%06dt rbt wbNs can't writet :i
( t ost patht joint tdt opent IOErrort randomt xranget marshalt dumpt closet Nonet unlinkt errort loadt ranget randranget reverset extendt lent AssertionError( t nt fnt fpt rt _[1]t it resultt msgt temp( ( s) /usr/local/lib/python2.5/test/sortperf.pyt
randfloats s> *
c C s t i i ƒ d S( N( t syst stdoutt flush( ( ( s) /usr/local/lib/python2.5/test/sortperf.pyR$ 8 s c C s9 t i ƒ } | i ƒ t i ƒ } d | | Gt ƒ d S( Ns %6.2f( t timet clockt sortR$ ( t Lt t0t t1( ( s) /usr/local/lib/python2.5/test/sortperf.pyt doit; s
c
C sO t g } d D] } | | d q ~ ƒ } d d t | ƒ } | d | GHxü| D]ô} d | >} t | ƒ } d | | f Gt ƒ t | ƒ | i ƒ t | ƒ t | ƒ xO t d ƒ D]A } t i | ƒ } t i | ƒ }
| |
| | | | <| |
<q¹ Wt | ƒ | d
j o5 g } t d
ƒ D] } | t i ƒ q&~ | d )n t | ƒ x1 t | d ƒ D] } t i ƒ | t i | ƒ <qeWt | ƒ | d
j o+ | d
3| | d
} t
d „ | ƒ } n t | ƒ ~ t
t d g | ƒ } t | ƒ ~ | d } t | d d d ƒ } | i t | ƒ ƒ t
t
| ƒ } t | ƒ HqS Wd S( s: 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 arrays of 2**i
floating point numbers with the following properties:
*sort: random data
\sort: descending data
/sort: ascending data
3sort: ascending, then 3 random exchanges
+sort: ascending, then 10 random at the end
%sort: ascending, then randomly replace 1% of the elements w/ random values
~sort: many duplicates
=sort: all equal
!sort: worst case scenario
s *\/3+%~=!R' s %2s %7ss %6sR s 2**ii s %2d %7di i
iöÿÿÿid i c S s | S( ( ( t x( ( s) /usr/local/lib/python2.5/test/sortperf.pyt <lambda>y s g à¿i iÿÿÿÿN( R s 2**i( t tupleR R! R$ R+ R R R R R
t mapt absR t float(
R R t cht casest fmtR R R( t dummyt i1t i2t _[2]t half( ( s) /usr/local/lib/python2.5/test/sortperf.pyt tabulateB sR +
!
5
c
C sÌ d } d } t i d o‘ t t i d ƒ } } t i d oh t t i d ƒ } t i d oC d } x) t i d D] } d | t | ƒ } qt Wt i | ƒ q§ q« n t | | d ƒ } t | ƒ d S( s 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.
i i i i i iÍ
N( R" t argvt intt hashR t seedR R: ( t k1t k2R, t aR ( ( s) /usr/local/lib/python2.5/test/sortperf.pyt mainŽ s t __main__( t __doc__R" R% R R t tempfileR t
gettempdirR R! R$ R+ R: RB t __name__( ( ( s) /usr/local/lib/python2.5/test/sortperf.pys <module> s ' L