🌐 Mailman 3 April 2004 - Python-list - python.org

PyXML 0.8.2 is released
by martin＠v.loewis.de July 17, 2012

July 17, 2012

Version 0.8.2 of the Python/XML distribution is now available. It should be considered a beta release, and can be downloaded from the following URLs: http://prdownloads.sourceforge.net/pyxml/PyXML-0.8.2.tar.gz http://prdownloads.sourceforge.net/pyxml/PyXML-0.8.2.win32-py2.2.exe http://prdownloads.sourceforge.net/pyxml/PyXML-0.8.2-2.2.Suse81.i386.rpm Changes in this version, compared to 0.8.1: * Updated to Expat 1.95.6. * Support more DOM L3 features in minidom: isWhitespaceInElementContent, schemaType, isId, DOMImplementationSource * Various bug fixes, including - 609641: minidom nodes not pickleable - 618156: Use character references in XMLGenerator if necessary - 622286: marshal.wddx: 'recordset' element typo - 624420: Can't create 2nd Sax2.Reader - 665486: Implement SAX skippedEntity for Expat The Python/XML distribution contains the basic tools required for processing XML data using the Python programming language, assembled into one easy-to-install package. The distribution includes parsers and standard interfaces such as SAX and DOM, along with various other useful modules. The package currently contains: * XML parsers: Pyexpat (Jack Jansen), xmlproc (Lars Marius Garshol), sgmlop (Fredrik Lundh). * SAX interface (Lars Marius Garshol) * minidom DOM implementation (Paul Prescod, others) * 4DOM and 4XPath from Fourthought (Uche Ogbuji, Mike Olson) * Schema implementations: TREX (James Tauber) * Various utility modules and functions (various people) * Documentation and example programs (various people) The code is being developed bazaar-style by contributors from the Python XML Special Interest Group, so please send comments and questions to <xml-sig(a)python.org>. Bug reports may be filed on SourceForge: http://sourceforge.net/tracker/index.php?group_id=6473&atid=106473 For more information about Python and XML, see: http://www.python.org/topics/xml/ -- Martin v. Löwis http://www.informatik.hu-berlin.de/~loewis

4 3

A 'Python like' language
by Peter Hickman March 3, 2012

March 3, 2012

Well after all this discussion it would appear that a 'Python like' language has appeared => Prothon. http://www.prothon.org/index.html Very alpha, sort of like Python (if you consider the indenting is what makes Python unique) and sort of Ruby in its use of prefixes to define scoping etc (although there is no reference to this trait being borrowed from Ruby). It also quotes Self as being an influence.

44 78

AIX installation can't find zlib
by Larry Whitley Nov. 3, 2011

Nov. 3, 2011

I've just installed the 1.5.2 source distribution on an AIX system and when I say "import zlib" it responds: >>> import zlib Traceback (innermost last): File "<stdin>", line 1, in ? ImportError: No module named zlib >>> I'm not sure where zlib is supposed to be. It's not in the Lib subdirectory of Python-1.5.2. In the Modules subdirectory I find zlibmodule.c. Nothing germaine in the Objects subdirectory. Looked at config.log and config.status, no mention of zlib. Looking at the sys.path I see: .../ldw/Python-1.5.2> python Python 1.5.2 (#1, Jul 26 2000, 14:21:56) [C] on aix4 Copyright 1991-1995 Stichting Mathematisch Centrum, Amsterdam >>> import sys >>> sys.path ['', '/.../rchland.ibm.com/fs/u1/ldw/Projects/Programs/wtCache', '/.../rchland.ibm.com/fs/u1/ldw/Python-1.5.2/Lib/', '/.../rchland.ibm.com/fs/u1/ldw/Python-1.5.2/Lib/plat-aix4', '/.../rchland.ibm.com/fs/u1/ldw/Python-1.5.2/Lib/lib-tk', '/.../rchland.ibm.com/fs/u1/ldw/Python-1.5.2/Modules'] >>> Any suggestions? Larry

3 2

TopSort in Python?
by Tim Peters Jan. 21, 2008

Jan. 21, 2008

