Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask
 
PerlMonks  

RE: (2) neither clever nor useful array vs. hash example (insertion order retrieval?)

by ybiC (Prior)
on Jul 05, 2000 at 07:00 UTC ( #21075=note: print w/ replies, xml ) Need Help??


in reply to RE: neither clever nor useful array vs. hash example
in thread (code) neither clever nor useful array vs. hash example

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$]


Comment on RE: (2) neither clever nor useful array vs. hash example (insertion order retrieval?)
Replies are listed 'Best First'.
RE: RE: RE: neither clever nor useful array vs. hash example
by ZZamboni (Curate) on Jul 05, 2000 at 18:22 UTC
      "Maybe Tie::IxHash?"

      Yep, that's it - thanks for the link, ZZamboni! README says it "requires: Perl Version 5.003 or later", which shoots down my off-the-cuff guess of version compatibility problem. When I get a chance, will spend a bit more time getting syntax right.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://21075]
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: (12)
As of 2015-07-31 06:42 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (274 votes), past polls