Changes:
0.096
%WrapCache was keeping references to external data. It's now local()ised at the start of a comparison just like the other caches (why I didn't do that when I added it, I don't know). Thanks to Matthijs Bomhoff for reporting the problem.
0.095
Docs and code didn't match, useclass was actually requireclass, available as
both now
0.094
Changed Set and Bag to no longer issue warnings when undefs are
present. Needed to make the sort and the diagnotics
undef-aware. Thanks to Colin Kuskie for pointing this out.
Added tests for this.
0.093
Fixed inifinte recursion when adding comparators into bags. That whole area is unpleasant - conceptually as well as implementation-wise. Comparators no longer inherit a compare method, so we only call the specialised compare if it exists, otherwise we just do normal deep comparison.
Removed a debugging print.
developer is officially maintaining the package.
The rationale for changing this from "tech-pkg" to "pkgsrc-users" is
that it implies that any user can try to maintain the package (by
submitting patches to the mailing list). Since the folks most likely
to care about the package are the folks that want to use it or are
already using it, this would leverage the energy of users who aren't
developers.
Test::Deep gives you very flexible ways to check that the result
you got is the result you were expecting. At its simplest it compares
two structures by going through each level, ensuring that the values
match, that arrays and hashes have the same elements and that
references are blessed into the correct class. It also handles
circular data structures without getting caught in an infinite
loop.
Where it becomes more interesting is in allowing you to do something
besides simple exact comparisons. With strings, the = operator
checks that 2 strings are exactly equal but sometimes that's not
what you want. When you don't know exactly what the string should
be but you do know some things about how it should look, = is no
good and you must use pattern matching instead. Test::Deep provides
pattern matching for complex data structures.
