Is there a shorthand way of checking for keys in a dictionary?
Something that I can use instead of using multiple in and and operators - instead of the following:
('somekey' in d) and ('someotherkey' in d) and ('somekeyggg' in d)
-
What's wrong with this? It looks very clear and elegant.S.Lott– S.Lott2011-08-19 22:44:13 +00:00Commented Aug 19, 2011 at 22:44
-
It gets annoying if you have to do it for 8 or 9 keys.krb– krb2011-08-19 22:45:26 +00:00Commented Aug 19, 2011 at 22:45
-
Then consider showing that as the example. The three key version isn't bad, and doesn't demonstrate any real problem.S.Lott– S.Lott2011-08-19 22:46:39 +00:00Commented Aug 19, 2011 at 22:46
Add a comment
|
2 Answers
all( word in d for word in [ 'somekey', 'someotherkey', 'somekeyggg' ] )
5 Comments
recursive
@Gareth: why did you add that split?
Marty
@reno sorry to pick nits, but I believe that would be a generator expression.
machine yearning
This should be changed back to its original form. No reason for the edit.
Felix Kling
@Gareth: You can explain in your own answer why you think using a string and
split() is better, but I see no reason to change the other answers to follow this approach.
Don O'Donnell
@Marty: Not really a nit you're picking here: the generator expression short-circuits on the first
word that's not in d. A list comprehension will create the entire list of boolean values before calling the all function. This is a really cool feature of using all() and any() with generator expressions.set(['somekey', 'someotherkey', 'somekeyggg']).issubset(d)
