mapContaining and setContaining asymmetric matchers
This commit is contained in:
39
src/core/asymmetric_equality/SetContaining.js
Normal file
39
src/core/asymmetric_equality/SetContaining.js
Normal file
@@ -0,0 +1,39 @@
|
||||
getJasmineRequireObj().SetContaining = function(j$) {
|
||||
function SetContaining(sample) {
|
||||
if (!j$.isSet(sample)) {
|
||||
throw new Error('You must provide a set to `setContaining`, not ' + j$.pp(sample));
|
||||
}
|
||||
|
||||
this.sample = sample;
|
||||
}
|
||||
|
||||
SetContaining.prototype.asymmetricMatch = function(other, customTesters) {
|
||||
if (!j$.isSet(other)) return false;
|
||||
|
||||
var hasAllMatches = true;
|
||||
j$.util.forEachBreakable(this.sample, function(breakLoop, item) {
|
||||
// for each item in `sample` there should be at least one matching item in `other`
|
||||
// (not using `j$.matchersUtil.contains` because it compares set members by reference,
|
||||
// not by deep value equality)
|
||||
var hasMatch = false;
|
||||
j$.util.forEachBreakable(other, function(oBreakLoop, oItem) {
|
||||
if (j$.matchersUtil.equals(oItem, item, customTesters)) {
|
||||
hasMatch = true;
|
||||
oBreakLoop();
|
||||
}
|
||||
});
|
||||
if (!hasMatch) {
|
||||
hasAllMatches = false;
|
||||
breakLoop();
|
||||
}
|
||||
});
|
||||
|
||||
return hasAllMatches;
|
||||
};
|
||||
|
||||
SetContaining.prototype.jasmineToString = function() {
|
||||
return '<jasmine.setContaining(' + j$.pp(this.sample) + ')>';
|
||||
};
|
||||
|
||||
return SetContaining;
|
||||
};
|
||||
Reference in New Issue
Block a user