nl_tokens: / * 197
pl_tokens: function ( module , exports , __webpack_require__ ) { var _containsWith = /*#__PURE__*/ __webpack_require__ ( 32 ) ; var _curry3 = /*#__PURE__*/ __webpack_require__ ( 4 ) ; /**
  	 * Finds the set (i.e. no duplicates) of all elements in the first list not
  	 * contained in the second list. Duplication is determined according to the
  	 * value returned by applying the supplied predicate to two list elements.
  	 *
  	 * @func
  	 * @memberOf R
  	 * @since v0.1.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` that are not in `list2`.
  	 * @see R.difference, R.symmetricDifference, R.symmetricDifferenceWith
  	 * @example
  	 *
  	 *      var cmp = (x, y) => x.a === y.a;
  	 *      var l1 = [{a: 1}, {a: 2}, {a: 3}];
  	 *      var l2 = [{a: 3}, {a: 4}];
  	 *      R.differenceWith(cmp, l1, l2); //=> [{a: 1}, {a: 2}]
  	 */ var differenceWith = /*#__PURE__*/ _curry3 ( function differenceWith ( pred , first , second ) { var out = [ ] ; var idx = 0 ; var firstLen = first . <mask> ; while ( idx < firstLen ) { if ( ! _containsWith ( pred , first [ idx ] , second ) && ! _containsWith ( pred , first [ idx ] , out ) ) { out . push ( first [ idx ] ) ; } idx += 1 ; } return out ; } ) ; module . exports = differenceWith ; /***/ }