Beefy Boxes and Bandwidth Generously Provided by pair Networks
Welcome to the Monastery
 
PerlMonks  

(code) neither clever nor useful array vs. hash example

by ybiC (Prior)
on Jul 02, 2000 at 01:10 UTC ( #20769=snippet: print w/ replies, xml ) Need Help??

Description: My background isn't programming, so to most Monks this snippet is likely incredibly rudimentary. Nonetheless, after ~2 years dabbling with Perl (mostly regex logfile analysis and non-DB, HTML-generating-CGI), I was recently forced to actually learn how to implement arrays and hashes in a script. Here's how I got my brain to begin grasping them:
 
p.s. I think the Debian stable version of Perl (5.00404) is keeping me from doing insertion order retrieval.

Update: added Tie::IxHash for insertion-order retrieval Jan 3, 2001

#!/usr/bin/perl -w

# notclever.pl
# Rudimentary examples of array, hash, tied hash
# Updated using Komodo beta 1.0.0 build 12686 on Win2k
# Tested: Perl 5.00503 on Debian
#         ActivePerl 5.006 on Win2k

use strict;
use Tie::IxHash;


print "\nPASSEL O' PRINTS";
print "\n 1 script        : $0";
print "\n 2 executable    : $^X $]";
print "\n 3 host OS       : $^O";
print "\n 4 start time    : $^T";
print "\n";



print "\nARRAY+FOREACH";
my @varlist = (
    "\n 1 script        : $0",
    "\n 2 executable    : $^X $]",
    "\n 3 host OS       : $^O",
    "\n 4 start time    : $^T",
    );
foreach (@varlist) {
    print;
    }
print "\n";



print "\nHASH+WHILE";
my %varhash = (
    ' 1 script'     =>  "$0" ,
    ' 2 executable' =>  "$^X $]" ,
    ' 3 hostOS'     =>  "$^O" ,
    ' 4 starttime'  =>  "$^T" ,
    );
while((my $key, my $value) = each(%varhash)) {
    print "\n", $key, " is ", $value;
    }
print "\n";



print "\nTIED HASH+FOR";
tie my %tiedhash, "Tie::IxHash";
%tiedhash = (
    ' script'     =>  "$0" ,
    ' executable' =>  "$^X $]" ,
    ' hostOS'     =>  "$^O" ,
    ' starttime'  =>  "$^T" ,
    );
for my $key (keys %tiedhash) {
    print "\n", $key, " is ", $tiedhash{$key};
    }
print "\n";
Comment on (code) neither clever nor useful array vs. hash example
Download Code
RE: neither clever nor useful array vs. hash example
by ZZamboni (Curate) on Jul 03, 2000 at 18:50 UTC
    It's not the version of perl that keeps you from doing retrieval in the order of insertion. Hashes are that way by nature. There is no guarantee of the order in which the elements will come out when you use keys or each.

    --ZZamboni

      On an aside, you can look at japhy's YAPC 19100 talk on making a ordered hash. No real revelations, but is pretty interesting and the technique is useful. It is here.

      Cheers,
      KM

      Thanks for taking time to comment, ZZamboni. I really should have phrased my "p.s." something like :

      p.s. I played a bit with a module that facilitates Hash insertion order retrieval, but couldn't make it work. Wish I could remember the module - stumbled across it somewhere in O'Reilly Perl CD Bookshelf.

      It's as likely or more that I had bad syntax than a down-level Perl incompatibility. Is nothing important to me at the moment. By the time I expect to pick it back up, hope to be on Debian 2.2 with a newer $^X$]

Back to Snippets Section

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: snippet [id://20769]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others drinking their drinks and smoking their pipes about the Monastery: (11)
As of 2014-09-02 20:10 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    My favorite cookbook is:










    Results (29 votes), past polls