Mailman 3 September 2003 - Python-checkins

python/dist/src pyconfig.h.in,1.85,1.86
by montanaro＠users.sourceforge.net 25 Sep '03

25 Sep '03

Update of /cvsroot/python/python/dist/src In directory sc8-pr-cvs1:/tmp/cvs-serv22686 Modified Files: pyconfig.h.in Log Message: Typo. HAVE_SYNC -> HAVE_FSYNC Index: pyconfig.h.in =================================================================== RCS file: /cvsroot/python/python/dist/src/pyconfig.h.in,v retrieving revision 1.85 retrieving revision 1.86 diff -C2 -d -r1.85 -r1.86 *** pyconfig.h.in 20 Sep 2003 15:30:20 -0000 1.85 --- pyconfig.h.in 25 Sep 2003 14:50:29 -0000 1.86 *************** *** 487,491 **** /* Define if you have the 'fsync' function. */ ! #undef HAVE_SYNC /* Define to 1 if you have the `sysconf' function. */ --- 487,491 ---- /* Define if you have the 'fsync' function. */ ! #undef HAVE_FSYNC /* Define to 1 if you have the `sysconf' function. */

1 0

python/dist/src configure,1.424,1.425
by montanaro＠users.sourceforge.net 25 Sep '03

25 Sep '03

Update of /cvsroot/python/python/dist/src In directory sc8-pr-cvs1:/tmp/cvs-serv22582 Modified Files: configure Log Message: Type. HAVE_SYNC -> HAVE_FSYNC Index: configure =================================================================== RCS file: /cvsroot/python/python/dist/src/configure,v retrieving revision 1.424 retrieving revision 1.425 diff -C2 -d -r1.424 -r1.425 *** configure 22 Sep 2003 11:14:38 -0000 1.424 --- configure 25 Sep 2003 14:50:04 -0000 1.425 *************** *** 1,6 **** #! /bin/sh ! # From configure.in Revision: 1.434 . # Guess values for system-dependent variables and create Makefiles. ! # Generated by GNU Autoconf 2.53 for python 2.4. # # Copyright 1992, 1993, 1994, 1995, 1996, 1998, 1999, 2000, 2001, 2002 --- 1,6 ---- #! /bin/sh ! # From configure.in Revision: 1.435 . # Guess values for system-dependent variables and create Makefiles. [...13641 lines suppressed...] rm -f $ac_file *************** *** 19121,19126 **** if test "$no_create" != yes; then ac_cs_success=: exec 5>/dev/null ! $SHELL $CONFIG_STATUS || ac_cs_success=false exec 5>>config.log # Use ||, not &&, to avoid exiting from the if with $? = 1, which --- 19957,19965 ---- if test "$no_create" != yes; then ac_cs_success=: + ac_config_status_args= + test "$silent" = yes && + ac_config_status_args="$ac_config_status_args --quiet" exec 5>/dev/null ! $SHELL $CONFIG_STATUS $ac_config_status_args || ac_cs_success=false exec 5>>config.log # Use ||, not &&, to avoid exiting from the if with $? = 1, which

1 0

python/dist/src configure.in,1.435,1.436
by montanaro＠users.sourceforge.net 25 Sep '03

25 Sep '03

