Live data from Hacker News

PyPy 1.4: Ouroboros in practice

morepypy.blogspot.com

1–10 of 22 posts

Re: PyPy 1.4: Ouroboros in practice

#2
Interesting and promising. PyPy 1.4:

    >>>> t1 = time.time(); a=[x*x for x in xrange(1000000)]; time.time()-t1
    0.38609600067138672
    >>>> t1 = time.time(); a=[x*x+math.sin(x/1000000.) for x in xrange(1000000)]; time.time()-t1
    0.42182803153991699
Python 2.7:

    >>> t1 = time.time(); a=[x*x for x in xrange(1000000)]; time.time()-t1
    0.25005197525024414
    >>> t1 = time.time(); a=[x*x+math.sin(x/1000000.) for x in xrange(1000000)]; time.time()-t1
    0.6075689792633057
Both running in 64-bit on a 2.53GHz Core 2 Duo. It looks like PyPy's JIT has some fixed overhead, but can heavily optimize operations once it gets going.

Re: PyPy 1.4: Ouroboros in practice

#3
Your satisfaction is our eternal pursuit.

( http://www.newgoin.com )

We specialized in the exportation of sport shoes and other products(clothing, bag,sunglasses,watches,belts,etc )which have great enjoyed popularty in the world market Many of our goods are on sales ,we can guarantee the crediblity by Pay-pal and delivery time .we would like to make a long termship.

1)Name : The perfect gift. 2)Grade : AAA+ 3)Package : in original boxes 4)Color : various 5)MOQ : 1 pc 6)Payment : Pay-pal/Western Union / Credit card/Moneygram 7)Ship-ping : 4-7 days with guarantee of customs clearance, drop shipp-ing is accepted to customers'demands. 8)Who-lesale: very low price, you can make a small order first to test quality and service.

( http://newgoin.com )

Online Contact . thank you.

Re: PyPy 1.4: Ouroboros in practice

#6
post #5
post #4

I think this is the first PyPy release that's actually viable to use for me (because of x86-64). Very exciting! (Hope they catch up with 2.6 - or 2.7 - soon, though.)

We have a fast-forward branch that is currently working on moving to Python 2.7.

I know, I hope its merging is followed by a quick release. :)

Re: PyPy 1.4: Ouroboros in practice

#10
Currently testing a CPU intensive algorithm I need for my current research project. Hoping it will save me some time. When I am done I will post the results!

[Edit:]

Pretty good so far!

    ~/stuff/Programming/faultire/src/
    hendersont@glycineportable src $ time pypy sleepytree/test_metricspace.py 
    .......
    ----------------------------------------------------------------------
    Ran 7 tests in 39.621s

    OK

    real    0m39.675s
    user    0m39.150s
    sys     0m0.170s
    ~/stuff/Programming/faultire/src/
    hendersont@glycineportable src $ time python sleepytree/test_metricspace.py 
    .......
    ----------------------------------------------------------------------
    Ran 7 tests in 69.442s

    OK

    real    1m9.483s
    user    1m8.970s
    sys     0m0.110s
Post reply on HN