| commit | 03c582f1a47efe8215737db8cc02f392590f7cac | [log] [tgz] |
|---|---|---|
| author | Nate Bosch <nbosch1@gmail.com> | Wed Apr 11 13:53:01 2018 -0700 |
| committer | GitHub <noreply@github.com> | Wed Apr 11 13:53:01 2018 -0700 |
| tree | 34eb59bfe452c980dac669cb3f061e18b6bb0d0e | |
| parent | 3b2755e45a7c79d59dabc29d5ae0a6f7b9b533c9 [diff] |
Fix unorderedMatches for poorly ordered input (#74) Fixes #73 Reimplements the unordered matcher using a recursive search assuming that matchers can match multiple values in the input rather than a greedy algorithm which allows a matcher to "consume" a value that is needed for some other matcher. User visible differences: - May match inputs that would have previously been (incorrectly) rejected. - The failure description may include a number of unmatched expectations if more than 1 is unmatched.
Support for specifying test expectations, such as for unit tests.
The matcher library provides a third-generation assertion mechanism, drawing inspiration from Hamcrest.
For more information, see Unit Testing with Dart.