Run results for: lodash xor alternatives

Run details:

User agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 11_2_1) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/88.0.4324.150 Safari/537.36

Browser: Chrome 88

Operating system: Mac OS X 11.2.1

Device Platform: Desktop

Date tested: 2 years ago

Test name	Executions per second
current xor implementation	1441.7 Ops/sec
alternative with Sets	5943.8 Ops/sec

Script Preparation code:

function dec2hex (dec) {
  return dec < 10
    ? '0' + String(dec)
    : dec.toString(16)
}

function generateId (len) {
  var arr = new Uint8Array((len || 40) / 2)
  window.crypto.getRandomValues(arr)
  return Array.from(arr, dec2hex).join('')
}

var a = []
var b = []
for( let i = 0; i < 1000; i++)
{
  a[i] = generateId(16)
  b[i] = generateId(16)
}

Tests:

current xor implementation
const res = _.xor(a, _.xor(a,b))
alternative with Sets
var as = new Set(a) var bs = new Set(b) const res = a .filter((row_id) => bs.has(row_id)) .concat(b.filter((row_id) => !as.has(row_id)))

Run results for: lodash xor alternatives

Searching for faster solution for _.xor(a, _.xor(a,b))

current xor implementation

alternative with Sets