Is there a case for saying that a hash in a scalar context should do the simplest (or rather, quickest) operation possible to determine if it is empty or not? There could always be a builtin to return these stats if you really wanted them.
This is, after all, a very common operaion quite often used within a tight loop.
In reply to Re^2: Benchmark of hash emptiness test
by aufflick
in thread Benchmark of hash emptiness test
by andreas1234567
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |