Some help with Dictionaries

[Oshadha]

Script,

a_dic = {
    "a" :   [":D", ":)"],
    "b" :   ["lol", "XD"],
    "c" :   ["lol", ">:"],
    "d" :   [":)", "XD"]
}

How do I search for values and print out their key?

In a_dict i want to search ":)" and print its keys.

For example :

Search_item = ":)"

Output:
d
a

[bowlofred]

The dictionary itself doesn't have any features that allow you to search a key based on a value. All you can do is loop over every key/value and keep track of keys where the value meets your criteria. As the dictionary grows large, this operation will become more expensive.

a_dic = {
    "a" :   [":D", ":)"],
    "b" :   ["lol", "XD"],
    "c" :   ["lol", ">:"],
    "d" :   [":)", "XD"]
}

search_item = ":)"

match_keys = [k for k,v in a_dic.items() if search_item in v]
print(match_keys)

Output:
['a', 'd']

[Oshadha]

The dictionary itself doesn't have any features that allow you to search a key based on a value. All you can do is loop over every key/value and keep track of keys where the value meets your criteria. As the dictionary grows large, this operation will become more expensive.

a_dic = {
    "a" :   [":D", ":)"],
    "b" :   ["lol", "XD"],
    "c" :   ["lol", ">:"],
    "d" :   [":)", "XD"]
}

search_item = ":)"

match_keys = [k for k,v in a_dic.items() if search_item in v]
print(match_keys)

Output:
['a', 'd']

When you mean expensive, you mean from time & resources right?

[DeaD_EyE]

When you mean expensive, you mean from time & resources right?

A dict consumes more memory as a tuple or list.
Creating a dict is slow. To find a key in a dict is very fast independent of the dict size.

You've to think about this problem, if the size is big enough, but not for 4 elements.

This overhead is important if you work later with data where you have data shaped like 1.000.000 x 10.