I was just having a very similar conversation with someone in the office about those possibilities. Didn't manage to come to any firm conclusions tho' :(
One thing we did think of - you could implement the delete function in such a way that it deleted every key that matched the regex (still some problems there tho' - what if the exact key of one element is also part of another key and would therefore match the regex?)
--
"Perl makes the fun jobs fun
and the boring jobs bearable" - me
In reply to Re: Re: Tie::Hash::Regex
by davorg
in thread Tie::Hash::Regex
by davorg
| For: | Use: | ||
| & | & | ||
| < | < | ||
| > | > | ||
| [ | [ | ||
| ] | ] |