Anyone can create a comparator for Test::Deep that lives outside of
the module itself. There are a small number of methods that need to be
implemented but it has never been documented. I always thought I would
get around to improving the diagnostic reporting before publishing the
API but _I_ certai
If it's going to go in Test::Deep, could it go in a submodule, named
something like like Test::Deep::Fuzzy ? I'm worried that I'll be on an
old machine with broken Unicode libraries and won't be able to install
a module that depends on Test::Deep. Many modules uses Test::Deep to
test themselves, an
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 data structures.
Let's say I have an AoA like
--- On Thu, 17/2/11, David Golden wrote:
> So I think you've got to nail down what specifically about
> the order
> is required, then sort in a way that preserves that
> important
> dimension (country), but standardizes the rest (e.g. always
> putting
> 'hotel' after 'city'). Then you're just w
On Thu, Feb 17, 2011 at 9:09 AM, Ovid 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 "Xander" and
> you migh
--- On Thu, 17/2/11, David Golden wrote:
> From: David Golden
> 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 th
On Thu, Feb 17, 2011 at 3:52 AM, Ovid 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
> order of 6,5,4,3,2,1, the
* Ovid [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 feeling really fruity),
>
--- On Thu, 17/2/11, Fergal Daly wrote:
> From: Fergal Daly
> 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
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 feeling really fruity),
F
2011/2/17 Ovid :
> --- On Thu, 17/2/11, Ovi
--- On Thu, 17/2/11, Ovid wrote:
> From: Ovid
> 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 fo
(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 data
12 matches
Mail list logo
