Mailman 3 May 2012 - Python-Dev

CRLF line endings
by Vinay Sajip 03 May '12

03 May '12

To facilitate review of the PEP 405 reference implementation, I want to update my sandbox repository on hg.python.org with the relevant changes, so I can create a patch for Rietveld. I've added some files with CRLF line endings: Lib/venv/scripts/nt/Activate.ps1 Lib/venv/scripts/nt/Dectivate.ps1 Lib/venv/scripts/nt/activate.bat Although these are text files, the CRLF line endings are needed because otherwise, the files won't be presented correctly on Windows, e.g. in Notepad. I'd like to update the .hgeol file to add these entries, as otherwise the commit hook rejects them. Can anyone please let me know if they object? Otherwise I'll go ahead and add them to .hgeol in the next hour or so. Regards, Vinay Sajip

5 6

Re: [Python-Dev] [Python-checkins] cpython: unicode_writer: add finish() method and assertions to write_str() method
by Benjamin Peterson 03 May '12

03 May '12

2012/5/3 victor.stinner <python-checkins(a)python.org>: > Py_LOCAL_INLINE(void) Do these have to be marked inline? -- Regards, Benjamin

2 1

Re: [Python-Dev] [Python-checkins] cpython: Issue #14687: str%tuple now uses an optimistic "unicode writer" instead of an
by Terry Reedy 03 May '12

03 May '12

On 5/3/2012 7:16 AM, victor.stinner wrote: > http://hg.python.org/cpython/rev/f1db931b93d3 > changeset: 76730:f1db931b93d3 > user: Victor Stinner<victor.stinner(a)gmail.com> > date: Thu May 03 13:10:40 2012 +0200 > summary: > Issue #14687: str%tuple now uses an optimistic "unicode writer" instead of an > accumulator. Directly write characters into the output (don't use a temporary > list): resize and widen the string on demand. I am curious whether these optimizations for str % tuple get applied to equivalent str.format(*tuple) calls or if you plan to make them do so. It seems to me that there could be one internal function that does the concatenation, with lengthening and resizing, of literal and formatted substrings, for both interfaces. tjr

2 1

outdated info on download pages for older versions
by Carl Meyer 03 May '12

03 May '12

Hi all, Are the download pages for older Python versions supposed to be kept up to date at all? I just noticed that the 2.4.6 download page (http://www.python.org/download/releases/2.4.6/) says things like "Python 2.4 is now in security-fix-only mode" (whereas in fact it no longer gets even security fixes), and "Python 2.6 is the latest release of Python." While checking to see if there was a SIG that would be more appropriate for this question, I also noticed that if one clicks on Community | Mailing Lists in the left sidebar of python.org, there's a "Special Interest Groups" link under "Mailing Lists" which is a 404 (not to mention redundant, as there's also one parallel to "Mailing Lists" that works). (Please do let me know if there is a more appropriate forum for website issues/questions). Carl

6 7

Re: [Python-Dev] [Python-checkins] cpython: Fix PyUnicode_Substring() for start >= length and start > end
by Nick Coghlan 02 May '12

02 May '12

On Thu, May 3, 2012 at 10:33 AM, victor.stinner <python-checkins(a)python.org> wrote: > + if (start >= length || end < start) { > + assert(end == length); > + return PyUnicode_New(0, 0); > + } That assert doesn't look right. Consider: "abc"[4:1] Unless I'm missing something, "end" will be 1, but "length" will be 3 Cheers, Nick. -- Nick Coghlan | ncoghlan(a)gmail.com | Brisbane, Australia

2 1

Re: [Python-Dev] cpython: Move make_key() out of the decorator body. Make keys that only need to be
by Antoine Pitrou 01 May '12

01 May '12

On Tue, 01 May 2012 07:32:36 +0200 raymond.hettinger <python-checkins(a)python.org> wrote: > http://hg.python.org/cpython/rev/f981fe3b8bf7 > changeset: 76681:f981fe3b8bf7 > user: Raymond Hettinger <python(a)rcn.com> > date: Mon Apr 30 22:32:16 2012 -0700 > summary: > Move make_key() out of the decorator body. Make keys that only need to be hashed once. How does it work? A new _CacheKey instance is created at each cache lookup anyway. Regards Antoine.

1 0

Re: [Python-Dev] cpython: Issue #14428: Use the new time.perf_counter() and time.process_time() functions
by Georg Brandl 01 May '12

01 May '12

On 29.04.2012 03:04, victor.stinner wrote: > http://hg.python.org/cpython/rev/bd195749c0a2 > changeset: 76599:bd195749c0a2 > user: Victor Stinner <victor.stinner(a)gmail.com> > date: Sun Apr 29 03:01:20 2012 +0200 > summary: > Issue #14428: Use the new time.perf_counter() and time.process_time() functions [...] > diff --git a/Lib/timeit.py b/Lib/timeit.py > --- a/Lib/timeit.py > +++ b/Lib/timeit.py > @@ -15,8 +15,8 @@ > -n/--number N: how many times to execute 'statement' (default: see below) > -r/--repeat N: how many times to repeat the timer (default 3) > -s/--setup S: statement to be executed once initially (default 'pass') > - -t/--time: use time.time() (default on Unix) > - -c/--clock: use time.clock() (default on Windows) > + -t/--time: use time.time() > + -c/--clock: use time.clock() Does it make sense to keep the options this way? IMO the distinction should be to use either perf_counter() or process_time(), and the options could implement this (-t -> perf_counter, -c -> process_time). Georg

2 2

Re: [Python-Dev] [Python-checkins] cpython: Handle a possible race condition
by Nick Coghlan 30 Apr '12

30 Apr '12

On Tue, May 1, 2012 at 10:35 AM, raymond.hettinger <python-checkins(a)python.org> wrote: > http://hg.python.org/cpython/rev/b3aeaef6c315 > changeset: 76675:b3aeaef6c315 > user: Raymond Hettinger <python(a)rcn.com> > date: Mon Apr 30 14:14:28 2012 -0700 > summary: > Handle a possible race condition > > files: > Lib/functools.py | 6 ++++++ > 1 files changed, 6 insertions(+), 0 deletions(-) > > > diff --git a/Lib/functools.py b/Lib/functools.py > --- a/Lib/functools.py > +++ b/Lib/functools.py > @@ -241,6 +241,12 @@ > return result > result = user_function(*args, **kwds) > with lock: > + if key in cache: > + # getting here means that this same key was added to the > + # cache while the lock was released. since the link > + # update is already done, we need only return the > + # computed result and update the count of misses. > + pass > if currsize < maxsize: > # put result in a new link at the front of the queue > last = root[PREV] To get the desired effect, I believe you also need s/if currsize/elif currsize/ Cheers, Nick. -- Nick Coghlan | ncoghlan(a)gmail.com | Brisbane, Australia

1 0