Certainly possible with list comprehensions.
a = abc
[(x, y) for x in a for y in a]
[('a', 'a'), ('a', 'b'), ('a', 'c'), ('b', 'a'), ('b', 'b'), ('b', 'c'),
('c', 'a'), ('c', 'b'), ('c', 'c')]
But I like bearophile's version better.
Andreas,
Thanks, but I think you were missing my
try something like:
for line in open(filename).readlines():
if (re.search(PHE|ASP,line):
print line
On Tue, Jul 14, 2009 at 1:33 PM, amr...@iisermohali.ac.in wrote:
Dear all,
Can anyone tell me that suppose i have a file having content like:
_Atom_name
_Atom_type
I think what Grant is saying is that you should read the documentation
for the re module.
David
On Tue, Jul 14, 2009 at 3:12 PM, Grant Edwardsinva...@invalid wrote:
On 2009-07-14, amr...@iisermohali.ac.in amr...@iisermohali.ac.in wrote:
Can i become more precise like instead of printing all
Hi guys.
I was thinking about a problem I had: suppose I have a list of
possible values. I want to to have a list of all possible lists of
length n whose values are in that original list.
For example: if my values are ['a', 'b', 'c'], then all possible lists
of length 2 would be: aa, ab, ac, ba,
Or on systems with list comps try:
V='abc'
['%s%s'%(ii,jj) for ii in V for jj in V]
['aa', 'ab', 'ac', 'ba', 'bb', 'bc', 'ca', 'cb', 'cc']
Yeah, except that the length here is hard-coded. There's no way (as
far as I can tell, at least), to make this generic with respect to
list length.
