Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Showing content from https://mail.python.org/pipermail/python-dev/2004-March/043784.html below:

[Python-Dev] genexps slow?

• Previous message: [Python-Dev] genexps slow?
• Next message: [Python-Dev] genexps slow?
• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

> Also, try a timing with "sum(x for x in xrange(100000))".  This will
> highlight the differences in behavior.  With xrange, this genexp will be
> able to execute entirely in cache.

It'll also overflow on 32 bit processors.  It may be better stick with
max() or min() to reduce the effect of integer adds.  The one drawback
is that you /may/ need to use big ranges in order to note significant
differences in timings.

 - Josiah

• Previous message: [Python-Dev] genexps slow?
• Next message: [Python-Dev] genexps slow?
• Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4