We don't bite newbies here... much | |
PerlMonks |
Re: Comparing two hashes-helpby sundialsvc4 (Abbot) |
on Aug 20, 2010 at 20:06 UTC ( [id://856352]=note: print w/replies, xml ) | Need Help?? |
First of all, you should know that in this forum, you can be sure to be treated respectfully. No matter how “new to Perl” you might or might not be. This is a gathering-place of professionals. Second... I often find it useful to describe logic like this in terms of a finite-state machine (FSM). The idea here is actually a simple one, despite the obfuscatory-sounding name. It works like this:
So, to continue my extemporaneous-design exercise a bit farther, the algorithm could start in state SKIPPING_FOR_IDENTICAL_VALUES and, when it finds one, switch to LOOKING_FOR_BLANK_IN_FILE_1. It would continue until it finally reached a stop-state of END_OF_BOTH_FILES_REACHED. (I hope...) you get the idea from this barest of sketches, which by the way is not specific to Perl.
In Section
Seekers of Perl Wisdom
|
|