Mailman 3 September 2003 - Python-checkins

python/dist/src/Misc NEWS, 1.337.2.4.2.93, 1.337.2.4.2.94
by jhylton＠users.sourceforge.net 17 Sep '03

17 Sep '03

Update of /cvsroot/python/python/dist/src/Misc In directory sc8-pr-cvs1:/tmp/cvs-serv11644/Misc Modified Files: Tag: release22-maint NEWS Log Message: Backport: Double-fix of crash in Unicode freelist handling. Index: NEWS =================================================================== RCS file: /cvsroot/python/python/dist/src/Misc/NEWS,v retrieving revision 1.337.2.4.2.93 retrieving revision 1.337.2.4.2.94 diff -C2 -d -r1.337.2.4.2.93 -r1.337.2.4.2.94 *** NEWS 3 Sep 2003 04:15:23 -0000 1.337.2.4.2.93 --- NEWS 17 Sep 2003 03:32:41 -0000 1.337.2.4.2.94 *************** *** 3,6 **** --- 3,11 ---- =========================== + - Fixed a bug in the cache of length-one Unicode strings that could + lead to a seg fault. The specific problem occurred when an earlier, + non-fatal error left an uninitialized Unicode object in the + freelist. + - The email package handles some RFC 2231 parameters with missing CHARSET fields better. It also includes a patch to parameter

1 0

python/dist/src/Objects unicodeobject.c, 2.124.6.21, 2.124.6.22
by jhylton＠users.sourceforge.net 17 Sep '03

17 Sep '03

