Stories
Slash Boxes
Comments
NOTE: use Perl; is on undef hiatus. You can read content, but you can't post it. More info will be forthcoming forthcomingly.

All the Perl that's Practical to Extract and Report

use Perl Log In

Log In

[ Create a new account ]

chaoticset (2105)

chaoticset
  (email not shown publicly)
http://chaoticset.perlmonk.org/
AOL IM: chaoticset23 (Add Buddy, Send Message)
Yahoo! ID: illuminatus_foil (Add User, Send Message)

JAPH. (That's right -- I'm not Really Inexperienced any more.)

I'm not just here, I'm here [perlmonks.org], and here [javajunkies.org] too, I ramble randomly in my philosophical blog [blogspot.com] and my other blog [blogspot.com]. Soon I'll come in a convenient six-pack.

Journal of chaoticset (2105)

Tuesday October 09, 2001
09:44 AM

First Step Into The Monastery

[ #929 ]
Went to perlmonks.

Wow, wow, wow.

Allow me to apologize now to anybody who read this and laughed, or winced: Sorry. This stuff is leagues below normal u.p.o journal entries.

That said, as long as it's not an issue, I think I'll keep writing in this journal. Once I've gotten this program functional, I'll just wipe all the old entries out and start fresh.

Actually, the reason I'm writing here is because my post at perlmonks has resulted in several solution replies and I'm going to implement one of them.

The point was made that it could be done with hashes, and fairly easily, it would seem. (It's always easy after you do it; I just need to do it now. ;-) ) Drop the whole of both arrays into a hash, dealing with duplicates as you go, and then you've got a hash you can sort or fix or what-have-you.

Problems will be there, of course; and I'll document that next entry.