Mailman 3 January 2004 - Python-Dev

Virus Alert
by root＠tnqdns1.tnq.co.in Jan. 28, 2004

Jan. 28, 2004

Have detected a virus (WORM_MIMAIL.R) in your mail traffic on 01/28/2004 10:52:05 with an action quarantined.

1 0

Re: PEP 326 now online
by Bob Ippolito Jan. 27, 2004

Jan. 27, 2004

> > Module attributes make sense; make them attributes of object has > > the unfortunate side effect that they will be attributes of *all* > > objects and that doesn't seem a good idea. > > > > The math module is only appropriate if this is primarily about float > > numbers. And see PEP 747 in that case. > > You mean PEP 754, right? Just like creating an arbitrarily large > integer, floating point infinity is also arbitrary, and may not be big > enough. > > I just got a comment from another user suggesting modifying the > min/max.__cmp__ so that they are the actual minimum and maximum. > > An interesting approach, which makes some sense to me. [[ I apologize in advance for not carrying along the In-Reply-To and References headers, I just finally got around to subscribing to this list. ]] This was my suggestion. I am for this PEP and am willing to write the reference implementation for the new min and max builtins if there's enough interest. I have, like some others here, used my own One True Large Object. I think the best reason to have One True Large Object is because you can't really compare two implementations of the One True Large Object and expect to get a meaningful result out of it. For the record, my use case had to do with a giant sorted list of tuples and the bisect module. The first element of a tuple was a timestamp, the rest of the tuple isn't worth explaining but I never wanted to compare against it. The "database" had two primary operations, inserting records *after* a timestamp, and finding every record between two timestamps. Let's take a look: >>> from random import randrange >>> from pprint import pprint >>> from bisect import bisect_left, bisect_right >>> lst = [(randrange(10), randrange(10)) for i in xrange(10)] >>> lst.sort() >>> pprint(lst) [(0, 2), (0, 7), (0, 9), (4, 6), (6, 5), (6, 8), (6, 9), (7, 7), (8, 6), (9, 5)] >>> bisect_left(lst, (6,)) 4 >>> bisect_right(lst, (6,)) 4 Well, that doesn't look too useful does it? In order for bisect_right to have a meaningful return value in this case, I need to build an object such that it compares greater than any (6, *foo). >>> class MaxObject: ... def __cmp__(self, other): ... return int(not self is other) ... >>> maxobject = MaxObject() >>> bisect_right(lst, (6, maxobject)) 7 >>> lst[4:7] [(6, 5), (6, 8), (6, 9)] In this particular contrived case, sys.maxint would have worked, but the general case needs One True Large Object. I think One True Large Object should be in builtins and should be called 'max'. Similarly, there are probably use cases for One True Small Object, but none that I've personally ran into. However, since 'min' is already in builtins, might as well do it for symmetry. -bob

6 13

Out of office: Back on February 3
by kschutz＠cso.atmel.com Jan. 27, 2004

Jan. 27, 2004

This is an automatic reply. I will be out of the office on overseas travel through February 3. For TCG project related questions, please contact Randy Mummert, 719-540-1068, rmummert(a)cso.atmel.com. For TCG marketing and all other product questions, please contact Jay Johnson, 719-540-1835, jjohnson(a)cso.atmel.com. Thank you.

1 0

Returned mail: see transcript for details
by Mail Delivery Subsystem Jan. 27, 2004

Jan. 27, 2004

The original message was received at Tue, 27 Jan 2004 20:33:31 GMT from root@localhost ----- The following addresses had permanent fatal errors ----- john(a)saga.co.ma.KAV (reason: 550 5.1.1 <john(a)saga.co.ma.KAV>... User unknown) (expanded from: john(a)saga.co.ma.KAV) ----- Transcript of session follows ----- ... while talking to [127.0.0.1]: >>> DATA <<< 550 5.1.1 <john(a)saga.co.ma.KAV>... User unknown 550 5.1.1 john(a)saga.co.ma.KAV... User unknown <<< 503 5.0.0 Need RCPT (recipient)

