🌐 Mailman 3 July 2007 - Python-list - python.org

smtplib "authentication required" error
by carl.reimann＠gmail.com May 17, 2008

May 17, 2008

In using a simple smtp routine: # begin example >>> import smtplib >>> server = smtplib.SMTP('outgoing.verizon.net') >>> server.sendmail('my(a)address.net', 'another(a)address.net', """To: another(a)address.net From: my(a)address.net Subject: Shakespeare Quote Tis like the breath of an unfeed lawyer... """) >>> server.quit() # end example I find the following error: raise SMTPSenderRefused(code, resp, from_addr) smtplib.SMTPSenderRefused: (550, '5.7.1 Authentication Required', 'myuserid(a)verizon.net') I have attempted to incorporate into the interactive session: server.login = ('userid', 'password') # the same ones I use in my email program But I get the same error result. My objective is to have a simple way to send email from the command line. To do this I will write a script which can read in a file and send it to the address on top of the file. What is the procedure for authentication? Using the KMail email program (Linux, KDE desktop), I send mail through my Verizon account. Under the Configure KMail / Accounts / Modify Account / Extras tab, I clicked "Check what the server supports" and it came back 'no encryption' and 'cleartext'. So it doesn't seem that it would involve complex procedures. Any help welcome.

3 2

Why can't timedeltas be divided?
by Dan Bishop April 26, 2008

April 26, 2008

If I try to write something like: num_weeks = time_diff / datetime.timedelta(days=7) I get: TypeError: unsupported operand type(s) for /: 'datetime.timedelta' and 'datetime.timedelta' Of course, one could extend the timedelta class to implement division, def _microseconds(self): return (self.days * 86400 + self.seconds) * 1000000 + self.microseconds def __truediv__(self, other): if isinstance(other, datetime.timedelta): return self._microseconds() / other._microseconds() else: return datetime.timedelta(0, 0, self._microseconds() / other) def __floordiv__(self, other): if isinstance(other, datetime.timedelta): return self._microseconds() // other._microseconds() return NotImplemented but why is a basic arithmetic operation missing from the standard datetime module?

4 4

Python re expr from Perl to Python
by Michael M. Feb. 25, 2008

Feb. 25, 2008

In Perl, it was: ## Example: "Abc | def | ghi | jkl" ## -> "Abc ghi jkl" ## Take only the text betewwn the 2nd pipe (=cut the text in the 1st pipe). $na =~ s/\ \|(.*?)\ \|(.*?)\ \|/$2/g; ## -- remove [ and ] in text $na =~ s/\[//g; $na =~ s/\]//g; # print "DEB: \"$na\"\n"; # input string na="Abc | def | ghi | jkl [gugu]" # output na="Abc ghi jkl gugu" How is it done in Python?

8 8

do design patterns still apply with Python?
by John Salerno Jan. 26, 2008

Jan. 26, 2008

Since Python does so many things different, especially compared to compiled and statically typed languages, do most of the basic design patterns still apply when writing Python code? If I were to read a design pattern book (such as Head First Design Patterns), could I apply their Java examples to Python easily enough, or does Python require a different perspective when applying patterns?

18 28

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

Jan. 20, 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

subprocess "handle is invalid" error
by Grant Edwards Jan. 10, 2008

Jan. 10, 2008

I'm trying to use the py-gnuplot module on windows, and have been unable to get it to work reliably under Win2K and WinXP. By default, it uses popen(gnuplotcmd,'w'), but in some situations that consistently gets an "invalid operand" IOError when write() is called on the pipe. So I switched to subprocess. It works fine when executed "normally" (e.g. "python progname.py"), but when bundled by py2exe, it always does this: Traceback (most recent call last): File "surfedit.py", line 28, in ? File "Gnuplot\_Gnuplot.pyc", line 178, in __init__ File "Gnuplot\gp_win32.pyc", line 117, in __init__ File "subprocess.pyc", line 533, in __init__ File "subprocess.pyc", line 607, in _get_handles File "subprocess.pyc", line 634, in _make_inheritable WindowsError: [Errno 6] The handle is invalid How does one troubleshoot errors that happen three layers deep in the subprocess module? -- Grant Edwards grante Yow! I'm a fuschia bowling at ball somewhere in Brittany visi.com

4 4

Re: PyImport_ImportModule/embedding: surprising behaviors
by Ziga Seilnacht Oct. 25, 2007

Oct. 25, 2007

David Abrahams wrote: > I'm seeing highly surprising (and different!) behaviors of > PyImport_ImportModule on Linux and Windows when used in a program with > python embedding. > > On Linux, when attempting to import a module xxx that's in the current > directory, I get > > ImportError: No module named xxx > > I can work around the problem by setting > > PYTHONPATH=. Python puts the current directory in sys.path only if it can't determine the directory of the main script. There was a bug on Windows that always added current directory to sys.path, but it was fixed in Python 2.5. This is documented in the library reference: http://docs.python.org/lib/module-sys.html#l2h-5149 > On Windows, I get: > > 'import site' failed; use -v for traceback > > I can work around the problem by setting PYTHONPATH to point to the > python library directory: > > set PYTHONPATH=c:\Python25\Lib This happens because Python calculates the initial import path by looking for an executable file named "python" along PATH. You can change this by calling Py_SetProgramName(filename) before calling Py_Initialize(). This is documented in API reference manual: http://docs.python.org/api/embedding.html That page also describes a few hooks that you can overwrite to modify the initial search path. They are described in more detail on this page: http://docs.python.org/api/initialization.html HTH, Ziga

