Be warned of the massive performance hit. It replaces an O(1) lookup with than O(N) lookup. That's not good, but it's not so bad ...except that this is likely used in another another loop. Then that O(N) or O(N^2) loop because O(N^2) or O(N^3), and things start to crawl.
In reply to Re^3: Case insensitive hash key existance
by ikegami
in thread Case insensitive hash key existance
by merrymonk
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |