In Perl, you can use multidimensional data structures such as arrays of arrays or hashes of hashes to organize complex data. Here is a simple example of each type:
my @matrix = (
[1, 2, 3],
[4, 5, 6],
[7, 8, 9]
);
foreach my $row (@matrix) {
foreach my $element (@$row) {
print "$element ";
}
print "\n";
}
my %data = (
'fruit' => { 'apple' => 1, 'banana' => 2 },
'vegetable' => { 'carrot' => 3, 'potato' => 4 }
);
foreach my $category (keys %data) {
foreach my $item (keys %{ $data{$category} }) {
print "$category: $item -> $data{$category}{$item}\n";
}
}
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?