from typing import Dict, Any, List
def slice_dict(original_dict: Dict[str, Any], keys: List[str]) -> Dict[str, Any]:
return {key: original_dict[key] for key in keys if key in original_dict}
# Example usage
data: Dict[str, Any] = {'a': 1, 'b': 2, 'c': 3, 'd': 4}
sliced_data: Dict[str, Any] = slice_dict(data, ['a', 'c'])
print(sliced_data) # Output: {'a': 1, '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?