Python: Dictionaries and Sets
2026-02-21 02:56 Diff
https://hexlet.io/courses/python-dicts/lessons/updating/theory_unit

Python dictionaries are mutable. If we want to add a new key-value pair, we do not need the .append or other separate list methods. Usual assigning is enough:

Here you can see that assigning a value to a new key looks the same as setting values to existing keys — it is convenient. Removing items from the dictionary is done using the pop method. The dictionary is already more like a list in this case. Only we use the key instead of the index:

The example shows that Python will throw an exception if you try to extract a value from a non-existent key. However, we can call the pop method with a default value. In this case, if there is no key in the dictionary, we will get this value with no exception thrown:

Another version of pop without arguments is the popitem method. It extracts the key and value as a tuple, and if the dictionary is already empty, it throws an exception:

Remember that the order of keys in the dictionary does not depend on the order in which we added these keys to the dictionary. Therefore, we cannot rely on the order in which Python returns data when we call popitem. But we can be sure we extracted everything and did it only once for all pairs.

Adding one dictionary to another

Lists have the extend method that extends one list with another. Dictionaries have a similar update method. However, the associated dictionary object does not just get key-value pairs from the new dictionary when we call update.

There is an actual data update hence update. We added new keys to the dictionary, and if some keys already existed before, we will replace the values associated with them with new ones, for example:

We added lemons and updated the number of oranges — it is clear, simple, and convenient.

Copying a dictionary

In the case of lists, we can add together two lists and get a new one. Or we can get a copy of one list and append it with data from the second, but we cannot combine dictionaries, and they do not support slices, either.

However, they have the copy method, which works similarly to copying a list using a [:] slice. When we call it, it returns a so-called shallow copy of the dictionary. The shallow copy only reproduces the structure of the dictionary. It does not copy the values but creates new links to them. Nevertheless, the shallow copy is a new dictionary that can change its composition without affecting the original:

The c dictionary got its structure, and its update did not affect the original d dictionary. We replicated the link to the list when we copied the dictionary, so changing the list object by reference affected the original list too.

Clearing a dictionary

We can clear lists by assigning a l[:] = [] slice using the clear method with dictionaries:

The clear() method removes all elements from the current dictionary.