Re^3: Massive regexp search and replace

[Hena]

Well, all direct text translations might be handled faster... but unless there is a lot of them compared to others then it probably won't help (might actually be slower). The actual help would be better to be tested as this is pure speculation :).

Basicly make to hashes instead of one. Something like this.

while (<REGEX>) {
  chomp;
  my ($key,$value) = split (\t,$_);
  $value = "\"$value\"";
  if ($key=~s/^\w+$/) {
    $simple{$key}=$value;
  } else {
    $regex{$key}=$value;
  }
}

while (<INPUT>) {
  s/$key/$regex{$key}/gee foreach my $key (keys %regex);
  foreach (split (/\s+/,$_)) {
    if (exists($simple{$_})) {
      push (@line,$simple{$_});
    } else {
      push (@line,$_);
    }
  }
  print OUT "@line\n";
}

Note that in the given examples, you might write out the '[Tt]ile' pattern to Tile and tile rows. Which would move it from slower pattern group to faster. But as I said, I'm not sure how much this would help.