Update of /cvsroot/python/python/dist/src In directory sc8-pr-cvs1:/tmp/cvs-serv22369 Modified Files: configure.in Log Message: Typo: HAVE_SYNC -> HAVE_FSYNC Index: configure.in =================================================================== RCS file: /cvsroot/python/python/dist/src/configure.in,v retrieving revision 1.435 retrieving revision 1.436 diff -C2 -d -r1.435 -r1.436 *** configure.in 22 Sep 2003 11:14:40 -0000 1.435 --- configure.in 25 Sep 2003 14:49:15 -0000 1.436 *************** *** 2106,2110 **** AC_MSG_CHECKING(for fsync) AC_TRY_COMPILE([#include <unistd.h>], void *x=fsync, ! AC_DEFINE(HAVE_SYNC, 1, Define if you have the 'fsync' function.) AC_MSG_RESULT(yes), AC_MSG_RESULT(no) --- 2106,2110 ---- AC_MSG_CHECKING(for fsync) AC_TRY_COMPILE([#include <unistd.h>], void *x=fsync, ! AC_DEFINE(HAVE_FSYNC, 1, Define if you have the 'fsync' function.) AC_MSG_RESULT(yes), AC_MSG_RESULT(no)

1 0

python/nondist/sandbox/Lib bdist_dpkg.py,1.3,1.4
by akuchling＠users.sourceforge.net 25 Sep '03

25 Sep '03

Update of /cvsroot/python/python/nondist/sandbox/Lib In directory sc8-pr-cvs1:/tmp/cvs-serv26426 Modified Files: bdist_dpkg.py Log Message: Patch from Mikhail Sobolev: Create debian/copyright file; add gain-root-command (should it default to fakeroot?) and do-not-build (odd name; is dry-run appropriate?) options Index: bdist_dpkg.py =================================================================== RCS file: /cvsroot/python/python/nondist/sandbox/Lib/bdist_dpkg.py,v retrieving revision 1.3 retrieving revision 1.4 diff -C2 -d -r1.3 -r1.4 *** bdist_dpkg.py 23 Sep 2003 13:56:57 -0000 1.3 --- bdist_dpkg.py 25 Sep 2003 12:34:30 -0000 1.4 *************** *** 1,5 **** """distutils.command.bdist_dpkg ! Implements the Distutils 'bdist_dpkg' command (create a Debian packaging). """ --- 1,5 ---- """distutils.command.bdist_dpkg ! Implements the Distutils 'bdist_dpkg' command (create a Debian package). """ *************** *** 18,21 **** --- 18,22 ---- from distutils import log + import time MARKER_STRING = "GENERATED BY BDIST_DPKG" *************** *** 26,35 **** user_options = [ ] ! boolean_options = [] def initialize_options (self): ! pass # initialize_options() --- 27,41 ---- user_options = [ + ('gain-root-command=', 'r', 'command that allows to gain root rights'), + # XXX this option name is a bit odd; what would be a better one? + ('do-not-build', None, 'do not build the package, just create the debian/ stuff') ] ! boolean_options = [ 'do-not-build' ] def initialize_options (self): ! self.gain_root_command = None ! self.do_not_build = None ! # initialize_options() *************** *** 50,56 **** self._create_dpkg_files() ! # build package ! log.info("building DPKG") ! self.spawn(["dpkg-buildpackage", "-rfakeroot"]) # run() --- 56,69 ---- self._create_dpkg_files() ! if not self.do_not_build: ! # build package ! log.info("building DPKG") ! ! build_command = [ "dpkg-buildpackage" ] ! ! if self.gain_root_command is not None: ! build_command.append ('-r%s' % self.gain_root_command) ! ! self.spawn(build_command) # run() *************** *** 79,83 **** # I'm running out of the CVS trunk, but don't have it # installed as python2.4. ! ##pyversion = '2.2' package_name = 'python%s-%s' % (pyversion, dist.get_name().lower()) d = {'name':dist.get_name(), --- 92,96 ---- # I'm running out of the CVS trunk, but don't have it # installed as python2.4. ! pyversion = '2.2' package_name = 'python%s-%s' % (pyversion, dist.get_name().lower()) d = {'name':dist.get_name(), *************** *** 85,89 **** --- 98,109 ---- 'pyversion': pyversion, 'dirlist':dirlist, + 'license':dist.get_license(), 'marker':MARKER_STRING, + 'maintainer':dist.get_maintainer(), + 'maintainer_email':dist.get_maintainer_email(), + 'now':time.strftime ("%a, %d %b %Y %H:%M:%S %z"), + 'author':dist.get_author(), + 'author_email':dist.get_author_email(), + 'url':dist.get_url() } if not self._is_user_file('changelog') or True: *************** *** 94,100 **** * Dummy changelog line ! -- %s <%s> Wed, 11 Jun 2003 14:44:11 -0400 """ % (package_name, dist.get_version(), 1, # XXX build version? ! dist.get_maintainer(), dist.get_maintainer_email())) output.close() --- 114,120 ---- * Dummy changelog line ! -- %s <%s> %s """ % (package_name, dist.get_version(), 1, # XXX build version? ! dist.get_maintainer(), dist.get_maintainer_email(), d['now'])) output.close() *************** *** 147,150 **** --- 167,176 ---- os.chmod('debian/rules', 0755) + if not self._is_user_file('copyright'): + log.info('writing copyright file') + output = self._write_file('copyright') + output.write(COPYRIGHT_FILE % d) + output.close() + def _write_file (self, filename): path = os.path.join('debian', filename) *************** *** 292,293 **** --- 318,333 ---- .PHONY: build clean binary-indep binary install """ + + COPYRIGHT_FILE = '''This package was debianized by + %(maintainer)s <%(maintainer_email)s> on %(now)s + + It was downloaded from + + %(url)s + + Upstream Author: %(author)s <%(author_email)s> + + Copyright: + + %(license)s + '''

1 0

python/dist/src/Doc/dist sysconfig.tex,1.1,1.2
by theller＠users.sourceforge.net 25 Sep '03

25 Sep '03

Update of /cvsroot/python/python/dist/src/Doc/dist In directory sc8-pr-cvs1:/tmp/cvs-serv626 Modified Files: sysconfig.tex Log Message: Typo: sys.prefex -> sys.prefix Closes SF# 812152 Baskport candidate for release23-main Index: sysconfig.tex =================================================================== RCS file: /cvsroot/python/python/dist/src/Doc/dist/sysconfig.tex,v retrieving revision 1.1 retrieving revision 1.2 diff -C2 -d -r1.1 -r1.2 *** sysconfig.tex 2 Aug 2001 15:12:07 -0000 1.1 --- sysconfig.tex 25 Sep 2003 06:26:46 -0000 1.2 *************** *** 25,33 **** \begin{datadesc}{PREFIX} ! The result of \code{os.path.normpath(sys.prefex)}. \end{datadesc} \begin{datadesc}{EXEC_PREFIX} ! The result of \code{os.path.normpath(sys.exec_prefex)}. \end{datadesc} --- 25,33 ---- \begin{datadesc}{PREFIX} ! The result of \code{os.path.normpath(sys.prefix)}. \end{datadesc} \begin{datadesc}{EXEC_PREFIX} ! The result of \code{os.path.normpath(sys.exec_prefix)}. \end{datadesc}

1 0

python/dist/src/Doc/tut tut.tex,1.205,1.206
by montanaro＠users.sourceforge.net 24 Sep '03

24 Sep '03

Update of /cvsroot/python/python/dist/src/Doc/tut In directory sc8-pr-cvs1:/tmp/cvs-serv32445/tut Modified Files: tut.tex Log Message: Add a glossary to the tutorial. Also generate an index. At the moment this mostly only references glossary entries. Index: tut.tex =================================================================== RCS file: /cvsroot/python/python/dist/src/Doc/tut/tut.tex,v retrieving revision 1.205 retrieving revision 1.206 diff -C2 -d -r1.205 -r1.206 *** tut.tex 24 Sep 2003 03:58:56 -0000 1.205 --- tut.tex 24 Sep 2003 16:53:02 -0000 1.206 *************** *** 12,15 **** --- 12,17 ---- \input{boilerplate} + \makeindex + \begin{document} *************** *** 4824,4827 **** --- 4826,4833 ---- \chapter{History and License} \input{license} + + \input{glossary} + + \input{tut.ind} \end{document}

1 0

python/dist/src/Doc Makefile.deps,1.111,1.112
by montanaro＠users.sourceforge.net 24 Sep '03

24 Sep '03

Update of /cvsroot/python/python/dist/src/Doc In directory sc8-pr-cvs1:/tmp/cvs-serv32445 Modified Files: Makefile.deps Log Message: Add a glossary to the tutorial. Also generate an index. At the moment this mostly only references glossary entries. Index: Makefile.deps =================================================================== RCS file: /cvsroot/python/python/dist/src/Doc/Makefile.deps,v retrieving revision 1.111 retrieving revision 1.112 diff -C2 -d -r1.111 -r1.112 *** Makefile.deps 6 Sep 2003 06:42:01 -0000 1.111 --- Makefile.deps 24 Sep 2003 16:53:02 -0000 1.112 *************** *** 69,73 **** texinputs/reportingbugs.tex ! TUTFILES= tut/tut.tex $(MANSTYLES) $(COMMONTEX) # LaTeX source files for the Python Reference Manual --- 69,73 ---- texinputs/reportingbugs.tex ! TUTFILES= tut/tut.tex tut/glossary.tex $(MANSTYLES) $(COMMONTEX) # LaTeX source files for the Python Reference Manual

1 0

python/dist/src/Doc/tut glossary.tex,NONE,1.1
by montanaro＠users.sourceforge.net 24 Sep '03

24 Sep '03

Update of /cvsroot/python/python/dist/src/Doc/tut In directory sc8-pr-cvs1:/tmp/cvs-serv32155 Added Files: glossary.tex Log Message: first cut at a glossary --- NEW FILE: glossary.tex --- \chapter{Glossary\label{glossary}} %%% keep the entries sorted and include at least one \index{} item for each \begin{description} \index{...} \item[...]{The typical Python prompt of the interactive shell when entering code for an indented code block.} \index{>>>} \item[>>>]{The typical Python prompt of the interactive shell. Often seen for code examples that can be tried right away in the interpreter.} \index{__slots__} \item[__slots__]{A declaration inside a new-style class that saves memory by pre-declaring space for instance attributes and eliminating instance dictionaries. Though popular, the technique is somewhat tricky to get right and is best reserved for rare cases where there are large numbers of instances in a memory critical application.} \index{BDFL} \item[BDFL]{Benevolent Dictator For Life, a.k.a. \ulink{Guido van Rossum}{http://www.python.org/~guido/}, Python's creator.} \index{byte code} \item[byte code]{The internal represenatation of a Python program in the interpreter. The byte code is also cached in the \code{.pyc} and {}\code{.pyo} files so that executing the same file is faster the second time (compilation from source to byte code can be saved). This "intermediate language" is said to run on a "virtual machine" that calls the subroutines corresponding to each bytecode.} \index{classic class} \item[classic class]{Any class which does not inherit from \class{object}. See new-style class.} \index{coercion} \item[coercion]{Converting data from one type to another. For example, int(3.15) coerces the floating point number to the integer, 3. Most mathematical operations have rules for coercing their arguments to a common type. For instance, adding 3 + 4.5, causes the integer 3 to be coerced to be a float (3.0) before adding to 4.5 resulting in the float 7.5.} \index{descriptor} \item[descriptor]{Any object that defines the methods __get__(), __set__(), or __delete__(). When a class attribute is a descriptor, its special binding behavior is triggered upon attribute lookup. Normally, writing {}\var{a.b} looks up the object \var{b} in the class dictionary for \var{a}, but if \var{b} is a descriptor, the defined method gets called. Understanding descriptors is a key to a deep understanding of Python because they are the basis for many features including functions, methods,properties, class methods, static methods, and reference to super classes.} \index{dictionary} \item[dictionary]{An associative array, where arbitrary keys are mapped to values. The use of `dict` much resembles that for `list`, but the keys can be any object with a `__hash__` function, not just integers starting from zero. Called a hash in Perl.} \index{EAFP} \item[EAFP]{Easier to ask for forgiveness than permission. This common Python coding style assumes the existance of valid keys or attributes and catches exceptions if the assumption proves false. This clean and fast style is characterized by the presence of many `try` and `except` statments. The technique contrasts with the '''LBYL''' style that is common in many other languages such as C.} \index{__future__} \item[__future__]{A pseudo module which programmers can use to enable new language features which are not compatible with the current interpreter. For example, the expression \code{11 / 4} currently evaluates to \code{2}. If the module in which it is executed had enabled ``true division`` by executing} \begin{verbatim} from __future__ import division \end{verbatim} the expression \code{11 / 4} would evaluate to \code{2.75}. By actually importing the __future__ module and evaluating its variables, you can see when a new feature was first added to the language and when it will becode the default: \begin{verbatim} >>> import __future__ >>> __future__.division _Feature((2, 2, 0, 'alpha', 2), (3, 0, 0, 'alpha', 0), 8192) \end{verbatim} \index{generator} \item[generator]{A function that returns an iterator. It looks like a normal function except that the \keyword{yield} keyword is used instead of {}\keyword{return}. Generator functions often contain one or more {}\keyword{for} or \keyword{while} loops that \keyword{yield} elements back to the caller. The function execution is stopped at the \keyword{yield} keyword (returning the result) and is resumed there when the next element is requested by calling the \function{next()} method of the returned iterator.} \index{GIL} \item[GIL]{See \em{global interpreter lock}.} \index{global interpreter lock} \item[global interpreter lock]{the lock used by Python threads to assure that only one thread can be run at a time. This simplifies Python by assuring that no two processes can access the same memory at the same time. Locking the entire interpreter makes it easier for the interpreter to be multi-threaded, at the expense of some parallelism on multi-processor machines. Efforts have been made in the past to create a "free-threaded" interpreter (one which locks shared data at a much finer granularity), but performance suffered in the common single-processor case.} \index{IDLE} \item[IDLE]{an Integrated Development Environment for Python. IDLE is a basic editor and intepreter environment that ships with the standard distribution of Python. Good for beginners and those on a budget, it also serves as clear example code for those wanting to implement a moderately sophisticated, multi-platform GUI application.} \index{immutable} \item[immutable]{A object with fixed value. Immutable objects are numbers, strings or tuples (and more). Such an object cannot be altered. A new object has to be created if a different value has to be stored. They play an important role in places where a constant hash value is needed. For example as a key in a dictionary.} \index{integer division} \item[integer division]{Mathematical division discarding any remainder. For example, the expression \code{11 / 4} currently evaluates to 2 in contrast to the 2.75 returned by float division. Also called "floor division". When dividing two integers the outcome will always be another integer (having the floor function applied to it). However, if one of the operands is another numeric type (such as a float), the result will be coerced (see coercion) to a common type. For example, a integer divided by a float will result in a float value, possibly with a decimal fraction. Integer division can be forced by using the \code{//} operator instead of the \code{/} operator. See also, __future__.} \index{interactive} \item[interactive]{Python has an interactive interpreter which means that you can try out things and directly see its result. Just launch {}\code{python} with no arguments (possibly by selecting it from your computer's main menu). It is a very powerful way to test out new ideas or inspect modules and packages (remember \code{help(x)}).} \index{interpreted} \item[interpreted]{Python is an interpreted language, opposed to a compiled one. This means that the source files can be run right away without first making an executable which is then run. Interpreted languages typicaly have a shorter development/debug cycle than compiled ones. See also {}\em{interactive}.} \index{iterable} \item[iterable]{A container object capable of returning its members one at a time. Examples of iterables include all sequence types (\class{list}, {}\class{str}, \class{tuple}, etc.) and some non-sequence types like {}\class{dict} and \class{file} and objects of any classes you define with an \function{__iter__} or \function{__getitem__} method. Iterables can be used in a \keyword{for} loop and in many other places where a sequence is needed (\function{zip}, \function{map}, ...). When an iterable object is passed as an argument to the builtin function \function{iter()}, it returns an iterator for the object. This iterator is good for one pass over the set of values. When using iterables, it is usually not necessary to call {}\function{iter()} or deal with iterator objects yourself - the \code{for} statement does that automatically for you, creating a temporary unnamed variable to hold the iterator for the duration of the loop. See also iterator, sequence and generator.} \index{iterator} \item[iterator]{An object representing a stream of data. Repeated calls to the iterator's \function{next()} method return successive items in the stream. When no more data is available a \exception{StopIteration} exception is raised instead. At this point the iterator object is exhausted and any further calls to its \function{next()} method just raise {}\exception{StopIteration} again. Iterators are required to have an {}\function{__iter__()} method that returns the iterator object itself so every iterator is also iterable and may be used in most places where other iterables are accepted. One notable exception is code that attempts multiple iteration passes. A container object (such as a list) produces a fresh new iterator each time you pass it to the \function{iter()} function or use it in a \function{for} loop. Attempting this with an iterator will just return the same exhausted iterator object from the second iteration pass and on, making it appear like an empty container.} \index{list comprehension} \item[list comprehension]{A compact way to process all or a subset of elements in a sequence and return a list with the results. \code{result = ["0x\%02x" \% x for x in range(256) if x \% 2 == 0]} generates a list of strings containing hex numbers (0x..) that are even and in the range from 0 to 255. The \keyword{if} clause is optional. If omitted, all elements in {}\code{range(256)} are processed in that case.} \index{mapping} \item[mapping]{A container object (such as \class{dict}) that supports arbitrary key lookups using the special method \function{__getitem__()}.} \index{metaclass} \item[metaclass]{The class of a class. Class definitions create a class name, a class dictionary, and a list of base classes. The metaclass is responsible for taking those three arguments and creating the class. Most object oriented programming languages provide a default implementation. What makes Python special is that it is possible to create custom metaclasses. Most users never need this tool, but when the need arises, metaclasses can provide powerful, elegant solutions. They have been used for logging attribute access, adding thread-safety, tracking object creation, implementing singletons, and many other tasks.} \index{LBYL} \item[LBYL]{Look before you leap. This coding style explicitly tests for pre-conditions before making calls or lookups. This style contrasts with the EAFP approach and is characterized the presence of many \keyword{if} statements.} \index{mutable} \item[mutable]{Mutable objects can change their value but keep their \function{id()}. See also immutable.} \index{namespace} \item[namespace]{The place where a variable is stored. Namespaces are implemented as dictionary. There is the local, global and builtins namespace and the nested namespaces in objects (in methods). Namespaces support modularity by preventing naming conflicts. For instance, the functions \function{__builtins__.open()} and \function{os.open()} are distinguished by their namespaces. Namespaces also aid readability and maintainabilty by making it clear which modules implement a function. For instance, writing \function{random.seed()} or \function{itertools.izip()} makes it clear that those functions are implemented by the \module{random} and \module{itertools} modules respectively.} \index{nested scope} \item[nested scope]{The ability to refer to a variable in an enclosing definition. For instance, a function defined inside another function can refer to variables in the outer function. Note that nested scopes work only for reference and not for assignment which will always write to the innermost scope. In contrast, local variables both read and write in the innermost scope. Likewise, global variables read and write to the global namespace.} \index{new-style class} \item[new-style class]{Any class that inherits from \class{object}. This includes all built-in types like \class{list} and \class{dict}. Only new style classes can use Python's newer, versatile features like {}\var{__slots__}, descriptors, properties, \var{__getattribute__}, class methods, and static methods.} \index{Python3000} \item[Python3000]{A mythical python release, allowed not to be backward compatible, with telepathic interface.} \index{sequence} \item[sequence]{An iterable which supports efficient element access using integer indices via the \function{__getitem__} and \function{__len()__} special methods. Some builtin sequence types are \class{list}, \class{str}, {}\class{tuple}, and \class{unicode}. Note that \class{dict} also supports {}\function{__getitem__} and \function{__len__}, but is considered a mapping rather than a sequence because the lookups use arbitrary immutable keys rather than integers.} \index{Zen of Python} \item[Zen of Python]{listing of Python design principles and philosophies that are helpful in understanding and using the language. The listing can be found by typing "import this" at the interactive prompt.} \end{description}

1 0

python/nondist/peps pep-0102.txt,1.14,1.15
by theller＠users.sourceforge.net 24 Sep '03

24 Sep '03

Update of /cvsroot/python/python/nondist/peps In directory sc8-pr-cvs1:/tmp/cvs-serv20943 Modified Files: pep-0102.txt Log Message: Document some things to be done on windows, from the 2.3.1 release experience. Replace Tim with Thomas everywhere ;-). Index: pep-0102.txt =================================================================== RCS file: /cvsroot/python/python/nondist/peps/pep-0102.txt,v retrieving revision 1.14 retrieving revision 1.15 diff -C2 -d -r1.14 -r1.15 *** pep-0102.txt 23 Sep 2003 03:25:48 -0000 1.14 --- pep-0102.txt 24 Sep 2003 10:55:43 -0000 1.15 *************** *** 58,64 **** point, nobody except the RM should make any commits to the branch (or his duly assigned agents, i.e. Guido the BDFL, Fred Drake for ! documentation, or Tim Peters for Windows). If the RM screwed up and some desperate last minute change to the branch is ! necessary, it can mean extra work for Fred and Tim. So try to avoid this! --- 58,64 ---- point, nobody except the RM should make any commits to the branch (or his duly assigned agents, i.e. Guido the BDFL, Fred Drake for ! documentation, or Thomas Heller for Windows). If the RM screwed up and some desperate last minute change to the branch is ! necessary, it can mean extra work for Fred and Thomas. So try to avoid this! *************** *** 92,97 **** many places, including the README and LICENSE files. ___ After starting the process, the most important thing to do next ! is to update the Misc/NEWS file. Tim will need this in order to do the Windows release and he likes to stay up late. This step can be pretty tedious, so it's best to get to it immediately --- 92,113 ---- many places, including the README and LICENSE files. + ___ For the Windows build, additional files have to be updated. + + PC/python_nt.rc sets up the DLL version resource for Windows + (displayed when you right-click on the DLL and select + Properties). + + PCBuild/BUILDno.txt contains the Windows build number, see the + instructions in this file how to change it. Saving the project + file PCBuild/pythoncore.dsp results in a change to + PCBuild/pythoncore.dsp as well. + + PCbuild/python20.wse sets up the Windows installer version + resource (displayed when you right-click on the installer .exe + and select Properties), and also contains the Python version + number. + ___ After starting the process, the most important thing to do next ! is to update the Misc/NEWS file. Thomas will need this in order to do the Windows release and he likes to stay up late. This step can be pretty tedious, so it's best to get to it immediately *************** *** 108,112 **** trunk, they've updated the NEWS file accordingly. You can't be positive, so double check. If you're a Unix weenie, it helps to ! verify with Tim Peters about changes on Windows, and Jack Jansen about changes on the Mac. --- 124,128 ---- trunk, they've updated the NEWS file accordingly. You can't be positive, so double check. If you're a Unix weenie, it helps to ! verify with Thomas about changes on Windows, and Jack Jansen about changes on the Mac. *************** *** 123,129 **** ___ Once the release is underway, Fred Drake needs to create the ! HTML from the documentation. He does this and uploads the file to ! www.python.org. Then he tells Tim Peters and Sean Reifschneider where this file is. This may generate some last minute changes on the branch. Once Fred is done, there can be no further checkins on the branch in --- 139,146 ---- ___ Once the release is underway, Fred Drake needs to create the ! HTML from the documentation. He does this and uploads the file ! to www.python.org. Then he tells Thomas and Sean Reifschneider where this file is. + This may generate some last minute changes on the branch. Once Fred is done, there can be no further checkins on the branch in *************** *** 137,151 **** Basically, if it's in Doc/ Fred will take care of it. ! ___ Tim Peters grabs the HTML and uses this to build the Windows ! installer, Sean Reifschneider grabs the HTML and uses this to ! build the Linux RPMs. ! ___ Tim performs his Windows magic, generating an installer ! executable. He uploads this file to python.org. He then sends ! the RM a notice which includes the location and MD5 checksum of ! the Windows executable. ! Note that Tim's creation of the Windows executable may generate ! a few more commits on the branch. Tim will be responsible for merging Windows-specific changes from trunk to branch, and from branch to trunk. --- 154,177 ---- Basically, if it's in Doc/ Fred will take care of it. ! ___ Thomas grabs the HTML to build the Windows helpfile. ! The HTML files are unpacked into a new src/html directory, and ! runs this command to create the project files for MS HTML ! Workshop: ! % python ..\Doc\tools\prechm.py -v 2.3 python23 ! HTML Workshop is then fired up on the created python23.hhp file, ! finally resulting in an python23.chm file. ! ! ___ Thomas compiles everything with MSVC 6.0, and moves the ! python23.chm file into the src/chm directory. The installer ! executable is then generated with Wise Installation System. ! ! He uploads this file to the starship. He then sends the RM a ! notice which includes the location and MD5 checksum of the ! Windows executable. ! ! Note that Thomas's creation of the Windows executable may generate ! a few more commits on the branch. Thomas will be responsible for merging Windows-specific changes from trunk to branch, and from branch to trunk. *************** *** 166,170 **** and/or "U" files. I.e. you better not have any uncommitted changes in your working directory, but you may pick up some of ! Fred's or Tim's last minute changes. ___ Now tag the branch using a symbolic name like "rXYMaZ", --- 192,196 ---- and/or "U" files. I.e. you better not have any uncommitted changes in your working directory, but you may pick up some of ! Fred's or Thomas's last minute changes. ___ Now tag the branch using a symbolic name like "rXYMaZ", *************** *** 216,224 **** figure out what the problem is. ! ___ You need to upload the tgz file to creosote.python.org. Tim ! will have already uploaded the exe file to creosote, but if not, ! you'll need to do that too. These steps can take a long time ! depending on your network bandwidth. scp both files from your ! own machine to creosote. ___ While you're waiting, you can start twiddling the web pages to --- 242,248 ---- figure out what the problem is. ! ___ You need to upload the tgz and the exe file to creosote.python.org. ! This step can take a long time depending on your network ! bandwidth. scp both files from your own machine to creosote. ___ While you're waiting, you can start twiddling the web pages to *************** *** 407,412 **** testing is tiresome but very necessary. ! Concurrent with uploading the installer, Tim installs Python from ! it twice: once into the default directory suggested by the installer, and later into a directory with embedded spaces in its name. For each installation, he runs the full regression suite --- 431,436 ---- testing is tiresome but very necessary. ! Concurrent with uploading the installer, Thomas installs Python ! from it twice: once into the default directory suggested by the installer, and later into a directory with embedded spaces in its name. For each installation, he runs the full regression suite *************** *** 418,422 **** (the "Module Docs" Start menu entry), make sure the "Start Browser" button works, and make sure you can search for a random ! module (Tim uses "random" <wink>) and then that the "go to selected" button works. --- 442,446 ---- (the "Module Docs" Start menu entry), make sure the "Start Browser" button works, and make sure you can search for a random ! module (Thomas uses "random" <wink>) and then that the "go to selected" button works. *************** *** 428,436 **** Repeat all of the above on at least one flavor of Win9x, and one ! of NT/2000. On NT/2000, try both an Admin and a plain User (not ! Power User) account. WRT Step 5 above (verify the release media), since by the time ! release files are ready to download Tim has generally run many Windows tests on the installer he uploaded, he usually doesn't do anything for Step 5 except a full byte-comparison ("fc /b" if --- 452,460 ---- Repeat all of the above on at least one flavor of Win9x, and one ! of NT/2000/XP. On NT/2000/XP, try both an Admin and a plain User ! (not Power User) account. WRT Step 5 above (verify the release media), since by the time ! release files are ready to download Thomas has generally run many Windows tests on the installer he uploaded, he usually doesn't do anything for Step 5 except a full byte-comparison ("fc /b" if

1 0

python/nondist/peps pep-0322.txt, NONE, 1.1 pep-0000.txt, 1.252, 1.253
by rhettinger＠users.sourceforge.net 24 Sep '03

24 Sep '03

Update of /cvsroot/python/python/nondist/peps In directory sc8-pr-cvs1:/tmp/cvs-serv17098 Modified Files: pep-0000.txt Added Files: pep-0322.txt Log Message: Add a new PEP for reverse iteration methods --- NEW FILE: pep-0322.txt --- PEP: 322 Title: Reverse Iteration Methods Version: $Revision: 1.1 $ Last-Modified: $Date: 2003/09/24 10:30:08 $ Author: Raymond Hettinger <python(a)rcn.com> Status: Draft Type: Standards Track Content-Type: text/x-rst Created: 24-Sep-2003 Python-Version: 2.4 Post-History: 24-Sep-2003 Abstract ======== This proposal is to extend the API of several sequence types to include methods for iterating over the sequence in reverse. Motivation ========== For indexable objects, current approaches for reverse iteration are error prone, unnatural, and not especially readable:: for i in xrange(n-1, -1, -1): print seqn[i] One other current approach involves reversing a list before iterating over it. That technique wastes computer cycles, memory, and lines of code. Also, it only works with lists (strings, for example, do not define a reverse method):: rseqn = list(seqn) rseqn.reverse() for value in rseqn: print value Extending slicing minimizes the code overhead but does nothing for memory efficiency, beauty, or clarity. Reverse iteration is much less common than forward iteration, but it does arise regularly in practice. See `Real World Use Cases`_ below. Proposal ======== Add a method called *iter_backwards()* to sequence objects that can benefit from it. The above examples then simplify to:: for i in xrange(n).iter_backwards(): print seqn[i] :: for elem in seqn.iter_backwards(): print elem The new protocol would be applied to lists, strings, xrange objects, and possibly other sequence objects as well (depending on use cases and implementation issues). It would not apply to unordered collections like dicts and sets. No language syntax changes are needed. Alternative Method Names ======================== * *iterbackwards* -- like iteritems() but somewhat long * *backwards* -- more pithy, less explicit * *ireverse* -- reminiscent of imap(), izip(), and ifilter() Open Issues =========== * Should *tuple* objects be included? In the past, they have been denied some list like behaviors such as count() and index(). * Should *file* objects be included? Implementing reverse iteration may not be easy though it would be useful on occasion. * Should *enumerate* objects be included? They can provide reverse iteration only when the underlying sequences support *__len__* and reverse iteration. Real World Use Cases ==================== Here are some instances of reverse iteration taken from the standard library and comments on why reverse iteration was necessary: * atexit.exit_handlers() uses:: while _exithandlers: func, targs, kargs = _exithandlers.pop() . . . The application dictates the need to run exit handlers in the reverse order they were built. The ``while alist: alist.pop()`` form is readable and clean; however, it would be slightly faster and clearer with:: for func, target, kargs in _exithandlers.iter_backwards(): . . . del _exithandlers * difflib.get_close_matches() uses:: result.sort() # Retain only the best n. result = result[-n:] # Move best-scorer to head of list. result.reverse() # Strip scores. return [x for score, x in result] The need for reverse iteration arises from a requirement to return a portion of a sort in an order opposite of the sort criterion. The list comprehension is incidental (the third step of a Schwartzian transform). This particular use case can met with extended slicing, but the code is somewhat unattractive, hard to visually verify, and difficult for beginners to construct:: result.sort() return [x for score, x in result[:-n-1:-1]] The proposed form is much easier to construct and verify:: result.sort() return [x for score, x in result[-n:].iter_backwards()] * heapq.heapify() uses ``for i in xrange(n//2 - 1, -1, -1)`` because higher-level orderings are more easily formed from pairs of lower-level orderings. A forward version of this algorithm is possible; however, that would complicate the rest of the heap code which iterates over the underlying list in the opposite direction. * mhlib.test() uses:: testfolders.reverse(); for t in testfolders: do('mh.deletefolder(%s)' % `t`) The need for reverse iteration arises because the tail of the underlying list is altered during iteration. * platform._dist_try_harder() uses ``for n in range(len(verfiles)-1,-1,-1)`` because the loop deletes selected elements from *verfiles* but needs to leave the rest of the list intact for further iteration. This use case could be addressed with *itertools.ifilter()* but would require the selection predicate to be in a *lambda* expression. The net result is less clear and readable than the original. A better reformulation is to replace the first line with the proposed method. * random.shuffle() uses ``for i in xrange(len(x)-1, 0, -1)`` because the algorithm is most easily understood as randomly selecting elements from an ever diminishing pool. In fact, the algorithm can be run in a forward direction but is less intuitive and rarely presented that way in literature. * rfc822.Message.__delitem__() uses:: list.reverse() for i in list: del self.headers[i] The need for reverse iteration arises because the tail of the underlying list is altered during iteration. Rejected Alternative Ideas ========================== * Add a builtin function, *reverse()* which calls a magic method, __riter__. I see this as more overhead for no additional benefit. * Add a builtin function, *reverse()* which does the above, and if *__riter__* is not found, constructs its own using *__getitem__*, and if *__getitem__* is not found, builds a list from *__iter__* and returns a reverse iterator over the new list. The advantage is that one function takes care of almost everything that is potentially reversible. A disadvantage is that it can invisibility slip in to a low performance mode (in terms of time and memory) which would be more visible with an explicit ``list(obj).reverse()``. Another problem is that *__getitem__* is also used in mappings as well as sequences and that could lead to bizarre results. Copyright ========= This document has been placed in the public domain. .. Local Variables: mode: indented-text indent-tabs-mode: nil sentence-end-double-space: t fill-column: 70 End: Index: pep-0000.txt =================================================================== RCS file: /cvsroot/python/python/nondist/peps/pep-0000.txt,v retrieving revision 1.252 retrieving revision 1.253 diff -C2 -d -r1.252 -r1.253 *** pep-0000.txt 16 Sep 2003 12:07:56 -0000 1.252 --- pep-0000.txt 24 Sep 2003 10:30:08 -0000 1.253 *************** *** 118,121 **** --- 118,122 ---- S 319 Python Synchronize/Asynchronize Block Pelletier S 321 Date/Time Parsing and Formatting Kuchling + S 322 Reverse Iteration Methods Hettinger S 754 IEEE 754 Floating Point Special Values Warnes *************** *** 336,339 **** --- 337,341 ---- I 320 Python 2.4 Release Schedule Warsaw S 321 Date/Time Parsing and Formatting Kuchling + S 322 Reverse Iteration Methods Hettinger SR 666 Reject Foolish Indentation Creighton S 754 IEEE 754 Floating Point Special Values Warnes

1 0