in reply to Recursively substitute against multidimensional hash
Something like this? No eval necessary.
use warnings; use strict; sub dive { my ($r, @p) = @_; return unless @p; unshift @p, 'default' if @p==1; $r = ref $r eq 'HASH' && exists $$r{$_} ? $$r{$_} : return for + @p; return $r } my %var = ( default => { foo => 'Default-Foo' }, foo => { bar => 'Foo-Bar' }, a => { deeply => { nested => { value => 'A-Deeply-Nested-Value +' } } }, ); my $work = <<'EOF'; Hello, %foo Blah, %foo.bar Deep: %a.deeply.nested.value EOF print $work =~ s{ % ( \w+ (?:\.\w+)* ) }{ dive \%var, split /\./, $1 } +xegr; __END__ Hello, Default-Foo Blah, Foo-Bar Deep: A-Deeply-Nested-Value
This is based on my node here. I also have similar code linked from my scratchpad in the bullet point "Data::Diver type code".
|
---|
Replies are listed 'Best First'. | |
---|---|
Re^2: Recursively substitute against multidimensional hash
by Maelstrom (Beadle) on Feb 14, 2025 at 10:16 UTC | |
by Maelstrom (Beadle) on Feb 14, 2025 at 18:32 UTC | |
by haukex (Archbishop) on Feb 15, 2025 at 10:22 UTC |