2 1

The Modernization of Emacs
by Xah Lee Oct. 12, 2007

Oct. 12, 2007

[this post is a excerpt from The Modernization of Emacs, Xah Lee, 2006-04 at http://xahlee.org/emacs/modernization.html ] The Modernization of Emacs ---------------------------------------- THE PROBLEM Emacs is a great editor. It is perhaps the most powerful and most versatile text editor. And, besides text editing, it also serves as a email application, newsgroup application, ftp application, irc application, web browser, shell interface, file management application, programable calculator, calendar and personal info management application, lisp language system, among other things. These seemingly wild functionalities are employed in production daily by a significant number of programers around the world. Some calls emacs as a Operating System as a joke. (Technically it does not qualify because a OS implies management of hardware.). If emacs is such a great and powerful text editor why almost nobody knows about it? Vast majority of people who need to write will be more than happy to use editors other than emacs. Ask a Microsoft Windows user. She'll be more than happy to use Microsoft Word↗. If he doesn't have MS Word, he'll use NotePad↗ or WordPad↗. If he is a programer, most will be more than happy to use any of other graphical editors on the Windows platform or any of the Integrated development environment↗. Same is true on other operating systems, and new editors spring up here and there even though they don't have as much power or flexibility as emacs. For example, there are NEdit, JEdit, Eclipse, Xcode↗ , or the various associated with languages or third party language software, such as Visual Basic or Borland C++. Many reasons can be made out of this. For example, emacs is not bundled on popular operating systems such as Windows or Mac, which are used by some 99% of computer users worldwide. Windows and Mac both have simple text editors bundled that will satisfy majority of computer users, which are non-professional computer users. (NotePad and WordPad on Windows, TextEdit↗ on Mac) For the few professional computer users, a majority will need a easy to use, yet powerful editor that also does styled text, formatting, and sundry light publishing needs such as table layout, simple line graphics drawing, embedded images, math formulas. They will choose and adopt Microsoft Word for their needs. The tiny percentage that might be interested in emacs, are programers. Even among professional programers, a majority shy away from emacs. A major difficulty among programers who do not use or like emacs, is that emacs's user interface is rather esoteric, involving arcane terminologies and keystrokes. This is in sharp contrast to the thousands of software applications used today, where their User Interface are similar and familiar to today's computer users. ---------------------------------------- THE COMMON USER INTERFACE The following is a excerpt from the Wikipedia article on Common User Access↗: CUA was a detailed specification and set strict rules about how applications should look and function. Its aim was in part to bring about harmony between MS-DOS applications, which until then had implemented totally different user interfaces. Examples: * In WordPerfect, the command to open a file was [F7], [3]. * In Lotus 1-2-3, a file was opened with [/] (to open the menus), [W] (for Workspace), [R] (for Retrieve). * In Microsoft Word, a file was opened with [Esc] (to open the menus), [T] (for Transfer), [L] (for Load). * In WordStar, it was [Ctrl]+[K]+[O]. * In Emacs, a file was opened with [Ctrl]+[x] followed by [Ctrl]+ [f] (for find-file). Some programs used [Esc] to cancel an action, some used it to complete one; WordPerfect used it to repeat a character. Some programs used [End] to go to the end of a line, some used it to complete filling in a form. [F1] was often help but in WordPerfect that was [F3]. [Ins] sometimes toggled between overtype and inserting characters, but some programs used it for “paste”. Thus, every program had to be learned individually and its complete user interface memorized. It was a sign of expertise to have learned the UIs of dozens of applications, since a novice user facing a new program would find their existing knowledge of a similar application absolutely no use whatsoever. ---------------------------------------- SIMPLE CHANGES In the following, i describe some critical changes that are also very easy to fix in emacs. If emacs officially adopt these changes, i think it will make a lot people, at least programers, like emacs and choose emacs as their text editor. * Change the keyboard shortcut of Copy & Paste to ctrl-c and ctrl- v as to be the same with all modern applications. * Change the undo behavior so that there is a Undo and Redo, as the same with all modern applications. * Get rid of the *scratch* buffer. * Change the terminology of “kill” to “cut”, and “yank” to “paste”. * Change the terminology of Meta key to Alt. * Make longlines-mode the default editor behavior for any file. Things emacs should do now, even though it eventually will do. * When opening a HTML document, automatically provide highlighting of HTML, CSS, and Javascript codes. Similarly for other multi-language files such as PHP, JSP, et al. This behavior must be automatic without requiring user to customize emacs. Possible Documentation Change Proposals * Reduce the use of the word “buffer” in the emacs documentation. Call it “opened file” or “unsaved document”. * Switch the terminology of Window and Frame so it is more standard. That is, Emacs's “Window” should be called Panes or Frames. While Emacs's “Frame” should be termed Window. * Change the terminology of keybinding to “keyboard shortcut” in emacs documentation. Use the term keybinding or binding only in a technical context, such as in elisp documentation. Xah xah(a)xahlee.org ∑ http://xahlee.org/

83 354

Re: Can't import Stackless in Pythonwin
by archaegeo＠gmail.com Sept. 20, 2007

Sept. 20, 2007

On Feb 9, 2:06 pm, "Gabriel Genellina" <gagsl...(a)yahoo.com.ar> wrote: > En Fri, 09 Feb 2007 13:50:56 -0300, <archae...(a)gmail.com> escribió: > > > I am getting started in Python, and I have looked on both the > > stackless page and python.org and cannot find the answer to what I > > think is a simple problem. > > > If I start the python command line or idle, i can > >>>> import stackless > > > If I start pythonwin I get the following error > > ...No Module named Stackless > > > Any help? > > Maybe they are different versions, or installed on different places. > > In those three environments, execute: > > import sys > print sys.version > print sys.executable > > All should report the same version. > The executables for both python and IDLE should reside on the same > directory; for pythonwin, you should get the *same* directory plus > "Lib\site-packages\pythonwin\Pythonwin.exe" > > -- > Gabriel Genellina Ok, for Idle I get: IDLE 1.2 >>> import sys >>> print sys.version 2.5 Stackless 3.1b3 060516 (python-2.5:53557:53567, Jan 25 2007, 22:01:46) [MSC v.1310 32 bit (Intel)] >>> print sys.executable C:\Python25\pythonw.exe >>> And for the command line i get the same thing except the executable is python.exe But for pythonwin i get >>> import sys >>> print sys.version 2.5 (r25:51908, Sep 19 2006, 09:52:17) [MSC v.1310 32 bit (Intel)] >>> print sys.executable C:\Python25\Lib\site-packages\pythonwin\Pythonwin.exe >>> So does this mean stackless is not usable with pythonwin? Also, is pythonwin needed for the win32 extensions and mfc? Thanks

2 1

ANN: M2Crypto 0.18
by Heikki Toivonen Sept. 17, 2007

Sept. 17, 2007

M2Crypto is the most complete Python wrapper for OpenSSL featuring RSA, DSA, DH, HMACs, message digests, symmetric ciphers (including AES); SSL functionality to implement clients and servers; HTTPS extensions to Python's httplib, urllib, and xmlrpclib; unforgeable HMAC'ing AuthCookies for web session management; FTP/TLS client and server; S/MIME; ZServerSSL: A HTTPS server for Zope and ZSmime: An S/MIME messenger for Zope. Download links on the homepage at http://chandlerproject.org/Projects/MeTooCrypto. Changelog: - Added EVP.pbkdf2 to derive key from password - X509_Store_Context.get1_chain added - Added X509_Name.__iter__, __getitem__, get_entries_by_nid which allow iterating over all X509_Name_Entries or getting just all commonName entries, for example - Added X509_Name_Entry.get_object, get_data, set_data - Added back PKCS7.get0_signers (was removed in 0.16) - X509_Extension.get_value accepts flag and indent parameters. - support multiple dNSName fields in subjectAltName - support multiple commonName fields for SSL peer hostname checking - Checking for erroneous returns from more OpenSSL EVP_* functions, which means that certain things that used to fail silently will now raise an EVP.EVPError; affected m2 functions are: digest_final, cipher_init, cipher_update, cipher_final and sign_update. sign_final will now raise EVP.EVPError instead of SystemError as well. - Fixed Pkey.verify_final to take a sign parameter - If a subjectAltName extension of type dNSName is present in peer certificate, use only the dNSNames when checking peer certificate hostname, as specified by RFC 2818. If no dNSNames are present, use subject commonName. - Fixed memory leaks in m2 functions ec_key_new_by_curve_name, pkey_get_modulus, ecdsa_verify, threading_init and X509.X509.verify, X509.X509_Stack (which manifested for example when calling X509.new_stack_from_der), SSL.Connection (which manifested with some connection errors or when connect was never called), twisted wrapper, SSL.Connection.makefile (in BIO.IOBuffer really) - Fixed threading regressions introduced in 0.16, by Aaron Reizes and Keith Jackson - Added SSL session caching support to HTTPSConnection, by Keith Jackson - Added the ability to save and load DER formatted X509 certificates and certificate requests, by Keith Jackson - m2xmlrpclib.py fixed to work with Python 2.5, by Miloslav Trmac - 64-bit correctness fixes, by Miloslav Trmac - Added X509_Name.as_hash, by Thomas Uram - Moved --openssl option from general setup.py option to build_ext option, meaning you need to do: python setup.py build build_ext --openssl=/path, by Philip Kershaw - Fixed build problem affecting certain systems where OpenSSL was built without EC support - M2CRYPTO_TEST_SSL_SLEEP environment variable controls how long to sleep after starting the test SSL server. Default is 0.5, but 0.1 or even 0.05 might work with modern computers. Makes tests finish significantly faster. -- Heikki Toivonen

2 1