1 0

Virus Alert
by virus.manager＠st.com Jan. 27, 2004

Jan. 27, 2004

The mail message (file: document.zip) you sent to <dave(a)company.com> contains a virus. (on zeta)

1 0

Re: Hello
by ironblayde＠aeon-software.com Jan. 27, 2004

Jan. 27, 2004

This is an autoresponder. I'll never see your message.

1 0

VIRUS U VASOJ PORUCI
by Neobee.net Virus Scanner Jan. 27, 2004

Jan. 27, 2004

V I R U S U V A S O J P O R U C I Neobee.net virus scanner je pronasao W32/Mydoom.A@mm virus(e) u poruci upucenoj na adresu(e): drazen.jaksic(a)activez.net Zarazena poruka NIJE isporucena !!! ID zarazene poruke je: 401650a5-7d6f. ------------------------------------------------------------------------ ZAGLAVLJE (HEADER) PORUKE:: Received: from green02.telekom.ftn.ns.ac.yu ([147.91.173.88] helo=python.org) by holomatrix1.neobee.net with esmtp (Exim 4.14) id 1AlRk6-0001Gy-Ou for drazen.jaksic(a)activez.net; Tue, 27 Jan 2004 12:50:58 +0100 From: python-dev(a)python.org To: drazen.jaksic(a)activez.net Subject: Error Date: Tue, 27 Jan 2004 12:55:17 +0100 MIME-Version: 1.0 Content-Type: multipart/mixed; boundary="----=_NextPart_000_0004_4B13DACF.14B6332C" X-Priority: 3 X-MSMail-Priority: Normal Message-Id: <E1AlRk6-0001Gy-Ou(a)holomatrix1.neobee.net> X-NEOBEE-Virus-Scanned: by Neobee.net Virus Scanner

1 0

Collections
by Raymond Hettinger Jan. 27, 2004

Jan. 27, 2004

The collections module is in the sandbox and is almost ready for primetime. If anyone has some time to look at it, I would appreciate it if you would email me with any comments or suggestions. Right now, it only has one type, deque(), which has a simple API consisting of append(), appendleft(), pop(), popleft(), and clear(). It also supports __len__(), __iter__(), __copy__(), and __reduce__(). It is fast, threadsafe, easy-to-use, and memory friendly (no calls to realloc() or memmove()). The sandbox includes unittests, a performance measurement tool, and a pure python equivalent. I've tried it out with the standard library and it drops in seamlessly with Queue.py, mutex.py, threading.py, shlex.py, and pydoc.py. I looked at implementing this as a package, but that was overkill. If future additions need to be in a separate sourcefile, it is simple enough to load them into the collections namespace. Raymond Hettinger To run the sandbox code, type: python setup.py build install and then at the interactive prompt: from collections import deque

1 0

Out of Office AutoReply: hello
by Mike Kaufman Jan. 27, 2004

Jan. 27, 2004

I am out of the office from 1/27/2004 through 1/30/2004. I will be back in the office Monday, 2/2/2004. Please contact Ken Tam or Brendan Maclean about any urgent issues. Thanks! Mike Kaufman

1 0

RE: [Python-Dev] namespace for generator expressions
by Delaney, Timothy C (Timothy) Jan. 26, 2004

Jan. 26, 2004

> From: Guido van Rossum > > > I'm happy to see progress on the generator expressions > implementation, > > but I think the specification of namespaces, which is just a sketch, > > might be simplified. > > Ouch! Where were you when this PEP was discussed on python-dev? I > was originally strongly in your camp, but Tim and several others > convinced me that in every single case where a generator expression > has a free variable, you want early binding, not late. I think I agree with Jeremy. I was originally in the early-binding camp, but I think we're better off trusting the programmer. How often is a generator expression not going to be evaluated almost immediately? I guess, when they're passed to a function. But even in that case, how often are the bindings going to change? Except in pathological cases, they won't. Anyway, got a meeting to go to :( Tim Delaney

1 0