Run results for: lodash xor alternatives Copy 2

Run details:

User agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10_15_7) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/97.0.4692.71 Safari/537.36

Browser: Chrome 97

Operating system: Mac OS X 10.15.7

Device Platform: Desktop

Date tested: 2 years ago

Test name	Executions per second
current xor implementation	2890.4 Ops/sec
alternative with Sets	2268.8 Ops/sec

HTML Preparation code:


<script src='https://cdnjs.cloudflare.com/ajax/libs/lodash.js/4.17.5/lodash.min.js'></script>

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,b)
alternative with Sets
function xor(...arrs) { const filterSet = (set, predicate) => { const newSet = new Set(set); for (const item of set) { if (!predicate(item)) { newSet.delete(item); } } return newSet; }; const xorValues = arrs .reduce((current, next) => { const newSet = new Set(); const nextSet = new Set(next); for (const item of filterSet(current, (value) => !nextSet.has(value))) { newSet.add(item); } for (const item of filterSet(nextSet, (value) => !current.has(value))) { newSet.add(item); } return newSet; }, new Set()); return Array.from(xorValues); } const res = xor(a,b)

Run results for: lodash xor alternatives Copy 2

.

current xor implementation

alternative with Sets