Ross wrote:
If I have a list of tuples a = [(1,2), (3,4), (5,6)], and I want to
return a new list of each individual element in these tuples, I can do
it with a nested for loop but when I try to do it using the list
comprehension b = [j for j in i for i in a], my output is b =
[5,5,5,6,6,6]
Robert Kern wrote:
On 2009-04-20 23:04, per wrote:
to be more formal by very different, i would be happy if they were
maximally distant in ordinary euclidean space... so if you just plot
the 3-tuples on x, y, z i want them to all be very different from each
other. i realize this is obviously
Saketh wrote:
Thank you, Peter and Michael, for your solutions! I think that
Michael's is what I was edging towards, but Peter's has demonstrated
to me how efficient Python's set functions are. I have a lot more to
learn about optimizing algorithms in Python... :)
--
Saketh wrote:
Hi everyone:
I'm using translation in the sense of string.maketrans here.
I am trying to efficiently compare if two string translations
conflict -- that is, either they differently translate the same
letter, or they translate two different letters to the same one.
...
Another
Alexzive wrote:
Hello there,
I'd like to get the same result of set() but getting an indexable
object.
How to get this in an efficient way?
Example using set
A = [1, 2, 2 ,2 , 3 ,4]
B= set(A)
B = ([1, 2, 3, 4])
B[2]
TypeError: unindexable object
Many thanks, alex
--
thomas.han...@gmail.com wrote:
...
So any ideas on how to get a function called on an object just after
__init__ is done executing?
--
http://mail.python.org/mailman/listinfo/python-list
Yes, you *can* use metaclasses - you need to override the type.__call__ method,
which is what normally
ki lo wrote:
I have type variable which may have been set to 'D' or 'E'
Now, which one of following statements are more efficient
if type =='D' or type == 'E':
or
if re.search(D|E, type):
Please let me know because the function is going to called 10s of
millions of times.
t3chn0n3rd wrote:
Do you think it is relatively easy to write sort algorithms such as
the common Bubble sort in Python as compared to other high level
programming langauges
yes
--
http://mail.python.org/mailman/listinfo/python-list
Wildemar Wildenburger wrote:
Arnaud Delobelle wrote:
Personally, between
* foo if foo else bar
* foo or bar
I prefer the second. Maybe it could be spelt
* foo else bar ?
How about
val = foo rather than bar
If that is not clear and obvios, I don't know what is. ;)
/W
Excellent
cf29 wrote:
Greetings,
I designed in JavaScript a small program on my website called 5
queens.
..
Has anyone tried to do a such script? If anyone is
interested to help I can show what I've done so far.
Tim Peters has a solution to 8 queens in test_generators in the standard
library
Terry Reedy wrote:
Maric Michaud [EMAIL PROTECTED] wrote in message
news:[EMAIL PROTECTED]
|I faced a strange behavior with generator expression, which seems like a
bug, for both
| python 2.4 and 2.5 :
Including the latest release (2.5.2)?
| class A :
| ... a = 1, 2, 3
| ...
MonkeeSage wrote:
A quick question about how python parses a file into compiled
bytecode. Does it parse the whole file into AST first and then compile
the AST, or does it build and compile the AST on the fly as it reads
expressions? (If the former case, why can't functions be called before
Kay Schluehr wrote:
This unexpected attack in his rear frightened him so much, that he
leaped forward with all his might: the horse's carcase dropped on the
ground, but in his place the wolf was in the harness, and I on my part
whipping him continually: we both arrived in full career safe at
Michael Goerz wrote:
Hi,
I am writing unicode stings into a special text file that requires to
have non-ascii characters as as octal-escaped UTF-8 codes.
For example, the letter Í (latin capital I with acute, code point 205)
would come out as \303\215.
I will also have to read back
Dennis Lee Bieber wrote:
On Fri, 30 Nov 2007 11:36:44 -0800, Michael Spencer
Can anyone recommend a solution that also synchronizes post read status? If
Google Reader or something like it handled NNTP, I imagine I'd use it to
achieve
this benefit.
Unlike email clients (SMTP/POP
Ben Finney wrote:
I'm not interested in learning some centralised web-application
interface, and far prefer the discussion forum to be available by a
standard *protocol*, that I can use my choice of *local client*
application with.
I agree: I use Thunderbird, and it works well. But I
Tor Erik Sønvisen wrote:
Hi,
I've tried locating some code that can recreate an object from it's
string representation...
The object in question is really a dictionary containing other
dictionaries, lists, unicode strings, floats, ints, None, and
booleans.
I don't want to use eval,
Karlo Lozovina wrote:
Any idea how to do that with metaclasses and arbitrary long list of
attributes? I just started working with them, and it's driving me nuts :).
Thanks for the help,
best regards.
Try implementing a property factory function before worrying about the
metaclass.
+1 Subject line of the week (SLOTW)
rjcarr wrote:
So my question is ... why are they [os.path and logging.handlers] different?
[A] wrote:
Because you misspelled it. First, do a dir() on logging:
[B] wrote:
No, he didn't... OP: logging is a package and logging.handlers is one module
in the
Python Maniac wrote:
I am new to Python however I would like some feedback from those who
know more about Python than I do at this time.
def scrambleLine(line):
s = ''
for c in line:
s += chr(ord(c) | 0x80)
return s
def descrambleLine(line):
s = ''
for c
Mark Morss wrote:
I would like to construct a class that includes both the integers and
None. I desire that if x and y are elements of this class, and both
are integers, then arithmetic operations between them, such as x+y,
return the same result as integer addition. However if either x or y
Boudreau, Emile wrote:
Hey all,
So I'm trying to filter a list with the built-in function
filter(). My list looks something like this:
['logs', 'rqp-8.2.104.0.dep', 'rqp-8.2.93.0.dep',
'rqp-win32-app-8.2.96.0-inst.tar.gz', 'rqp-win32-app-8.2.96.0-inst.tar.gz']
Calling filter like
7stud [EMAIL PROTECTED] wrote in message
news:[EMAIL PROTECTED]
Hi,
Can someone show me how to manually implement staticmethod()? Here is
my latest attempt:
Raymond Hettinger can:
http://users.rcn.com/python/download/Descriptor.htm#static-methods-and-class-methods
--
alain wrote:
I have a problem I wonder if it has been solved before.
I have a dictionnary and I want the values in the dictionnary to be
annotated with the rank that would be obtained by sorting the values
def annotate_with_rank(my_dict):
return my_annotated_dict
In
n00m wrote:
http://www.spoj.pl/problems/SUMFOUR/
3
0 0 0 0
0 0 0 0
-1 -1 1 1
Answer for this input data is 33.
My solution for the problem is
==
import time
t = time.clock()
q,w,e,r,sch,h = [],[],[],[],0,{}
f
Gabriel Genellina wrote:
(I cannot find peephole.c on the source distribution for Python 2.5, but
you menctioned it on a previous message, and the comment above refers to
the peephole optimizer... where is it?)
The peephole optimizer is in compile.c - the entry point is optimize_code
Sergio Correia wrote:
spam = [[1, 2, 3], [4, 5, 6], [7, 8, 9], [10, 11, 12]]
Into something like
eggs = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12]
There are *no* special cases (no empty sub-lists).
eggs = [i for j in spam for i in j]
Michael
--
Franz Steinhaeusler wrote:
Use Spaces, size: 4
detect mixed line ending
detect tabs mixed with space
trim trailing whitespaces.
look at: tools/scripts/reindent.py
convert structs like: if (a b): to if a b:
fill in spaces, but not in functions between operators:
a+=1 = a += 1
J. Clifford Dyer wrote:
I think that's the first time I've actually seen someone use a Monty
Python theme for a python example, and I must say, I like it. However,
We are all out of Wensleydale.
Cheers,
Cliff
Oh, then you clearly don't waste nearly enough time on this newsgroup ;-)
BartlebyScrivener wrote:
Python pseudo code limericks anywhere?
I wrote the following in response to Steve Holden's limerick challenge a
couple of years ago:
# run me or voice the alphanumeric tokens
from itertools import repeat
for feet in [3,3,2,2,3]:
print .join(DA-DA-DUM
Nick Maclaren wrote:
Well, I am already doing that, and regretting the fact that Python
doesn't seem to allow a class instantiation to return a new class :-)
class Fake(object):
... def __new__(cls):
... return 42
...
Fake()
42
instantiation (i.e., calling the
John Henry wrote:
Carl Banks wrote:
snip
The function can be extended to allow arbitrary arguments. Here's a
non-minmal recursive version.
def cartesian_product(*args):
if len(args) 1:
for item in args[0]:
for rest in cartesian_product(*args[1:]):
Gregg Lind wrote:
I wish something like this was part of the standard python installation,
and didn't require one to use Numpy or Numarray. This sort of list
subsetting is useful in many, many contexts.
Many of numpy's multi-dimensional slicing and indexing operations are
implemented
Kenneth McDonald wrote:
I'm trying to write a 'flatten' generator which, when give a
generator/iterator that can yield iterators, generators, and other data
types, will 'flatten' everything so that it in turns yields stuff by
simply yielding the instances of other types, and recursively
Paul Boddie wrote:
Martin v. Löwis wrote:
...The compiler package is largely unmaintained and
was known to be broken (and perhaps still is).
I don't agree entirely with the broken assessment. Although I'm not
chasing the latest language constructs, the AST construction part of
the package
Martin v. Löwis wrote:
Georg Brandl schrieb:
Perhaps you can bring up a discussion on python-dev about your improvements
and how they could be integrated into the standard library...
Let me second this. The compiler package is largely unmaintained and
was known to be broken (and perhaps
Georg Brandl wrote:
Michael Spencer wrote:
Announcing: compiler2
-
For all you bytecode enthusiasts: 'compiler2' is an alternative to the
standard
library 'compiler' package, with several advantages.
Is this a rewrite from scratch, or an improved stdlib compiler
Announcing: compiler2
-
For all you bytecode enthusiasts: 'compiler2' is an alternative to the
standard
library 'compiler' package, with several advantages.
Improved pure-python compiler
- Produces identical bytecode* to the built-in compile function for all /Lib
and
George Sakkis wrote:
Michael Spencer wrote:
George Sakkis wrote:
Michael Spencer wrote:
def chunker(s, chunk_size=3, sentry=., keep_first = False, keep_last =
False):
buffer=[]
...
And here's a (probably) more efficient version, using a deque as a
buffer:
Perhaps the deque-based
[EMAIL PROTECTED] wrote:
Hello,
i'm looking for this behaviour and i write a piece of code which works,
but it looks odd to me. can someone help me to refactor it ?
i would like to walk across a list of items by series of N (N=3 below)
of these. i had explicit mark of end of a sequence
[EMAIL PROTECTED] wrote:
actually for the example i have used only one sentry condition by they
are more numerous and complex, also i need to work on a huge amount on
data (each word are a line with many features readed from a file)
An open (text) file is a line-based iterator that can be fed
George Sakkis wrote:
Michael Spencer wrote:
Here's a small update to the generator that allows optional handling of the
head
and the tail:
def chunker(s, chunk_size=3, sentry=., keep_first = False, keep_last =
False):
buffer=[]
...
And here's a (probably) more efficient version
David Isaac wrote:
Thanks to both Roberto and George.
I had considered the recursive solution
but was worried about its efficiency.
I had not seen how to implement the numpy
solution, which looks pretty nice.
Thanks!
Alan
You could also use pyarray, which mimics numpy's indexing, but
Mark E. Fenner wrote:
and the copy is taking the majority (42%) of my execution time.
So, I'd like to speed up my copy. I had an explicit copy method that did
what was needed and returned a new object, but this was quite a bit slower
than using the standard lib copy.copy().
How are you
Mark E. Fenner wrote:
Michael Spencer wrote:
Mark E. Fenner wrote:
and the copy is taking the majority (42%) of my execution time.
So, I'd like to speed up my copy. I had an explicit copy method that did
what was needed and returned a new object, but this was quite a bit
slower than
Michael J. Fromberger wrote:
...
Of course, I could just bypass super, and explicitly invoke them as:
C.__init__(self, ...)
D.__init__(self, ...)
... but that seems to me to defeat the purpose of having super in the
first place.
As others have pointed out, super, is designed to do
Michele Simionato wrote:
[EMAIL PROTECTED] wrote:
I need to find out if an object is a class.
Which is quite simply awful...does anyone know of a better way to do
this?
inspect.isclass
M.S.
...which made me wonder what this canonical test is. The answer:
def isclass(object):
David Hirschfield wrote:
Another deep python question...is it possible to have code run whenever
a particular object is assigned to a variable (bound to a variable)?
So, for example, I want the string assignment made to print out
whenever my class Test is assigned to a variable:
class
David Hirschfield wrote:
I'm not sure this is possible, but it sure would help me if I could do it.
Can a function learn the name of the variable that the caller used to
pass it a value? For example:
def test(x):
print x
val = 100
test(val)
Is it possible for function test() to
Devan L wrote:
Is there any safe way to create an instance of an untrusted class
without consulting the class in any way? With old-style classes, I can
recreate an instance from another one without worrying about malicious
code (ignoring, for now, malicious code involving attribute access) as
Terry Reedy wrote:
CC [EMAIL PROTECTED] wrote in message
news:[EMAIL PROTECTED]
I wanna compile a 6000x1000 array with python. The array starts from
'empty', each time I get a 6000 length list, I wanna add it to the
exist array as a column vector. Is there any function to do so?
Or, I can
Terry Reedy wrote:
Michael Spencer [EMAIL PROTECTED] wrote in message
news:[EMAIL PROTECTED]
If you're just looking for a multi-dimensional array type, and don't need
maximum speed or the vast range of array-processing that numpy offers,
then
*pyarray* provides a pure-python single module
Ian Bicking wrote:
I got a puzzler for y'all. I want to allow the editing of functions
in-place. I won't go into the reason (it's for HTConsole --
http://blog.ianbicking.org/introducing-htconsole.html), except that I
really want to edit it all in-process and in-memory. So I want the
Kay Schluehr wrote:
Just reasoning about conversion of classic to new style classes (
keeping deprecation of ClCl in Py3K in mind ) I wonder if there is a
metaclass that can be used to express the semantics of ClCl in terms of
new style classes? Intuitively I would expect that there is quite a
Clodoaldo Pinto wrote:
Is there a simple way to build a dictionary from a string without using
eval()?
s = '{a:1}'
d = eval(s)
d
{'a': 1}
Regards, Clodoaldo Pinto
Here is a discussion about one way to do it:
http://tinyurl.com/o8mmm
HTH
Michael
--
Clodoaldo Pinto wrote:
Michael Spencer wrote:
http://aspn.activestate.com/ASPN/Cookbook/Python/Recipe/364469
Very nice work. It will be very useful. Thanks.
Only a small problem when I try to evaluate this:
safe_eval('True')
I get:
Traceback (most recent call last):
File
Anthony Liu wrote:
I am at my wit's end.
I want to generate a certain number of random numbers.
This is easy, I can repeatedly do uniform(0, 1) for
example.
But, I want the random numbers just generated sum up
to 1 .
I am not sure how to do this. Any idea? Thanks.
Edward Elliott wrote:
...
for x in list1:
i += 1
# for y in list2:
print x * i
and have the print line execute as part of the for x block. In other
words, I want the block with print to be in the scope of the for x loop.
But instead it raises a SyntaxError because the
Sandra-24 wrote:
No it's not an academic excercise, but your right, the situation is
more complex than I originally thought. I've got a minor bug in my
template code, but it'd cause more trouble to fix than to leave in for
the moment.
Thanks for your input!
-Sandra
Take a look at the
John Salerno wrote:
Ben Cartwright wrote:
Definitely go for (1). The Morris sequence is a great candidate to
implement as a generator. As a generator, it will be more flexible and
efficient than (2).
Actually I was just thinking about this and it seems like, at least for
my purpose
John Salerno wrote:
Michael Spencer wrote:
itertools.groupby makes this very straightforward:
I was considering this function, but then it seemed like it was only
used for determing consecutive numbers like 1, 2, 3 -- not consecutive
equivalent numbers like 1, 1, 1
Cloudthunder wrote:
Sorry, I don't understand, how does this solve my problem?
__getattr__ and __setattr__ allow you to set up dynamic delegation e.g.,
class Foo(object):
def __init__(self, **kw):
self.__dict__.update(kw)
def methFoo(self, x):
return
Kamilche wrote:
Hi everyone. I'm trying to convert a string that looks like this:
gid = 'FPS', type = 'Label', pos = [0, 20], text = 'FPS', text2 = 'more
text without quotes', fmtline = @VALUE @SIGNAL, signals = [('FPS',
None), ('FPS2', 'something')]
to a dict that looks like this:
Kamilche wrote:
Thanks! It's interesting, and nearly what I want, but not quite there.
When I run my sample code through it, I get a syntax error because it's
not a valid expression. If I were to put a 'dict(' in front and a ')'
at the end, THEN it nearly works - but it gives me an
[EMAIL PROTECTED] wrote:
The python code below is adapted from a Haskell program written by
Tomasz
Wielonka on the comp.lang.functional group. It's more verbose than his
since I wanted to make sure I got it right.
http://groups.google.com/group/comp.lang.functional/browse_frm/thread...
kpp9c wrote:
I have a question... and ... whew ... i am gonna be honest, i haven't
the slightest clue how to even start ... i am not sure if i used up all
my good will here or can take a mulligan.. i love to try to at least
post some lame broken code of my own at first... but like i said, not
[EMAIL PROTECTED] wrote:
Nevermind, I didn't understand the problem/question... Sorry.
Bye,
bearophile
Really? Your solution looks fine to me.
In any case, here's an alternative approach to the (based on the same
understanding of the problem as bearophile's, but with the additional
bruno at modulix wrote:
Ziga Seilnacht wrote:
bruno at modulix wrote:
Hi
I'm currently playing with some (possibly weird...) code, and I'd have a
use for per-instance descriptors, ie (dummy code):
snip
Now the question: is there any obvious (or non-obvious) drawback with
this approach
Joseph Turian wrote:
In another thread, it was recommended that I wrap a dictionary in a
class.
How do I do so?
Joseph
that thread:
http://groups.google.com/group/comp.lang.python/browse_frm/thread/9a0fbdca450469a1/b18455aa8dbceb8a?q=turianrnum=1#b18455aa8dbceb8a
Perhaps like this?
Bruno Desthuilliers wrote:
Michael Spencer a écrit :
I may be missing the subtlety of what you're up to, but why is
overriding __getattribute__ more desirable than simply defining the
descriptor in a subclass?
The code snippet I gave as an example was not supposed to reflect how I
Lonnie Princehouse wrote:
What's your use case exactly ?
I'm trying to use a function to implicitly update a dictionary. The
whole point is to avoid the normal dictionary semantics, so kw['x'] = 5
unfortunately won't do.
I think bytecode hacks may be the way to go
I once messed around
Fredrik Lundh wrote:
hello world .split()
['hello', 'world']
a.split() == b.split() is a convenient test, provided you want to normalize
whitespace rather than ignore it. I took the OP's requirements to mean that
'A B' == 'AB', but this is just a guess.
Michael
--
Olivier Langlois wrote:
I would like to make a string comparison that would return true without
regards of the number of spaces and new lines chars between the words
like 'A B\nC' = 'A\nBC'
import string
NULL = string.maketrans(,)
WHITE = string.whitespace
def compare(a,b):
Per wrote:
Thanks Ron,
surely set is the simplest way to understand the question, to see
whether there is a non-empty intersection. But I did the following
thing in a silly way, still not sure whether it is going to be linear
time.
def foo():
l = [...]
s = [...]
dic = {}
Olivier Langlois wrote:
Hi Michael!
Your suggestion is fantastic and is doing exactly what I was looking
for! Thank you very much.
There is something that I'm wondering though. Why is the solution you
proposed wouldn't work with Unicode strings?
Simply, that str.translate with two
Alex Martelli wrote:
Michael Spencer [EMAIL PROTECTED] wrote:
Here, str.translate deletes the characters in its optional second argument.
Note that this does not work with unicode strings.
With unicode, you could do something strictly equivalent, as follows:
nowhite = dict.fromkeys(ord
Fredrik Lundh wrote:
[EMAIL PROTECTED] wrote:
The problem I'm trying to solve is.
There is a 5x5 grid.
You need to fit 5 queens on the board such that when placed there are
three spots left that are not threatened by the queen.
when you're done with your homework (?), you can compare it
Don Taylor wrote:
Is there a way to discover the original string form of the instance that
is represented by self in a method?
For example, if I have:
fred = C()
fred.meth(27)
then I would like meth to be able to print something like:
about to call meth(fred, 27)
ProvoWallis wrote:
My document looks like this
level1A. Title Text
level21. Title Text
level21. Title Text
level21. Title Text
level1B. Title Text
level21. Title Text
level21. Title Text
but I want to change the numbering of the second level to sequential
numbers like 1, 2, 3, etc.
[EMAIL PROTECTED] wrote:
Hi All,
First, I hope this post isn't against list rules; if so, I'll take note in
the future.
I'm working on a project for school (it's not homework; just for fun).
For it, I need to make a list of words, starting with 1 character in length,
up to 15 or so.
It
[EMAIL PROTECTED] wrote:
...
I'm working on a project for school (it's not homework; just for fun).
For it, I need to make a list of words, starting with 1 character in length,
up to 15 or so.
It would look like:
A B C d E F G ... Z Aa Ab Ac Ad Ae Aaa Aab Aac
...
If there is adaptable
[EMAIL PROTECTED] wrote:
I write a lot of code that looks like this:
for myElement, elementIndex in zip( elementList,
range(len(elementList))):
print myElement , myElement, at index: ,elementIndex
My question is, is there a better, cleaner, or easier way to get at the
element in a
KraftDiner wrote:
I have a 2D array. Say it is 10x10 and I want a 1D Array of 100
elements...
What is the syntax?
oneD = reshape(twoD, (100,1))
or
oneD = reshape(twoD, (1,100))
One I guess is the transpose of the other but both seem to be
arrays of arrays...
help?!
Using pyarray,
Robert Kern wrote:
KraftDiner wrote:
I have a list that starts out as a two dimensional list
I convert it to a 1D list by:
b = sum(a, [])
any idea how I can take be and convert it back to a 2D list?
Alternatively, you could use real multidimensional arrays instead of faking it
with
Rob Cowie wrote:
I'm having a bit of trouble with this so any help would be gratefully
recieved...
After splitting up a url I have a string of the form
'tag1+tag2+tag3-tag4', or '-tag1-tag2' etc. The first tag will only be
preceeded by an operator if it is a '-', if it is preceded by
john peter wrote:
I'd like to write two generators: one is a min to max sequence number
generator that
rolls over to min again once the max is reached. the other is a generator
that cycles
through N (say, 12) labels. currently, i'm using these generators in nested
loops like
this:
Dylan Moreland wrote:
I'm trying to implement a bunch of class methods in an ORM object in
order to provide functionality similar to Rails' ActiveRecord. This
means that if I have an SQL table mapped to the class Person with
columns name, city, and email, I can have class methods such as:
Swroteb wrote:
Paul Rubin wrote:
I think the natural approach is to make a generator that yields a
5-tuple for each combination, and then have your application iterate
over that generator. Here's my version:
def comb(x,n):
Generate combinations of n items from list x
[EMAIL PROTECTED] wrote:
...
But i am stuck on how to do a random chooser that works according to my
idea of choosing according to rating system. It seems to me to be a bit
different that just choosing a weighted choice like so:
...
And i am not sure i want to have to go through what
DaveM wrote:
Although I've programmed for fun - on and off - since the mid 70's, I'm
definitely an OO (and specifically Python) beginner.
My first question is about global variables. Are they, as I'm starting to
suspect, a sin against God or just best avoided? Having got my current
Charles Krug wrote:
List:
...
# expensive Object Module
_expensiveObject = None
def ExpensiveObject():
if not(_expensiveObject):
_expensiveObject = A VERY Expensive object
return _expensiveObject
...
I obviously missed some part of the scoping rules.
What's the
Fredrik Lundh wrote:
Fabiano Sidler wrote:
I'm looking for a way to compile python source to bytecode instead of
code-objects. Is there a possibility to do that? The reason is: I want
to store pure bytecode with no additional data.
use marshal.
The second question is, therefore: How
Raymond Hettinger wrote:
from itertools import count, izip
def dict2str(d, preferred_order = ['gid', 'type', 'parent', 'name']):
last = len(preferred_order)
rank = dict(izip(preferred_order, count()))
pairs = d.items()
pairs.sort(key=lambda (k,v): rank.get(k, (last, k, v)))
Roger L. Cauvin wrote:
Fredrik Lundh [EMAIL PROTECTED] wrote in message
news:[EMAIL PROTECTED]
Roger L. Cauvin wrote:
$ python test.py
gotexpected
---
accept accept
reject reject
accept accept
reject reject
accept accept
Thanks, but the second test case I listed
Daniel Nogradi wrote:
...
- database content ---
Alice 25
Bob 24
- program1.py -
class klass:
...
inst = klass()
- program2.py ---
import program1
# The code in klass above should be such that the following
# line should
Michael Spencer wrote:
result[ix::count] = input + [pad]*(maxlen-lengths[ix])
Peter Otten rewrote:
result[ix:len(input)*count:count] = input
Quite so. What was I thinking?
Michael
--
http://mail.python.org/mailman/listinfo/python-list
by Michael Spencer)
Interleave any number of sequences, padding shorter sequences if kw pad
is supplied
dopad = pad in kw
pad = dopad and kw[pad]
count = len(args)
lengths = map(len, args)
maxlen = max(lengths)
result = maxlen*count*[None]
for ix, input
[EMAIL PROTECTED] wrote:
It's important that I can read the contents of the dict without
flagging it as modified, but I want it to set the flag the moment I add
a new element or alter an existing one (the values in the dict are
mutable), this is what makes it difficult. Because the values are
Robin Becker schrieb:
Is there some smart/fast way to flatten a level one list using the
latest iterator/generator idioms.
...
David Murmann wrote:
Some functions and timings
...
Here are some more timings of David's functions, and a couple of additional
contenders that time faster on
Tim Hochberg wrote:
Michael Spencer wrote:
Robin Becker schrieb:
Is there some smart/fast way to flatten a level one list using the
latest iterator/generator idioms.
...
David Murmann wrote:
Some functions and timings
...
Here's one more that's quite fast using Psyco, but only
1 - 100 of 308 matches
Mail list logo