From: "Tim Peters" <tim_one(a)email.msn.com> [Dinu C. Gherman] > Does anybody have a simple-minded-but-working full-Python > implementation of topsort, the topological sorting algorithm? > Or maybe *any* topsort? I remember only one such algorithm... > python.org/search doesn't reveal any... Searching for "topological" instead turns up two hits there, a few more on DejaNews. Apparently "the std" algorithm I posted years ago predates DejaNews, though. So here's a fancier version ... check-out-aaron's-kjbuckets-too-ly y'rs - tim # topsort takes a list of pairs, where each pair (x, y) is taken to # mean that x <= y wrt some abstract partial ordering. The return # value is a list, representing a total ordering that respects all # the input constraints. # E.g., # topsort( [(1,2), (3,3)] ) # may return any of (but nothing other than) # [3, 1, 2] # [1, 3, 2] # [1, 2, 3] # because those are the permutations of the input elements that # respect the "1 precedes 2" and "3 precedes 3" input constraints. # Note that a constraint of the form (x, x) is really just a trick # to make sure x appears *somewhere* in the output list. # # If there's a cycle in the constraints, say # topsort( [(1,2), (2,1)] ) # then CycleError is raised, and the exception object supports # many methods to help analyze and break the cycles. This requires # a good deal more code than topsort itself! from exceptions import Exception class CycleError(Exception): def __init__(self, sofar, numpreds, succs): Exception.__init__(self, "cycle in constraints", sofar, numpreds, succs) self.preds = None # return as much of the total ordering as topsort was able to # find before it hit a cycle def get_partial(self): return self[1] # return remaining elt -> count of predecessors map def get_pred_counts(self): return self[2] # return remaining elt -> list of successors map def get_succs(self): return self[3] # return remaining elements (== those that don't appear in # get_partial()) def get_elements(self): return self.get_pred_counts().keys() # Return a list of pairs representing the full state of what's # remaining (if you pass this list back to topsort, it will raise # CycleError again, and if you invoke get_pairlist on *that* # exception object, the result will be isomorphic to *this* # invocation of get_pairlist). # The idea is that you can use pick_a_cycle to find a cycle, # through some means or another pick an (x,y) pair in the cycle # you no longer want to respect, then remove that pair from the # output of get_pairlist and try topsort again. def get_pairlist(self): succs = self.get_succs() answer = [] for x in self.get_elements(): if succs.has_key(x): for y in succs[x]: answer.append( (x, y) ) else: # make sure x appears in topsort's output! answer.append( (x, x) ) return answer # return remaining elt -> list of predecessors map def get_preds(self): if self.preds is not None: return self.preds self.preds = preds = {} remaining_elts = self.get_elements() for x in remaining_elts: preds[x] = [] succs = self.get_succs() for x in remaining_elts: if succs.has_key(x): for y in succs[x]: preds[y].append(x) if __debug__: for x in remaining_elts: assert len(preds[x]) > 0 return preds # return a cycle [x, ..., x] at random def pick_a_cycle(self): remaining_elts = self.get_elements() # We know that everything in remaining_elts has a predecessor, # but don't know that everything in it has a successor. So # crawling forward over succs may hit a dead end. Instead we # crawl backward over the preds until we hit a duplicate, then # reverse the path. preds = self.get_preds() from random import choice x = choice(remaining_elts) answer = [] index = {} in_answer = index.has_key while not in_answer(x): index[x] = len(answer) # index of x in answer answer.append(x) x = choice(preds[x]) answer.append(x) answer = answer[index[x]:] answer.reverse() return answer def topsort(pairlist): numpreds = {} # elt -> # of predecessors successors = {} # elt -> list of successors for first, second in pairlist: # make sure every elt is a key in numpreds if not numpreds.has_key(first): numpreds[first] = 0 if not numpreds.has_key(second): numpreds[second] = 0 # if they're the same, there's no real dependence if first == second: continue # since first < second, second gains a pred ... numpreds[second] = numpreds[second] + 1 # ... and first gains a succ if successors.has_key(first): successors[first].append(second) else: successors[first] = [second] # suck up everything without a predecessor answer = filter(lambda x, numpreds=numpreds: numpreds[x] == 0, numpreds.keys()) # for everything in answer, knock down the pred count on # its successors; note that answer grows *in* the loop for x in answer: assert numpreds[x] == 0 del numpreds[x] if successors.has_key(x): for y in successors[x]: numpreds[y] = numpreds[y] - 1 if numpreds[y] == 0: answer.append(y) # following "del" isn't needed; just makes # CycleError details easier to grasp del successors[x] if numpreds: # everything in numpreds has at least one predecessor -> # there's a cycle if __debug__: for x in numpreds.keys(): assert numpreds[x] > 0 raise CycleError(answer, numpreds, successors) return answer

8 9

problem using py2exe
by Ho-Kyeong Aug. 1, 2005

Aug. 1, 2005

Can anybody give me a detailed explanation of using extension modules in py2exe? My python code imports 'tkSnack', a extension module, and my setup.py is like this: #setup.py from distutils.core import setup import py2exe setup(name="pitch", scripts=["pitch.py"] ) (that is, pitch.py imports tkSnack.) In cmd, I type 'python setup.py py2exe'. It works well, but I execute the pitch.exe, then error happens. Traceback (most recent call last): File "<string>", line 14, in ? File "<string>", line 7, in pitch File "tkSnack.pyc", line 21, in initializeSnack TclError: can't find package snack I look up in python.org, but I have no idea.

