123456789101112131415161718192021222324252627282930313233343536373839404142434445464748
var R = require('../source');var eq = require('./shared/eq');

describe('symmetricDifference', function() {  var M = [1, 2, 3, 4];  var M2 = [1, 2, 3, 4, 1, 2, 3, 4];  var N = [3, 4, 5, 6];  var N2 = [3, 3, 4, 4, 5, 5, 6, 6];  var Z = [3, 4, 5, 6, 10];  var Z2 = [1, 2, 3, 3, 4, 4, 5, 5, 6, 6, 7, 8];
  it('finds the set of all elements in the first or second list but not both', function() {    eq(R.symmetricDifference(M, N), [1, 2, 5, 6]);  });
  it('does not allow duplicates in the output even if the input lists had duplicates', function() {    eq(R.symmetricDifference(M2, N2), [1, 2, 5, 6]);  });
  it('has R.equals semantics', function() {    function Just(x) { this.value = x; }    Just.prototype.equals = function(x) {      return x instanceof Just && R.equals(x.value, this.value);    };
    eq(R.symmetricDifference([0], [-0]).length, 2);    eq(R.symmetricDifference([-0], [0]).length, 2);    eq(R.symmetricDifference([NaN], [NaN]).length, 0);    eq(R.symmetricDifference([new Just([42])], [new Just([42])]).length, 0);  });
  it('works for arrays of different lengths', function() {    eq(R.symmetricDifference(Z, Z2), [10, 1, 2, 7, 8]);    eq(R.symmetricDifference(Z2, Z), [1, 2, 7, 8, 10]);  });
  it('will not create a "sparse" array', function() {    eq(R.symmetricDifference(M2, [3]).length, 3);  });
  it('returns an empty array if there are no different elements', function() {    eq(R.symmetricDifference(M2, M), []);    eq(R.symmetricDifference(M, M2), []);  });
});