Beefy Boxes and Bandwidth Generously Provided by pair Networks
XP is just a number
 
PerlMonks  

Re^2: Fast seeking in a large array of hashes to generate a report.

by jbrugger (Parson)
on Jun 23, 2005 at 08:54 UTC ( [id://469322]=note: print w/replies, xml ) Need Help??


in reply to Re: Fast seeking in a large array of hashes to generate a report.
in thread Fast seeking in a large array of hashes to generate a report.

Correct, but this only works for the "eq" operator, not for a regexp (i tried).
update i'll try it, i did not know about Tie::Hash::Regex. i'll let you know the result.

"We all agree on the necessity of compromise. We just can't agree on when it's necessary to compromise." - Larry Wall.
  • Comment on Re^2: Fast seeking in a large array of hashes to generate a report.

Replies are listed 'Best First'.
Re^3: Fast seeking in a large array of hashes to generate a report.
by robartes (Priest) on Jun 23, 2005 at 09:09 UTC

    Have you looked at Tie::Hash::Regex -- that allows you to look for hash keys with a regular expression. I have no idea as to the performance impact of this though, so you'll have to benchmark it.

    CU
    Robartes-

Log In?
Username:
Password:

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

How do I use this?Last hourOther CB clients
Other Users?
Others studying the Monastery: (None)
    As of 2024-04-25 00:12 GMT
    Sections?
    Information?
    Find Nodes?
    Leftovers?
      Voting Booth?

      No recent polls found