* Orton, Yves [EMAIL PROTECTED] [2004-05-05 14:18]:
Normally you would do a proof on something like this. And you
would work through the code and ensure that it actually does
what the proof says it must.
Think about it, any other approach would require an infinite
number of tests.
Or at
The following was supposedly scribed by
Richard Clamp
on Thursday 06 May 2004 02:44 am:
I already took a stab at solving it:
http://search.cpan.org/dist/File-Slurp-Tree/lib/File/Slurp/Tree.pm
In the event that it hasn't been solved, suggestions on the name and
interface
are just as
On May 6, 2004, at 12:00 AM, Eric Wilhelm wrote:
Hi,
I'm looking for a module which would operate similar to the following
example.
If anyone has suggestions or feedback, I'd like to hear them. (I'd
really
like to here it's already been solved.)
Maybe take a look at Tie::TextDir? It does