4 3

DLL version number
by hungjunglu＠yahoo.com March 24, 2005

March 24, 2005

Hi, If I have a Windows DLL file, how can I retrieve its version number (e.g.: 2.40.4275.1)? Does Win32 extensions, ctypes or related modules provide such a utility? regards, Hung Jung

4 5

help with warning formatting
by Mike Brown March 11, 2005

March 11, 2005

I'm trying to get the hang of warnings. % cat t.py import warnings warnings.warn('foo') % python t.py t.py:2: UserWarning: foo warnings.warn('foo') Is there a way to just issue the warning message itself, or to at least suppress printing the line where the warning occurred (" warnings.warn('foo')" in the example)? See, I want to warn the user of my application that they're doing something risky or improper, so I just want to emit the 'foo', subject to the usual determination of whether the warning needs to be printed at all. For my purposes, the user doesn't need to know where the warning occurred, and they certainly don't need to see pieces of the call stack. The way it works now, it seems to be intended to warn the application programmer that they're doing something risky in the code (?). Thanks in advance for any advice.

4 4

Win32 drive mapping... aka "net use"
by lshuler＠my-deja.com March 5, 2005

March 5, 2005

Is there an API using Win32 extensions to map a drive share? I have not found one yet and have tried searching "Win32 map drive". I am looking for the equivalent of: net use <share path> If not, is there an alternative other than making a call to system("net use <path>"). Thanks in advance, Lance Sent via Deja.com http://www.deja.com/ Before you buy.

11 15

Using PIL with py2exe
by John Carter Feb. 28, 2005

Feb. 28, 2005

Does anyone know how to embed PIL into a py2exe program. As far as I can tell PIL is not finding its plugins for Image I/O, they are imported dynamically as required. So I cant load or save pictures I tried making a copy of the plugin files to the application directory, but I've had no luck in making the code see the files I'd be grateful for any suggestion. Please e-mail me, as well as posting a reply. John Carter jnc(a)ecs.soton.ac.uk

4 3

Problem using win32com
by unknown＠example.com Feb. 14, 2005

Feb. 14, 2005

Hi, A month ago, I decided to move from Delphi to Python/wxPython for a good deal of my development work, and for the past few projects (which included a full re-write of our point-of-sale system) I've had no problems and been very pleased with the move. We're Sage (accounting software) developers and frequently link into Line 50 using a Sage supplied COM server. In Delphi, the code to create the client and a workspace (which is required later) is as follows: SDO := CreateOLEObject('SDOEngine.10'); WS := SDO.Workspaces.Add('abc'); So naturally, I'd expect the following Python code to work: import win32com.client SDO = win32com.client.Dispatch("SDOEngine.10") WS = SDO.Workspaces.Add("abc") But at the last stage, I get an error: Traceback (most recent call last): File "<pyshell#4>", line 1, in -toplevel- ws=sdo.Workspaces.Add("ss") File "C:\PYTHON23\lib\site-packages\win32com\client\dynamic.py", line 154, in __call__ return self._get_good_object_(self._oleobj_.Invoke(*allArgs),self._olerepr_.defaultDispatchName,None) com_error: (-2147352573, 'Member not found.', None, None) So I used MakePy to generate the relevant Python interface code, and tried the following: SDO=win32com.client.gencache.EnsureModule("{ACE2C5EC-2EC0-4AEB-8B0D-27A5A1ED6421}",0,10,0) WS=SDO.Workspaces.Add("abc") But now I get: Traceback (most recent call last): File "<interactive input>", line 1, in ? TypeError: unbound method Add() must be called with IWorkspaces instance as first argument (got str instance instead) The relevant MakePy generated code looks like this: class IWorkspaces(DispatchBaseClass): CLSID = IID('{7075CC61-F056-11D0-A34B-000000000000}') coclass_clsid = IID('{7075CC63-F056-11D0-A34B-000000000000}') def Add(self, Name=defaultNamedNotOptArg): ret = self._oleobj_.InvokeTypes(2, LCID, 1, (9, 0), ((8, 0),),Name) if ret is not None: ret = Dispatch(ret, 'Add', None, UnicodeToString=0) return ret class Workspaces(CoClassBaseClass): # A CoClass CLSID = IID('{7075CC63-F056-11D0-A34B-000000000000}') coclass_sources = [ ] coclass_interfaces = [ IWorkspaces, ] default_interface = IWorkspaces What am I doing wrong? And more importantly, what can I do about it? I suspect there's a really simple answer which begins "Chris, you're being a fool...", but it's now pretty late, and I have other matters to deal with for the next few hours, so any help would be much appreciated. Regards, Chris

2 2