33 lines
1.2 KiB
JavaScript
33 lines
1.2 KiB
JavaScript
|
import _curry3 from "./internal/_curry3.js";
|
||
|
|
import concat from "./concat.js";
|
||
|
|
import differenceWith from "./differenceWith.js";
|
||
|
|
/**
|
||
|
|
* Finds the set (i.e. no duplicates) of all elements contained in the first or
|
||
|
|
* second list, but not both. Duplication is determined according to the value
|
||
|
|
* returned by applying the supplied predicate to two list elements.
|
||
|
|
*
|
||
|
|
* @func
|
||
|
|
* @memberOf R
|
||
|
|
* @since v0.19.0
|
||
|
|
* @category Relation
|
||
|
|
* @sig ((a, a) -> Boolean) -> [a] -> [a] -> [a]
|
||
|
|
* @param {Function} pred A predicate used to test whether two items are equal.
|
||
|
|
* @param {Array} list1 The first list.
|
||
|
|
* @param {Array} list2 The second list.
|
||
|
|
* @return {Array} The elements in `list1` or `list2`, but not both.
|
||
|
|
* @see R.symmetricDifference, R.difference, R.differenceWith
|
||
|
|
* @example
|
||
|
|
*
|
||
|
|
* const eqA = R.eqBy(R.prop('a'));
|
||
|
|
* const l1 = [{a: 1}, {a: 2}, {a: 3}, {a: 4}];
|
||
|
|
* const l2 = [{a: 3}, {a: 4}, {a: 5}, {a: 6}];
|
||
|
|
* R.symmetricDifferenceWith(eqA, l1, l2); //=> [{a: 1}, {a: 2}, {a: 5}, {a: 6}]
|
||
|
|
*/
|
||
|
|
|
||
|
|
var symmetricDifferenceWith =
|
||
|
|
/*#__PURE__*/
|
||
|
|
_curry3(function symmetricDifferenceWith(pred, list1, list2) {
|
||
|
|
return concat(differenceWith(pred, list1, list2), differenceWith(pred, list2, list1));
|
||
|
|
});
|
||
|
|
|
||
|
|
export default symmetricDifferenceWith;
|