In Python, dictionaries are versatile data structures that allow for the storage of key-value pairs. Iterating over dictionaries is straightforward and can be done in several ways depending on what you need. Below are common methods to iterate over dictionaries.
# Example 1: Iterating over keys
my_dict = {'a': 1, 'b': 2, 'c': 3}
for key in my_dict:
print(key) # Output: a, b, c
# Example 2: Iterating over values
for value in my_dict.values():
print(value) # Output: 1, 2, 3
# Example 3: Iterating over key-value pairs
for key, value in my_dict.items():
print(key, value) # Output: a 1, b 2, c 3
How do I avoid rehashing overhead with std::set in multithreaded code?
How do I find elements with custom comparators with std::set for embedded targets?
How do I erase elements while iterating with std::set for embedded targets?
How do I provide stable iteration order with std::unordered_map for large datasets?
How do I reserve capacity ahead of time with std::unordered_map for large datasets?
How do I erase elements while iterating with std::unordered_map in multithreaded code?
How do I provide stable iteration order with std::map for embedded targets?
How do I provide stable iteration order with std::map in multithreaded code?
How do I avoid rehashing overhead with std::map in performance-sensitive code?
How do I merge two containers efficiently with std::map for embedded targets?