know
what I think by now don't you :-)
Anton
'[EMAIL PROTECTED]>>> import NNTP '
--
http://mail.python.org/mailman/listinfo/python-list
It's a thin line between philosophy, fear of breaking the rules and
having the security personnel throw me out of here, and trying to live
in a just world.
Assume I can't or won't run .exe that are blacklisted. Any way to start
a python interpreter? This is a python challenge too isn't it :-)
Anton
'this parrot.exe is dead'
--
http://mail.python.org/mailman/listinfo/python-list
services stay functional
until there's an anti-fascistic movement that can remove those people
that sold public freedom, right, and dignity to the highest commercial
bidding party.
As to my personal situation, I just wanna run python here without
having to 'educate' the computer infrastr
cterization of the current situation, one is
not likely to want to join the discussion.
Ok, this is getting way to far off topic. Thanks to all for the hints
to get python running here. I'm now contemplating to access the already
running java interpreter that must hide somewher in th
problem with this approach seems to be that it looks like a straight
path to borghood ...
Anton
'resistance is futile, all your codes are belong to us!'
--
http://mail.python.org/mailman/listinfo/python-list
Kay Schluehr wrote:
> Anton Vredegoor wrote:
>
> > I'm not involved in PyPy myself but this would seem a logical
> > possibility. To go a step further, if the compiler somehow would know
> > about the shortest machine code sequence which would produce the
> > de
looks like some interesting programming experience and why should there
be all work and no play?
So code solving any part of this problem (the grafics) or the solver
(find all solutions) would be interesting.
Anton
--
http://mail.python.org/mailman/listinfo/python-list
Alex Martelli wrote:
> You can find a few examples of me demonstrating the subject of your
> interest by searching for my name e.g. on video.google.com; searching
> for my name on Amazon will show some books using similar techniques, and
> searching for my name on groups.google.com will find about
[EMAIL PROTECTED] wrote:
> Given a list of elements that are either a character or a character
> follows by a number, e.g.
>
> ['a', 'b', 'c1', 'd', 'e1', 'f', 'c2', 'x', 'e2']
>
> find all the permutations that are given by switching the positions of
> the elements that:
> (1) begins with the
In article <[EMAIL PROTECTED]>,
[EMAIL PROTECTED] says...
> i have a c function from some modbus documentation that i need to
> translate into python.
>
> it looks like this:
>
>
> unsigned short CRC16(puchMsg, usDataLen)
> unsigned char *puchMsg ;
> unsigned short usDataLen ;
> {
>unsigne
[EMAIL PROTECTED] wrote:
> Try it with
>
> def test():
> L = 'a', 1, 2, 'a'
> it1, it2 = xsplitter(L, lambda x: x == 'a')
> print it1.next()
> print it2.next()
> print it1.next()
> print it2.next()
>
>
> The last print statement raises StopIteration...
> We, however, exp
Anton Vredegoor wrote:
> [EMAIL PROTECTED] wrote:
>
>> Try it with
>>
>> def test():
>> L = 'a', 1, 2, 'a'
>> it1, it2 = xsplitter(L, lambda x: x == 'a')
>> print it1.next()
>> print it2.next()
>
Anton Vredegoor wrote:
> Anton Vredegoor wrote:
>> [EMAIL PROTECTED] wrote:
>>
>>> Try it with
>>>
>>> def test():
>>> L = 'a', 1, 2, 'a'
>>> it1, it2 = xsplitter(L, lambda x: x == 'a')
>>
[EMAIL PROTECTED] wrote:
> Um, no. That one stops prematurely if
> your input sequence is:
>
> L = 1, 2, 3, 'a', 'a'
Ah, thanks!
> You get points for persistence, however. :)
Maybe this one is better?
from collections import deque
from itertools import chain, repeat
def xsplitter(seq, pred
Anton Vredegoor wrote:
> Maybe this one is better?
No, this one keeps generating output.
But this one stops at least:
from collections import deque
from itertools import chain, repeat
def xsplitter(seq, pred):
Q = deque(),deque()
sentinel = object()
it = chain(seq,rep
[EMAIL PROTECTED] wrote:
> This one gets the order wrong. With
>
> def test():
> L = 1, 2, 3, 'a', 4, 'a', 5, 'a', 6, 'a'
> it1, it2 = xsplitter(L, lambda x: x == 'a')
> print it1.next()
> print it2.next()
> print it1.next()
> print it2.next()
> print it1.next()
>
Anton Vredegoor wrote:
> from collections import deque
>
> def xsplitter(seq, pred):
> Q = deque(),deque()
> it = iter(seq)
> def gen(p):
> for x in it:
> if pred(x) == p:
> Q[p].append(x)
> w
Anton Vredegoor wrote:
> What's up here? Was it a fata morgana? Am I overlooking something?
Even more crazy version:
def xsplitter(seq, pred):
Q = deque(),deque()
it = iter(seq)
def gen(p):
for x in it:
Q[pred(x) == p].append(x)
w
Anton Vredegoor wrote:
> def xsplitter(seq, pred):
> Q = deque(),deque()
> it = iter(seq)
> def gen(p):
> for x in it:
> Q[pred(x) == p].append(x)
> while Q[p]: yield Q[p].popleft()
> while Q[p]: yield Q[p].pople
KDawg44 wrote:
> I am writing a GUI front end in Python using Tkinter. I have
> developed the GUI in a grid and specified the size of the window. The
> widgets are centered into the middle of the window. I would like them
> to fill the window. I tried using the sticky=E+W+N+S option on the
> w
Ray wrote:
> hi, I have a question about how to use .grid_forget (in python/TK)
>
> I need to work on grid repeatly. everytime when a button is pressed,
> the rows of grid is different. such like, first time, it generate 10
> rows of data.
> 2nd time, it maybe only 5 rows. so I need a way to RES
Steve Holden wrote:
>> When cash is involved, it's important to avoid even the slightest
>> hint of a suggestion of a suspicion of a conflict of interest;
>> that, I guess, is why firms that run contests with cash prizes
>> always declare employees and their families "not eligible", and why
>> I t
Antoon Pardon wrote:
>>> That's a good point, and also a valid reason for restricting the
>>> voting community to PSF members. Thanks, Alex.
>> So in order to avoid a suspicion of a conflict of interest you want to
>> turn the whole thing into private property of the PSF?
>>
>> That is the most
Anton Vredegoor wrote:
> It's about as ridiculous as proving that a stiff parrot is dead by
> grabbing it by the legs and repeatedly hitting it's head on the counter.
Or to write "it's" where its is more appropriate.
A.
--
http://mail.python.org/mailman/listinfo/python-list
Antoon Pardon wrote:
> On 2007-04-25, Anton Vredegoor <[EMAIL PROTECTED]> wrote:
>> Antoon Pardon wrote:
>>
>>>>> That's a good point, and also a valid reason for restricting the
>>>>> voting community to PSF members. Thanks, Alex.
>>
Steve Holden wrote:
> I'm sorry, but while the PSF is a democratically-run organization its
> franchise doesn't extend beyond the membership.
I didn't realize this was about an PSF internal affair. Of course a
group of people can decide on its internal matters without asking anyone
else, as lo
estherschindler wrote:
> * If you telecommute, full- or part-time, what *one* thing do you wish
> the CIO or IT Management would understand that they don't currently
> "get"?
I'm not currently telecommuting but last year I had a telecommuting job
for half a year. What I would want to say to all
Martin v. Löwis wrote:
> In summary, this PEP proposes to allow non-ASCII letters as
> identifiers in Python. If the PEP is accepted, the following
> identifiers would also become valid as class, function, or
> variable names: Löffelstiel, changé, ошибка, or 売り場
> (hoping that the latter one means
In article <[EMAIL PROTECTED]>,
[EMAIL PROTECTED] says...
> Martin v. Löwis:
>
> > This PEP suggests to support non-ASCII letters (such as accented
> > characters, Cyrillic, Greek, Kanji, etc.) in Python identifiers.
>
> I support this to ease integration with other languages and
> platform
Neil Hodgson wrote:
> Anton Vredegoor:
>
>> Ouch! Now I seem to be disagreeing with the one who writes my editor.
>> What will become of me now?
>
> It should be OK. I try to keep my anger under control and not cut
> off the pixel supply at the first stirrings o
[EMAIL PROTECTED] wrote:
> I see. I figured that list comprehensions made another list(duh), but
> I thought I could relink the object(List) to the new list and keep it
> once the function ended.
>
> Is it possible to pass a reference(to an object.. Like 'List',
> basically) to a function and chan
Duncan Booth wrote:
> Recently there has been quite a bit of publicity about the One Laptop Per
> Child project. The XO laptop is just beginning rollout to children and
> provides two main programming environments: Squeak and Python. It is an
> exciting thought that that soon there will be mill
HYRY wrote:
>> - should non-ASCII identifiers be supported? why?
> Yes. I want this for years. I am Chinese, and teaching some 12 years
> old children learning programming. The biggest problem is we cannot
> use Chinese words for the identifiers. As the program source becomes
> longer, they always
Hello
Someone knows since as I can obtain the information detailed about the
compiler of Python? (Table of tokens, lists of productions of the
syntactic one , semantic restrictions...)
Thanks.
--
http://mail.python.org/mailman/listinfo/python-list
Raymond Hettinger wrote:
> To make the solutions equi-probable, a simple approach is to
> recursively enumerate all possibilities and then choose one of them
> with random.choice().
Maybe it is possible to generate the possibilities by an indexing
function and then use randint to pick one of the
Terry Reedy wrote:
> Partitioning positive count m into n positive counts that sum to m is a
> standard combinatorial problem at least 300 years old. The number of such
> partitions, P(m,n) has no known exact formula but can be computed
> inductively rather easily. The partitions for m and n
Anton Vredegoor wrote:
> L = [1] * (bins-1) + [0] * (bins-1)
replace these lines in the code by:
L = [1] * (bins-1) + [0] * (bricks-bins)
A.
--
http://mail.python.org/mailman/listinfo/python-list
Terry Reedy wrote:
> "Anton Vredegoor" <[EMAIL PROTECTED]> wrote in message
> | Yes that was one of my first ideas too. But later on Steven pointed out
> | that one can view the problem like this:
> |
> | 0001100010100
> |
> | That would be [3,4,3,1,2]
&g
Dick Moores wrote:
> If the added constraint is instead that the probability of generating
> a given list of length N be the same as that of generating any other
> list of length N, then I believe my function does the job. Of course,
> [1,46,1,1,1] and [1,1,46,1,1], as Python lists, are distinc
Dick Moores wrote:
> Paul Rubin's fencepost method is about 14 times faster than mine for
> the same M == 8 and N == 4! :(
Actually they looked a bit similar after I had mucked a bit with them
:-) But indeed it's slow.
> Sorry, I don't understand this. Could you spell it out for me by
> rewri
Raymond Hettinger wrote:
> Since people are posting their solutions now (originally only hints
> were provided for the homework problem), here's mine:
Homework problem? Do you have some information from the OP that I can't
find in this thread? Anyway, I consider the 'homework' idea and the
asso
Paul Rubin wrote:
>> def genpool(n, m):
>> if n == 1:
>> yield [m]
>> else:
>> for i in xrange(1, m):
>> for rest in genpool(n-1, m-i):
>> yield rest + [i]
>>
>> import random
>> print random.choice(list(genpool(n=4, m=20)))
>
> This generates a
Anton Vredegoor wrote:
> def memoize(fn):
> cache = {}
> def proxy(*args):
> try: return cache[args]
> except KeyError: return cache.setdefault(args, fn(*args))
> return proxy
Sorry this doesn't work in this case. This works:
def m
n00m wrote:
> 62.5030784639
Maybe this one could save a few seconds, it works best when there are
multiple occurrences of the same value.
A.
from time import time
def freq(L):
D = {}
for x in L:
D[x] = D.get(x,0)+1
return D
def test():
t = time()
f = fil
Steven D. Arnold wrote:
> Neosynapse is seeking a senior software developer located in or
Subtract ten points from your credibility for writing senior here.
> willing to relocate to the Northern VA area to join a project
> building one of the largest grid computing data platforms in the
>
Steve Holden wrote:
>> /rant
>>
> Feel better now?
Yes! But *now* I'm afraid it will have negative consequences for my
future employability. However if it will lead to adjusting the kind of
submissions at http://www.python.org/community/jobs/
it was probably worth it.
A.
'thanks for asking'
-
[EMAIL PROTECTED] wrote:
> I think the steady increase in the number of active listings over the
> past couple years bodes well for the job prospects of Python
> programmers as a whole. There are currently 99 job postings on the
> job board dating back to mid-December. A year ago there were a
Michael Bentley wrote:
> Perhaps it is different where you live, but here you can put on your
> resume relevant things that aren't paying jobs. Otherwise nobody
> would ever get their first job, right?
Sure you can. But around here if one has been unemployed for a while
it's nearly impossib
John J. Lee wrote:
> You may not realise it if you haven't been applying for work since you
> did that, but I'm sure you've done a lot for your "employability" (I
> hate that word, it implies that it's a one-sided business, clearly
> false) by working as a freelancer.
Since I'm freelancing my lev
Since a few days I've been experimenting with a construct that enables
me to send the sourcecode of the web page I'm reading through a Python
script and then into a new tab in Mozilla. The new tab is automatically
opened so the process feels very natural, although there's a lot of
reading, filt
Gabriel Genellina wrote:
> I use the Opera browser: http://www.opera.com
> Among other things (like having tabs for ages!):
> - enable/disable tables and divs (like you do)
> - enable/disable images with a keystroke, or only show cached images.
> - enable/disable CSS
> - banner supressing (aggress
John J. Lee wrote:
> http://webcleaner.sourceforge.net/
Thanks, I will look into it sometime. Essentially my problem has been
solved by switching to opera, but old habits die hard and I find myself
using Mozilla and my little script more often than would be logical.
Maybe the idea of having a
Gabriel Genellina wrote:
> If you don't mind using JavaScript instead of Python, UserJS is for you:
> http://www.opera.com/support/tutorials/userjs/
My script loads a saved copy of a page and uses it to open an extra tab
with a filtered view. It also works when javascript is disabled.
A.
--
Python's sorting algorithm takes advantage of preexisting order in a
sequence:
#sort_test.py
import random
import time
def test():
n = 1000
k = 2**28
L = random.sample(xrange(-k,k),n)
R = random.sample(xrange(-k,k),n)
t = time.time()
LR = [(i+j) for i in L for j i
Paul Rubin wrote:
> Well there are various hacks one can think of, but is there an actual
> application you have in mind?
Suppose both input lists are sorted. Then the product list is still not
sorted but it's also not completely unsorted. How can I sort the
product? I want to know if it is n
Terry Reedy wrote:
> One could generate the items in order in less space by doing, for instance,
> an m-way merge, in which only the lowest member of each of the m sublists
> is present at any one time. But I don't know if this (which is
> O(m*n*log(m))) would be any faster (in some Python imp
Terry Reedy wrote:
> If I understand correctly, you want to multiiply each of m numbers by each
> of n numbers, giving m*n products. That is O(m*n) work. Inserting (and
> extracting) each of these is a constant size m priority cue takes, I
> believe, O(log(m)) work, for a total of m*n*log(m).
Terry Reedy wrote:
> If I understand correctly, you want to multiiply each of m numbers by each
> of n numbers, giving m*n products. That is O(m*n) work. Inserting (and
> extracting) each of these is a constant size m priority cue takes, I
> believe, O(log(m)) work, for a total of m*n*log(m).
Paul Rubin wrote:
> Oh, I see what you mean. I don't see an obvious faster way to do it
> and I don't have the feeling that one necessarily exists. As someone
> mentioned, you could do an n-way merge, which at least avoids using
> quadratic memory. Here's a version using Frederik Lundh's trick
Paul McGuire wrote:
> I just stumbled upon a great-looking project, to make Zope3 more
> approachable to mere mortals such as myself. Echoing the ROR mantra
> of "convention over configuration", the Grok project (http://
> grok.zope.org/) aims to stand on the shoulders of Zope3, while
> providin
Bart Willems wrote:
> I have a feeling that there's a Python-solution that is shorter yet
> better readable, I just can't figure it out yet...
Shorter (and faster for big lists): Yes. More readable: I don't know, I
guess that depends on ones familiarity with the procedure.
import bisect
def g
Paul Rubin wrote:
> def some_gen():
>...
>yield *some_other_gen()
>
> comes to mind. Less clutter, and avoids yet another temp variable
> polluting the namespace.
>
> Thoughts?
Well, not directly related to your question, but maybe these are some
ideas that would help dete
Kay Schluehr wrote:
> Maybe you should start by developing a design pattern first and
> publish it in the Cookbook. I have the fuzzy impression that the idea
> you are after, requires more powerfull control structures such as
> delimited continuations that are beyond ths scope of Pythons simple
>
Jussi Piitulainen wrote:
>> There's probably even a really clever way to avoid that final
>> division, but I suspect that would cost more in time and memory than
>> it would save.
We're getting closer and closer to something I already posted a few
times here. This implementation was unfortunate
[EMAIL PROTECTED] wrote:
>> We're getting closer and closer to something I already posted a few
>> times here. This implementation was unfortunate because I consistently
>> used an uncommon name for it so people couldn't easily find it
>
> But then, who's looking for it?
The OP was trying to fin
[EMAIL PROTECTED] wrote:
> Isn't that what docstrings are for? Can't you leave
> the function name noverk() and add something to the
> effect of "this function calculates combinations"?
> Then it would show up in searches, wouldn't it?
Yes, a doc string would help finding it in searches, however
[EMAIL PROTECTED] wrote:
> I have modified, simplified and (hopefully) improved Steven's code
> like this (but it may be a bit slower, because the class It is inside
> the function?):
Here is a yet more simple version, I wonder if it still does the same
thing, whatever it is you are looking for
ext.library_dirs.append(os.path.join(py_instdir, 'lib'))
+
if platform != 'mac':
# Parse Modules/Setup and Modules/Setup.local to figure out which
# modules are turned on in the file.
Then you have to add INSTDIR_PYTHON to your shell envi
[EMAIL PROTECTED] wrote:
>
> If you don't wish to use objects, you can replace them with
> a closure:
>
> import collections
>
> def xsplitter(iseq, pred):
> queue = [ collections.deque(), collections.deque() ]
> def it(parity):
> while True:
> if queue[parity]:
>
better to make a function
which would 'turn on/off' my division. It is strange that it is only
possible to do such things in C code, I cannot do it from python.
Anton
--
http://mail.python.org/mailman/listinfo/python-list
ython. For this my module installs my own handler for the operation
‘divide’ for integers and longs. That’s it. In other respects it is a
normal python module.
I will greatly appreciate any feedback.
Anton
--
http://mail.python.org/mailman/listinfo/python-list
> Does your version use the GMP library (optional in PARI).
> Does it support Windows? I couldn't tell if the PARI
> Windows distribution has GMP, but I suspect not since GMP
> doesn't support Windows.
No, I didn't try to use gmp. But this may be not a bad idea. I am
trying to compile gmp right no
sion, so
people should use // when they divide integers and expect an integer.
Other than these two things (the second one does not require
recompilation, so it is not so bad probably) I don't need any changes
to python core. I agree that a standard must be standard.
Anton
--
http://mail.python.org/mailman/listinfo/python-list
t;)'
(excerpt from the documentation).
Actually it should be nice to have this workaround available
separately for use by other math packages.
Anton
--
http://mail.python.org/mailman/listinfo/python-list
unfortunately the new AST symbols deviate from this practise
(there are symbols like "Assert", "If", "Then", ...)
or b) apply an equivalent rule to the global symbols in
tktreectrl that are global by accident, i.e. because
of the way the library is structured and built
Best Regards,
Anton
--
http://mail.python.org/mailman/listinfo/python-list
it is done anyway,
>>unfortunately the new AST symbols deviate from this practise
>>(there are symbols like "Assert", "If", "Then", ...)
>>
>> or b) apply an equivalent rule to the global symbols in
>>tktreectrl that
i can't use qtreactor since it relies on qt bindings lib (GPLed)
how much work there is to provide an alternative gpl free qtreactor
equivalent that is suitable for deployment in a commercial app
and who is specializing in this sort of contract work?
in case i can convince the management to get t
Anton Tropashko wrote:
> i can't use qtreactor since it relies on qt bindings lib (GPLed)
> how much work there is to provide an alternative gpl free qtreactor
> equivalent that is suitable for deployment in a commercial app
> and who is specializing in this sort of contract wor
gamename wrote:
> Hi,
>
> Where can I find python 2.5.1 rpm's for redhat9 and fedora6/7?
did you check on the fedora7 dvd?
btw building from sources if completely straigtforward (meaning that it
does not build character and leaves your with a sense of accomplishment
the way building x.org code
functionality and do my own signing and library selection.
Don't ask for my code yet though, it's nowhere near presentable. Anyway,
since then I found a job that gives me access to less locked down
computers which is also fun.
Anton
--
http://mail.python.org/mailman/listinfo/python-list
are still characters
in it like \93 or \94. Has anyone handled this before? I'd rather not
reinvent the wheel and start translating strings 'by hand'.
Anton
--
http://mail.python.org/mailman/listinfo/python-list
Fredrik Lundh wrote:
> Anton Vredegoor wrote:
>
>> I'm trying to import text from an open office document (save as .sxw and
>> read the data from content.xml inside the sxw-archive using
>> elementtree and such tools).
>>
>> The encoding that gives
Martin v. Löwis wrote:
> Not sure I understand the question. If you process data in cp1252,
> then \x94 and \x94 are legal characters, and the Python codec should
> support them just fine.
Tell that to the guys from open-office.
Anton
--
http://mail.python.org/mailman/listinfo/python-list
ent, or so it
seems. Thanks to you all clearing up my perceptions, and sorry about all
the confusion I created.
What I want to know next is how to access and print the elements that
contain text but have no text attribute, that is, if it's not to taxing
on my badly damaged ego.
Anton
--
http://mail.python.org/mailman/listinfo/python-list
etting \x94 and such output when using
repr (even if str is giving correct output) there could be some problem
with the XML-file not being completely UTF-8. Or is there some other
reason I'm getting these \x94 codes? Or maybe this is just as it should
be and there's no prob
Richard Brodie wrote:
> "Anton Vredegoor" <[EMAIL PROTECTED]> wrote in message
> news:[EMAIL PROTECTED]
>
>> Yes my header also says UTF-8. However some kind person send me an e-mail
>> stating that
>> since I am getting \x94 and such output when us
Serge Orlov wrote:
> Anton Vredegoor wrote:
>> In fact there are a lot of printable things that haven't got a text
>> attribute, for example some items with tag ()s.
>
> In my sample file I see , is that you're talking
> about? Since my file is small I ca
Anton Vredegoor wrote:
> So, probably yes. If it doesn't have a text attribrute if you iterate
> over it using OOopy for example:
Sorry about that, I meant if the text attribute is None, but there *is*
some text.
Anton
--
http://mail.python.org/mailman/listinfo/python-list
xpect to get, and
> what are the results that you actually get?
Well, where do these cp1252 codes come from? The xml-file claims it's
utf-8.
I just tried out some random decodings and cp1252 seemed to work. I
don't like to have to guess this way. I think John wouldn't
Martin v. Löwis wrote:
> Well, if the document is UTF-8, you should decode it as UTF-8, of
> course.
Thanks. This and:
http://en.wikipedia.org/wiki/UTF-8
solved my problem with understanding the encoding.
Anton
proof that I understand it now (please anyone, prove me wrong if you can):
ding Python one might ask, well, the knowledge
has to be transfered to my brain first *somehow*, and until someone
finds a better way to do that or until there is so much procedural
information in my head that I can start autocoding (oh no) that seems to
be the better option.
Anton
--
http://mail.python.org/mailman/listinfo/python-list
On Thu, 30 Oct 2008 17:45:40 +0100
Gerhard Häring <[EMAIL PROTECTED]> wrote:
> psyco seems to just work on Linux with Python 2.6. So it is probably
> "only" a matter of compiling it on Windows for Python 2.6.
Yes. I compiled it using "wp setup.py build --compiler=mingw32" with
cygwin, where wp w
On Wed, 19 Nov 2008 10:57:53 +0100
"Eric Brunel" <[EMAIL PROTECTED]> wrote:
> I'm trying out Python 2.6 and I found what might be a bug in the
> Tkinter module. How can I report it?
maybe here:
http://bugs.python.org/issue3774
> The possible bug is a traceback when trying to delete a menu item
On Fri, 21 Nov 2008 18:10:02 +0100
Gerard flanagan <[EMAIL PROTECTED]> wrote:
> data = '''
> 1 6 6 1 6 6 1 6 6 1 6 6 1 6 6 1 9 3 3 0 3 3 0 3 3 0 3 3 0 10 6 6
> 1 6 6 1 6 6 1 6 6 1 6 6 1 6 6 1 6 6 1 9 3 3 0 3 3 0 3 3 0 3 3 0 10 6 6
> 1 6 6 1 6 6 1 6 6 1 6 6 1 6 6 1 6 6 1 9 3 3 0 3 3 0 3 3 0 3 3 0 1
number of wildcard imports it would be very helpful if class names
> could be automatically imported from the proper module. There is no
> problem in finding out the proper module given a (valid) class name.
Maybe this helps:
http://www.connellybarnes.com/code/autoimp/
Regards,
Ant
d in Javascript:
http://ejohn.org/blog/processingjs/
-Anton
--
http://mail.python.org/mailman/listinfo/python-list
ferrable? Does anyone know any alternative ways?
Anton
--
http://mail.python.org/mailman/listinfo/python-list
On Apr 22, 3:54 pm, Paul McGuire <[EMAIL PROTECTED]> wrote:
> On Apr 22, 8:47 am, "Anton Mellit" <[EMAIL PROTECTED]> wrote:
>
>
>
> > I need something like
> > 'overriding' =, which is impossible, but I look for a systematic
> > appro
I've read great paper about generators:
http://www.dabeaz.com/generators/index.html
Author say that it's easy to write analog of common linux tools such
as awk,grep etc. He say that performance could be even better.
But I have some problem with writing performance grep analog.
It's my script:
I try to save my time not cpu cycles)
I've got file which I really need to parse:
-rw-rw-r-- 1 xxx xxx 3381564736 May 7 09:29 bigfile
That's my results:
$ time grep "python" bigfile | wc -l
2470
real0m4.744s
user0m2.441s
sys 0m2.307s
And python scripts:
import sys
if len(
101 - 200 of 250 matches
Mail list logo
