In python... I have a list of elements \'my_list\', and a dictionary \'my_dict\' where some keys match in \'my_list\'.
I would like to search the dictionary and retrieve
new_dict = dict((k, v) for k, v in dict.iteritems() if k in list)
Turning list into a set set(list)
may yield a noticeable speed increase
Don't use dict
and list
as variable names. They shadow the built-in functions. Assuming list l
and dictionary d
:
kv = [(k, d[k]) for k in l if k in d]
Here is a one line solution for that
{i:my_dict[i] for i in set(my_dict.keys()).intersection(set(my_list))}
What about print([kv for kv in dict.items() if kv[0] in list])
(I renamed list
to my_list
and dict
to my_dict
to avoid the conflict with the type names.)
For better performance, you should iterate over the list and check for membership in the dictionary:
for k in my_list:
if k in my_dict:
print k, my_dict[k]
If you want to create a new dictionary from these key-value pairs, use
new_dict = {k: my_dict[k] for k in my_list if k in my_dict}
Try This:
mydict = {'one': 1, 'two': 2, 'three': 3}
mykeys = ['three', 'one','ten']
newList={k:mydict[k] for k in mykeys if k in mydict}
print newList
{'three': 3, 'one': 1}