Rita Sue and Bob too
nholtz at docuweb.ca
Fri Aug 20 18:50:26 CEST 2004
"Ben Last" <ben at benlast.com> wrote in message news:<mailman.2010.1092985999.5135.python-list at python.org>>
> seqToFind = ['Rita','Sue','Bob']
> seqToReplace = ['A','B','C']
> seqToSearch =
> That last block could also be written as:
> #s ends up with the resulting list
> s = seqToSearch
> s =
> But that's verging on the obfuscated :)
Very perlish indeed.
But the above fails if the first or last words in seqToFind are
or leading substrings of other words in seqToSearch. IE, if>
So something that fails slightly less often:
def repseq4( names, old, new ):
s = '\003'; return
It turns out that this is actually faster than the more obvious
(by about 25% (over Jeremy Jones' method) for a names list of 1000
names, replacing the middle 3).
Sure is ugly, though.
More information about the Python-list