# Example of reducing a dictionary using a dictionary comprehension
original_dict = {'a': 1, 'b': 2, 'c': 3}
# Reducing the dict to only items where the value is greater than 1
reduced_dict = {k: v for k, v in original_dict.items() if v > 1}
print(reduced_dict) # Output: {'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?