You've just asked two desperate-looking performance-related questions in quick succession, so I feel obliged to point out (as described in detail at On Code Optimization) that you are taking the wrong (and depressingly common) approach.
Before asking for advice, please provide us with some background on why performance matters for your problem ... then further clarify by presenting us with a benchmark program that we can run (for a simple example, using Perl's core Benchmark module, see Fastest way to lookup a point in a set).
In other words, "Don’t Optimize Code -- Benchmark It" (Damian Conway).
In reply to Re: 32bit/64bit hash function: Use perls internal hash function?
by eyepopslikeamosquito
in thread 32bit/64bit hash function: Use perls internal hash function?
by sectokia
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |