Re^2: Precompiling substitution regex

Replies are listed 'Best First'.
Re^3: Precompiling substitution regex by moritz (Cardinal) on Jun 17, 2011 at 12:04 UTC
Well, you could of course store an array of closures that each does a substitution, and call those in turn - but it might slow down things again. Or you could store regexes and substitutions in the same array, but distinguished by different indexes (even/odd or first half/second half). But I don't think you can easily store a precompiled whole substitution in a single scalar. Perl 6 - second systems done right	[reply]
Re^4: Precompiling substitution regex by AnomalousMonk (Archbishop) on Jun 17, 2011 at 18:11 UTC
... store regexes and substitutions in the same array, but distinguished by different indexes ... An example of what I think moritz is referring to (and the way I think I would approach the problem): `>perl -wMstrict -le "my @subs = ( [ qr{ (?i) foo \| bar }xms => 'quux' ], [ qr{ fee \| fie \| foe }xms => 'fum' ], ); ;; my $string = 'foo fee BAR foe fOo fie FOE'; for my $ar_sub (@subs) { my ($search, $replace) = @$ar_sub; $string =~ s{$search}{$replace}g; } print qq{'$string'}; " 'quux fum quux fum quux fum FOE'` [download] Note that regex modifiers like /g cannot be associated with each individual regex using this approach; something a little more fancy is needed for that.	[reply] [d/l]