Anonymous Monk has asked for the wisdom of the Perl Monks concerning the following question:
%naccess = map { /^\s+\S+\s+\S+\s+(\S+)/; ($1 => $_) } <IN2>; close (IN2); while (<IN>) { chomp; /^\s+(\S+)/; print OUT ($naccess{$1}) if (exists($naccess{$1})); }
|
|---|
| Replies are listed 'Best First'. | |
|---|---|
|
Re: hash question
by ikegami (Patriarch) on Nov 21, 2004 at 21:25 UTC | |
by Anonymous Monk on Nov 21, 2004 at 21:32 UTC | |
by ikegami (Patriarch) on Nov 21, 2004 at 21:35 UTC | |
by Anonymous Monk on Nov 21, 2004 at 21:38 UTC | |
by ikegami (Patriarch) on Nov 21, 2004 at 21:41 UTC | |
|
Re: hash question
by pg (Canon) on Nov 21, 2004 at 21:36 UTC | |
by Anonymous Monk on Nov 21, 2004 at 21:50 UTC | |
by Anonymous Monk on Nov 21, 2004 at 21:54 UTC | |
by ikegami (Patriarch) on Nov 22, 2004 at 03:39 UTC | |
by ysth (Canon) on Nov 21, 2004 at 22:30 UTC |