(Now sent from the correct email address)
I've stumbled on a bit of an odd case where I have constantly shifting data I
need to test. Ordinarily I would use cmp_deeply from Test::Deep, but it's not
quite structured enough. I need something similar to a Levenshtein edit
distance for complex
--- On Thu, 17/2/11, Ovid publiustemp-perl...@yahoo.com wrote:
From: Ovid publiustemp-perl...@yahoo.com
I've stumbled on a bit of an odd case where I have
constantly shifting data I need to test. Ordinarily I would
use cmp_deeply from Test::Deep, but it's not quite
structured enough. I need
--- On Thu, 17/2/11, Fergal Daly fer...@esatclear.ie wrote:
From: Fergal Daly fer...@esatclear.ie
It would be nice if this was a custom
comparator for Test::Deep, then
you would be apply the almost to lists of arbitrarily
complex items
and also conduct that test at any level of the data
* Ovid publiustemp-perl...@yahoo.com [2011-02-17T07:43:16]
It would be nice if this was a custom comparator for Test::Deep, then you
would be apply the almost to lists of arbitrarily complex items and also
conduct that test at any level of the data structure (including nesting if
you
On Thu, Feb 17, 2011 at 3:52 AM, Ovid publiustemp-perl...@yahoo.com wrote:
It's OK if I get back that data structure, but the 2 and 4 records are
swapped or maybe the 5 isn't present. However, for any contained array
reference its exact data can't change. However, if those came back in the
--- On Thu, 17/2/11, David Golden xda...@gmail.com wrote:
From: David Golden xda...@gmail.com
wrote:
It's OK if I get back that data structure, but the 2
and 4 records are swapped or maybe the 5 isn't present.
However, for any contained array reference its exact data
can't change.
On Thu, Feb 17, 2011 at 9:09 AM, Ovid publiustemp-perl...@yahoo.com wrote:
For a *very* contrived use case, imagine that you're being introduced to your
daughter's boyfriend for the first time and you know his name is Alexander.
He might introduce himself as Alexander, Alex, Al, or even
