# Mapping a function over a list in a memory-efficient way
def square(x):
return x * x
original_list = [1, 2, 3, 4, 5]
squared_list = map(square, original_list)
# Convert the map object to a list if needed
result = list(squared_list)
print(result) # Output: [1, 4, 9, 16, 25]
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?