Update of /cvsroot/python/python/dist/src/Objects In directory sc8-pr-cvs1:/tmp/cvs-serv11644/Objects Modified Files: Tag: release22-maint unicodeobject.c Log Message: Backport: Double-fix of crash in Unicode freelist handling. Index: unicodeobject.c =================================================================== RCS file: /cvsroot/python/python/dist/src/Objects/unicodeobject.c,v retrieving revision 2.124.6.21 retrieving revision 2.124.6.22 diff -C2 -d -r2.124.6.21 -r2.124.6.22 *** unicodeobject.c 11 Apr 2003 18:21:22 -0000 2.124.6.21 --- unicodeobject.c 17 Sep 2003 03:32:41 -0000 2.124.6.22 *************** *** 133,137 **** if (unicode == unicode_empty || (unicode->length == 1 && ! unicode->str[0] < 256 && unicode_latin1[unicode->str[0]] == unicode)) { PyErr_SetString(PyExc_SystemError, --- 133,142 ---- if (unicode == unicode_empty || (unicode->length == 1 && ! /* MvL said unicode->str[] may be signed. Python generally assumes ! * an int contains at least 32 bits, and we don't use more than ! * 32 bits even in a UCS4 build, so casting to unsigned int should ! * be correct. ! */ ! (unsigned int)unicode->str[0] < 256U && unicode_latin1[unicode->str[0]] == unicode)) { PyErr_SetString(PyExc_SystemError, *************** *** 212,215 **** --- 217,228 ---- goto onError; } + /* Initialize the first element to guard against cases where + * the caller fails before initializing str -- unicode_resize() + * reads str[0], and the Keep-Alive optimization can keep memory + * allocated for str alive across a call to unicode_dealloc(unicode). + * We don't want unicode_resize to read uninitialized memory in + * that case. + */ + unicode->str[0] = 0; unicode->str[length] = 0; unicode->length = length;

1 0

[Python-checkins] python/dist/src/Objects unicodeobject.c, 2.190.6.6, 2.190.6.7
by jhylton＠users.sourceforge.net 17 Sep '03

17 Sep '03

Update of /cvsroot/python/python/dist/src/Objects In directory sc8-pr-cvs1:/tmp/cvs-serv10100 Modified Files: Tag: release23-maint unicodeobject.c Log Message: Backport Tim's portability improvement and comments. Index: unicodeobject.c =================================================================== RCS file: /cvsroot/python/python/dist/src/Objects/unicodeobject.c,v retrieving revision 2.190.6.6 retrieving revision 2.190.6.7 diff -C2 -d -r2.190.6.6 -r2.190.6.7 *** unicodeobject.c 16 Sep 2003 20:30:03 -0000 2.190.6.6 --- unicodeobject.c 17 Sep 2003 03:22:27 -0000 2.190.6.7 *************** *** 133,137 **** if (unicode == unicode_empty || (unicode->length == 1 && ! unicode->str[0] < 256U && unicode_latin1[unicode->str[0]] == unicode)) { PyErr_SetString(PyExc_SystemError, --- 133,142 ---- if (unicode == unicode_empty || (unicode->length == 1 && ! /* MvL said unicode->str[] may be signed. Python generally assumes ! * an int contains at least 32 bits, and we don't use more than ! * 32 bits even in a UCS4 build, so casting to unsigned int should ! * be correct. ! */ ! (unsigned int)unicode->str[0] < 256U && unicode_latin1[unicode->str[0]] == unicode)) { PyErr_SetString(PyExc_SystemError, *************** *** 212,215 **** --- 217,227 ---- goto onError; } + /* Initialize the first element to guard against cases where + * the caller fails before initializing str -- unicode_resize() + * reads str[0], and the Keep-Alive optimization can keep memory + * allocated for str alive across a call to unicode_dealloc(unicode). + * We don't want unicode_resize to read uninitialized memory in + * that case. + */ unicode->str[0] = 0; unicode->str[length] = 0;

1 0

python/dist/src/Doc/lib libunittest.tex, 1.14, 1.14.8.1
by rhettinger＠users.sourceforge.net 16 Sep '03

16 Sep '03

Update of /cvsroot/python/python/dist/src/Doc/lib In directory sc8-pr-cvs1:/tmp/cvs-serv7130 Modified Files: Tag: release23-maint libunittest.tex Log Message: * Minor wording change * Reference the doctest.DocTestSuite() conversion tool. Index: libunittest.tex =================================================================== RCS file: /cvsroot/python/python/dist/src/Doc/lib/libunittest.tex,v retrieving revision 1.14 retrieving revision 1.14.8.1 diff -C2 -d -r1.14 -r1.14.8.1 *** libunittest.tex 10 Jul 2003 22:14:41 -0000 1.14 --- libunittest.tex 16 Sep 2003 22:05:33 -0000 1.14.8.1 *************** *** 92,96 **** ! \subsection{Minimal example \label{minimal-example}} The \module{unittest} module provides a rich set of tools for --- 92,96 ---- ! \subsection{Basic example \label{minimal-example}} The \module{unittest} module provides a rich set of tools for *************** *** 388,392 **** You can place the definitions of test cases and test suites in the ! same modules as the code they are to test (e.g.\ \file{widget.py}), but there are several advantages to placing the test code in a separate module, such as \file{widgettests.py}: --- 388,392 ---- You can place the definitions of test cases and test suites in the ! same modules as the code they are to test (such as \file{widget.py}), but there are several advantages to placing the test code in a separate module, such as \file{widgettests.py}: *************** *** 516,519 **** --- 516,525 ---- \end{verbatim} \end{funcdesc} + + In some cases, the existing tests may have be written using the + \module{doctest} module. If so, that module provides a + \class{DocTestSuite} class that can automatically build + \class{unittest.TestSuite} instances from the existing test code. + \versionadded{2.3}

1 0

python/dist/src/Doc/lib libunittest.tex, 1.14, 1.15
by rhettinger＠users.sourceforge.net 16 Sep '03

16 Sep '03

Update of /cvsroot/python/python/dist/src/Doc/lib In directory sc8-pr-cvs1:/tmp/cvs-serv6908 Modified Files: libunittest.tex Log Message: * Minor wording change * Reference the doctest.DocTestSuite() conversion tool. Index: libunittest.tex =================================================================== RCS file: /cvsroot/python/python/dist/src/Doc/lib/libunittest.tex,v retrieving revision 1.14 retrieving revision 1.15 diff -C2 -d -r1.14 -r1.15 *** libunittest.tex 10 Jul 2003 22:14:41 -0000 1.14 --- libunittest.tex 16 Sep 2003 22:04:31 -0000 1.15 *************** *** 92,96 **** ! \subsection{Minimal example \label{minimal-example}} The \module{unittest} module provides a rich set of tools for --- 92,96 ---- ! \subsection{Basic example \label{minimal-example}} The \module{unittest} module provides a rich set of tools for *************** *** 388,392 **** You can place the definitions of test cases and test suites in the ! same modules as the code they are to test (e.g.\ \file{widget.py}), but there are several advantages to placing the test code in a separate module, such as \file{widgettests.py}: --- 388,392 ---- You can place the definitions of test cases and test suites in the ! same modules as the code they are to test (such as \file{widget.py}), but there are several advantages to placing the test code in a separate module, such as \file{widgettests.py}: *************** *** 516,519 **** --- 516,525 ---- \end{verbatim} \end{funcdesc} + + In some cases, the existing tests may have be written using the + \module{doctest} module. If so, that module provides a + \class{DocTestSuite} class that can automatically build + \class{unittest.TestSuite} instances from the existing test code. + \versionadded{2.3}

1 0

python/dist/src/Doc/lib libdbhash.tex, 1.7, 1.8 libbsddb.tex, 1.12, 1.13
by rhettinger＠users.sourceforge.net 16 Sep '03

16 Sep '03

Update of /cvsroot/python/python/dist/src/Doc/lib In directory sc8-pr-cvs1:/tmp/cvs-serv2869 Modified Files: libdbhash.tex libbsddb.tex Log Message: Minor fixups Index: libdbhash.tex =================================================================== RCS file: /cvsroot/python/python/dist/src/Doc/lib/libdbhash.tex,v retrieving revision 1.7 retrieving revision 1.8 diff -C2 -d -r1.7 -r1.8 *** libdbhash.tex 12 Sep 2003 06:33:37 -0000 1.7 --- libdbhash.tex 16 Sep 2003 21:45:22 -0000 1.8 *************** *** 74,78 **** \begin{verbatim} print db.first() ! for i in xrange(1, len(d)): print db.next() \end{verbatim} --- 74,78 ---- \begin{verbatim} print db.first() ! for i in xrange(1, len(db)): print db.next() \end{verbatim} Index: libbsddb.tex =================================================================== RCS file: /cvsroot/python/python/dist/src/Doc/lib/libbsddb.tex,v retrieving revision 1.12 retrieving revision 1.13 diff -C2 -d -r1.12 -r1.13 *** libbsddb.tex 12 Sep 2003 06:33:37 -0000 1.12 --- libbsddb.tex 16 Sep 2003 21:45:22 -0000 1.13 *************** *** 103,107 **** Once instantiated, hash, btree and record objects support the same methods as dictionaries. In addition, they support ! the following methods: \begin{methoddesc}{close}{} --- 103,108 ---- Once instantiated, hash, btree and record objects support the same methods as dictionaries. In addition, they support ! the methods listed below. ! \versionchanged[Added dictionary methods]{2.3.1} \begin{methoddesc}{close}{}

1 0

python/dist/src/Misc NEWS,1.831.4.44,1.831.4.45
by rhettinger＠users.sourceforge.net 16 Sep '03

16 Sep '03

Update of /cvsroot/python/python/dist/src/Misc In directory sc8-pr-cvs1:/tmp/cvs-serv1770/Misc Modified Files: Tag: release23-maint NEWS Log Message: Fix documentation bugs. Add support for iterators and other mapping methods. Convert tests to unittest format and expand their coverage. Index: NEWS =================================================================== RCS file: /cvsroot/python/python/dist/src/Misc/NEWS,v retrieving revision 1.831.4.44 retrieving revision 1.831.4.45 diff -C2 -d -r1.831.4.44 -r1.831.4.45 *** NEWS 16 Sep 2003 20:30:01 -0000 1.831.4.44 --- NEWS 16 Sep 2003 21:42:12 -0000 1.831.4.45 *************** *** 60,63 **** --- 60,66 ---- ------- + - The bsddb module and dbhash module now support the iterator and + mapping protocols. + - Bug #711632: Reset all state members in HTMLParser.reset.

1 0

python/dist/src/Lib/bsddb __init__.py, 1.5, 1.5.10.1
by rhettinger＠users.sourceforge.net 16 Sep '03

16 Sep '03

Update of /cvsroot/python/python/dist/src/Lib/bsddb In directory sc8-pr-cvs1:/tmp/cvs-serv1770/Lib/bsddb Modified Files: Tag: release23-maint __init__.py Log Message: Fix documentation bugs. Add support for iterators and other mapping methods. Convert tests to unittest format and expand their coverage. Index: __init__.py =================================================================== RCS file: /cvsroot/python/python/dist/src/Lib/bsddb/__init__.py,v retrieving revision 1.5 retrieving revision 1.5.10.1 diff -C2 -d -r1.5 -r1.5.10.1 *** __init__.py 24 Apr 2003 16:02:44 -0000 1.5 --- __init__.py 16 Sep 2003 21:42:13 -0000 1.5.10.1 *************** *** 53,58 **** #---------------------------------------------------------------------- ! class _DBWithCursor: """ A simple wrapper around DB that makes it look like the bsddbobject in --- 53,59 ---- #---------------------------------------------------------------------- + import UserDict ! class _DBWithCursor(UserDict.DictMixin): """ A simple wrapper around DB that makes it look like the bsddbobject in *************** *** 145,148 **** --- 146,166 ---- return self.db.sync() + def __iter__(self): + try: + yield self.first()[0] + next = self.next + while 1: + yield next()[0] + except _bsddb.DBNotFoundError: + return + + def iteritems(self): + try: + yield self.first() + next = self.next + while 1: + yield next() + except _bsddb.DBNotFoundError: + return #----------------------------------------------------------------------

1 0

python/dist/src/Lib/test test_bsddb.py, 1.12, 1.12.16.1
by rhettinger＠users.sourceforge.net 16 Sep '03

16 Sep '03

Update of /cvsroot/python/python/dist/src/Lib/test In directory sc8-pr-cvs1:/tmp/cvs-serv1770/Lib/test Modified Files: Tag: release23-maint test_bsddb.py Log Message: Fix documentation bugs. Add support for iterators and other mapping methods. Convert tests to unittest format and expand their coverage. Index: test_bsddb.py =================================================================== RCS file: /cvsroot/python/python/dist/src/Lib/test/test_bsddb.py,v retrieving revision 1.12 retrieving revision 1.12.16.1 diff -C2 -d -r1.12 -r1.12.16.1 *** test_bsddb.py 9 Aug 2002 16:37:35 -0000 1.12 --- test_bsddb.py 16 Sep 2003 21:42:13 -0000 1.12.16.1 *************** *** 1,82 **** #! /usr/bin/env python ! """Test script for the bsddb C module ! Roger E. Masse """ import os import bsddb import dbhash # Just so we know it's imported ! from test.test_support import verbose, verify, TESTFN ! def test(openmethod, what, ondisk=1): ! if verbose: ! print '\nTesting: ', what, (ondisk and "on disk" or "in memory") ! if ondisk: ! fname = TESTFN ! else: ! fname = None ! f = openmethod(fname, 'c') ! verify(f.keys() == []) ! if verbose: ! print 'creation...' ! f['0'] = '' ! f['a'] = 'Guido' ! f['b'] = 'van' ! f['c'] = 'Rossum' ! f['d'] = 'invented' ! f['f'] = 'Python' ! if verbose: ! print '%s %s %s' % (f['a'], f['b'], f['c']) ! if what == 'BTree' : ! if verbose: ! print 'key ordering...' ! f.set_location(f.first()[0]) ! while 1: ! try: ! rec = f.next() ! except KeyError: ! if rec != f.last(): ! print 'Error, last != last!' ! f.previous() ! break ! if verbose: ! print rec ! if not f.has_key('a'): ! print 'Error, missing key!' ! f.sync() ! f.close() ! if ondisk: ! # if we're using an in-memory only db, we can't reopen it ! # so finish here. ! if verbose: ! print 'modification...' ! f = openmethod(fname, 'w') ! f['d'] = 'discovered' ! if verbose: ! print 'access...' ! for key in f.keys(): ! word = f[key] ! if verbose: ! print word ! f.close() ! try: ! os.remove(fname) ! except os.error: ! pass ! types = [(bsddb.btopen, 'BTree'), ! (bsddb.hashopen, 'Hash Table'), ! (bsddb.btopen, 'BTree', 0), ! (bsddb.hashopen, 'Hash Table', 0), ! # (bsddb.rnopen,'Record Numbers'), 'put' for RECNO for bsddb 1.85 ! # appears broken... at least on ! # Solaris Intel - rmasse 1/97 ! ] ! for type in types: ! test(*type) --- 1,167 ---- #! /usr/bin/env python ! """Test script for the bsddb C module by Roger E. Masse ! Adapted to unittest format and expanded scope by Raymond Hettinger """ import os import bsddb import dbhash # Just so we know it's imported ! import unittest ! from test import test_support ! from sets import Set ! class TestBSDDB(unittest.TestCase): ! def setUp(self): ! self.f = self.openmethod[0](self.fname, 'c') ! self.d = dict(q='Guido', w='van', e='Rossum', r='invented', t='Python', y='') ! for k, v in self.d.iteritems(): ! self.f[k] = v ! def tearDown(self): ! self.f.sync() ! self.f.close() ! if self.fname is None: ! return ! try: ! os.remove(self.fname) ! except os.error: ! pass ! def test_getitem(self): ! for k, v in self.d.iteritems(): ! self.assertEqual(self.f[k], v) ! def test_len(self): ! self.assertEqual(len(self.f), len(self.d)) ! def test_change(self): ! self.f['r'] = 'discovered' ! self.assertEqual(self.f['r'], 'discovered') ! self.assert_('r' in self.f.keys()) ! self.assert_('discovered' in self.f.values()) ! def test_close_and_reopen(self): ! if self.fname is None: ! # if we're using an in-memory only db, we can't reopen it ! # so finish here. ! return ! self.f.close() ! self.f = self.openmethod[0](self.fname, 'w') ! for k, v in self.d.iteritems(): ! self.assertEqual(self.f[k], v) ! def assertSetEquals(self, seqn1, seqn2): ! self.assertEqual(Set(seqn1), Set(seqn2)) ! def test_mapping_iteration_methods(self): ! f = self.f ! d = self.d ! self.assertSetEquals(d, f) ! self.assertSetEquals(d.keys(), f.keys()) ! self.assertSetEquals(d.values(), f.values()) ! self.assertSetEquals(d.items(), f.items()) ! self.assertSetEquals(d.iterkeys(), f.iterkeys()) ! self.assertSetEquals(d.itervalues(), f.itervalues()) ! self.assertSetEquals(d.iteritems(), f.iteritems()) ! ! def test_first_next_looping(self): ! items = [self.f.first()] ! for i in xrange(1, len(self.f)): ! items.append(self.f.next()) ! self.assertSetEquals(items, self.d.items()) ! ! def test_previous_last_looping(self): ! items = [self.f.last()] ! for i in xrange(1, len(self.f)): ! items.append(self.f.previous()) ! self.assertSetEquals(items, self.d.items()) ! ! def test_set_location(self): ! self.assertEqual(self.f.set_location('e'), ('e', self.d['e'])) ! ! def test_contains(self): ! for k in self.d: ! self.assert_(k in self.f) ! self.assert_('not here' not in self.f) ! ! def test_has_key(self): ! for k in self.d: ! self.assert_(self.f.has_key(k)) ! self.assert_(not self.f.has_key('not here')) ! ! def test_clear(self): ! self.f.clear() ! self.assertEqual(len(self.f), 0) ! ! def test_popitem(self): ! k, v = self.f.popitem() ! self.assert_(k in self.d) ! self.assert_(v in self.d.values()) ! self.assert_(k not in self.f) ! self.assertEqual(len(self.d)-1, len(self.f)) ! ! def test_pop(self): ! k = 'w' ! v = self.f.pop(k) ! self.assertEqual(v, self.d[k]) ! self.assert_(k not in self.f) ! self.assert_(v not in self.f.values()) ! self.assertEqual(len(self.d)-1, len(self.f)) ! ! def test_get(self): ! self.assertEqual(self.f.get('NotHere'), None) ! self.assertEqual(self.f.get('NotHere', 'Default'), 'Default') ! self.assertEqual(self.f.get('q', 'Default'), self.d['q']) ! ! def test_setdefault(self): ! self.assertEqual(self.f.setdefault('new', 'dog'), 'dog') ! self.assertEqual(self.f.setdefault('r', 'cat'), self.d['r']) ! ! def test_update(self): ! new = dict(y='life', u='of', i='brian') ! self.f.update(new) ! self.d.update(new) ! for k, v in self.d.iteritems(): ! self.assertEqual(self.f[k], v) ! ! def test_keyordering(self): ! if self.openmethod[0] is not bsddb.btopen: ! return ! keys = self.d.keys() ! keys.sort() ! self.assertEqual(self.f.first()[0], keys[0]) ! self.assertEqual(self.f.next()[0], keys[1]) ! self.assertEqual(self.f.last()[0], keys[-1]) ! self.assertEqual(self.f.previous()[0], keys[-2]) ! self.assertEqual(list(self.f), keys) ! ! class TestBTree(TestBSDDB): ! fname = test_support.TESTFN ! openmethod = [bsddb.btopen] ! ! class TestBTree_InMemory(TestBSDDB): ! fname = None ! openmethod = [bsddb.btopen] ! ! class TestHashTable(TestBSDDB): ! fname = test_support.TESTFN ! openmethod = [bsddb.hashopen] ! ! class TestHashTable_InMemory(TestBSDDB): ! fname = None ! openmethod = [bsddb.hashopen] ! ! ## # (bsddb.rnopen,'Record Numbers'), 'put' for RECNO for bsddb 1.85 ! ## # appears broken... at least on ! ## # Solaris Intel - rmasse 1/97 ! ! def test_main(verbose=None): ! test_support.run_unittest( ! TestBTree, ! TestHashTable, ! TestBTree_InMemory, ! TestHashTable_InMemory, ! ) ! ! if __name__ == "__main__": ! test_main(verbose=True)

1 0

python/dist/src/Doc/lib libdbhash.tex, 1.5.36.1, 1.5.36.2 libbsddb.tex, 1.11, 1.11.10.1
by rhettinger＠users.sourceforge.net 16 Sep '03

16 Sep '03

Update of /cvsroot/python/python/dist/src/Doc/lib In directory sc8-pr-cvs1:/tmp/cvs-serv1770/Doc/lib Modified Files: Tag: release23-maint libdbhash.tex libbsddb.tex Log Message: Fix documentation bugs. Add support for iterators and other mapping methods. Convert tests to unittest format and expand their coverage. Index: libdbhash.tex =================================================================== RCS file: /cvsroot/python/python/dist/src/Doc/lib/libdbhash.tex,v retrieving revision 1.5.36.1 retrieving revision 1.5.36.2 diff -C2 -d -r1.5.36.1 -r1.5.36.2 *** libdbhash.tex 10 Sep 2003 04:45:22 -0000 1.5.36.1 --- libdbhash.tex 16 Sep 2003 21:42:13 -0000 1.5.36.2 *************** *** 52,61 **** The database objects returned by \function{open()} provide the methods ! common to all the DBM-style databases. The following methods are ! available in addition to the standard methods. \begin{methoddesc}[dbhash]{first}{} ! It's possible to loop over every key in the database using this method ! and the \method{next()} method. The traversal is ordered by the databases internal hash values, and won't be sorted by the key values. This method returns the starting key. --- 52,61 ---- The database objects returned by \function{open()} provide the methods ! common to all the DBM-style databases and mapping objects. The following ! methods are available in addition to the standard methods. \begin{methoddesc}[dbhash]{first}{} ! It's possible to loop over every key/value pair in the database using ! this method and the \method{next()} method. The traversal is ordered by the databases internal hash values, and won't be sorted by the key values. This method returns the starting key. *************** *** 63,72 **** \begin{methoddesc}[dbhash]{last}{} ! Return the last key in a database traversal. This may be used to begin a reverse-order traversal; see \method{previous()}. \end{methoddesc} \begin{methoddesc}[dbhash]{next}{} ! Returns the key next key in a database traversal. The following code prints every key in the database \code{db}, without having to create a list in memory that contains them all: --- 63,72 ---- \begin{methoddesc}[dbhash]{last}{} ! Return the last key/value pair in a database traversal. This may be used to begin a reverse-order traversal; see \method{previous()}. \end{methoddesc} \begin{methoddesc}[dbhash]{next}{} ! Returns the key next key/value pair in a database traversal. The following code prints every key in the database \code{db}, without having to create a list in memory that contains them all: *************** *** 74,78 **** \begin{verbatim} print db.first() ! for i in xrange(1, len(d)): print db.next() \end{verbatim} --- 74,78 ---- \begin{verbatim} print db.first() ! for i in xrange(1, len(db)): print db.next() \end{verbatim} *************** *** 80,84 **** \begin{methoddesc}[dbhash]{previous}{} ! Returns the previous key in a forward-traversal of the database. In conjunction with \method{last()}, this may be used to implement a reverse-order traversal. --- 80,84 ---- \begin{methoddesc}[dbhash]{previous}{} ! Returns the previous key/value pair in a forward-traversal of the database. In conjunction with \method{last()}, this may be used to implement a reverse-order traversal. Index: libbsddb.tex =================================================================== RCS file: /cvsroot/python/python/dist/src/Doc/lib/libbsddb.tex,v retrieving revision 1.11 retrieving revision 1.11.10.1 diff -C2 -d -r1.11 -r1.11.10.1 *** libbsddb.tex 28 May 2003 16:20:03 -0000 1.11 --- libbsddb.tex 16 Sep 2003 21:42:13 -0000 1.11.10.1 *************** *** 101,106 **** \subsection{Hash, BTree and Record Objects \label{bsddb-objects}} ! Once instantiated, hash, btree and record objects support the following ! methods: \begin{methoddesc}{close}{} --- 101,108 ---- \subsection{Hash, BTree and Record Objects \label{bsddb-objects}} ! Once instantiated, hash, btree and record objects support ! the same methods as dictionaries. In addition, they support ! the methods listed below. ! \versionchanged[Added mapping methods]{2.3.1} \begin{methoddesc}{close}{} *************** *** 178,181 **** --- 180,197 ---- >>> db.previous() ('1', '1') + >>> for k, v in db.iteritems(): + ... print k, v + 0 0 + 1 1 + 2 4 + 3 9 + 4 16 + 5 25 + 6 36 + 7 49 + 8 64 + 9 81 + >>> 8 in db + True >>> db.sync() 0

1 0