| [reply] |
I think doing approximate string matches for hash keys in
objects would be the programmer's equivalent to playing Russian
Roulette. Bad idea. | [reply] |
Well, if there is an exact match, it's no roulette. There are quite simple techniques to verify a hash key actually exists. In fact, like janx noted above, there's Tie::Hash::Approx by our very own OeufMayo which does pretty much just that :)
Tie::Hash::Approx - Approximative match of hash keys using String::Approx
Greetz
Beatnik
... Quidquid perl dictum sit, altum viditur.
| [reply] |
| [reply] |
Evil? Me? Surely you're thinking of someone else :)
Is this the talk you mean?
--
<http://www.dave.org.uk>
"The first rule of Perl club is you do not talk about
Perl club." -- Chip Salzenberg
| [reply] |
/me attended both talks you did in Amsterdam in 2.00.1 and didn't notice anything evail about it :)
Greetz
Beatnik
... Quidquid perl dictum sit, altum viditur.
| [reply] |
Precisely! I enjoyed it immensely. Especially after I found out about Tie::Hash::Cannabinol - a CPAN module I would enjoy finding a serious use for. I've been close to using it in production, but lacked the courage. I'm still working on it though :)
| [reply] |