<?php
// Example of deep copying arrays in Perl with Unicode strings
use Storable qw(dclone);
my $original = {
name => "Café",
items => ["café", "jalapeño", "ñandú"]
};
my $copy = dclone($original);
// Modify the original
$original->{name} = "Restaurant";
// Output to check that the copy is unchanged
print "Original: ", $original->{name}, "\n"; // Outputs: Restaurant
print "Copy: ", $copy->{name}, "\n"; // Outputs: Café
?>
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?