I suppose that should be fast/efficient if done in boolean context.
Short answer: yes. Long answer: What is the most efficient way to see if a hash is empty?
In reply to Re^3: lazy creation of a hash
by moritz
in thread lazy creation of a hash
by John M. Dlugosz
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |