Beefy Boxes and Bandwidth Generously Provided by pair Networks
Keep It Simple, Stupid

Re: compare two hashes inefficiently.

by OfficeLinebacker (Chaplain)
on Jan 11, 2007 at 13:21 UTC ( #594144=note: print w/replies, xml ) Need Help??

in reply to compare two hashes inefficiently.

Hmm, I think I will find this useful in a specific program I wrote, but it turns out my algorithm isn't quite right. Thanks. ++

I like computer programming because it's like Legos for the mind.

Replies are listed 'Best First'.
Re^2: compare two hashes inefficiently.
by deprecated (Priest) on Feb 10, 2007 at 10:50 UTC
    Hi, please don't use this code. I wrote it ages and ages ago. The above replies were correct in that there are better ways to do this. Upon thinking back to when I wrote some of the code I've posted to perlmonks, I realize that I had a lot more perl knowledge than I had common sense. In this case, I had a solution for the problem ahead of me, but I didn't understand that I was solving the wrong problem. This may be one of the most important things I've learned over the years; I'm sure somebody here (or even myself) could help you come up with a better, and certainly more elegant, solution to the problem you're trying to solve with the above hack(s).


    Tilly is my hero.

      That's OK. I don't even remember what I was talking about in my post. I think I was also writing a file comparison routine (basically handrolling my own stripped-down rsync). Since then I discovered FreezeThaw, which has worked very nicely for me for hash comparisons.

      I like computer programming because it's like Legos for the mind.

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others about the Monastery: (4)
As of 2023-06-10 04:48 GMT
Find Nodes?
    Voting Booth?
    How often do you go to conferences?

    Results (36 votes). Check out past polls.