Merge Array of Objects by Property using Lodash
_.unionBy():
This method is like _.union except that it accepts iteratee which is invoked for each element of each arrays to generate the criterion by which uniqueness is computed. Result values are chosen from the first array in which the value occurs.
var original = [ { label: 'private', value: 'private@johndoe.com' }, { label: 'work', value: 'work@johndoe.com' }];var update = [ { label: 'private', value: 'me@johndoe.com' }, { label: 'school', value: 'schol@johndoe.com' }];var result = _.unionBy(update, original, "label");console.log(result);<script src="https://cdnjs.cloudflare.com/ajax/libs/lodash.js/4.15.0/lodash.min.js"></script>
Convert the lists to objects keyed by label, merge them by _.assign, and convert it back to an array. It will even retain order of the items on most browsers.
var original = [ { label: 'private', value: 'private@johndoe.com' }, { label: 'work', value: 'work@johndoe.com' }];var update = [ { label: 'private', value: 'me@johndoe.com' }, { label: 'school', value: 'schol@johndoe.com' }];console.log( _.map( _.assign( _.mapKeys(original, v => v.label), _.mapKeys(update, v => v.label) ) ));// or remove more duplicated code using spreadconsole.log( _.map( _.assign( ...[original, update].map( coll => _.mapKeys(coll, v => v.label) ) ) ));<script src="https://cdnjs.cloudflare.com/ajax/libs/lodash.js/4.15.0/lodash.js"></script>
Perhaps a bit late, but all the solutions I have seen don't join both arrays correctly, they use one of the arrays to loop on and any excess elements in the second array don't get added (assuming this is what is required).
The right way is to sort both arrays and move forward within both arrays, merging the matches elements and adding the missing elements from both arrays.Please find full solution below. This also takes O(n+m) which is the best you can get (without the computational costs for sort itself). In my code I already got the data sorted from the database.
function mergeObjectsBasedOnKey(array1, array2, compareFn, mergeFn, alreadySorted) { var array1Index = 0; var array2Index = 0; const merged = []; if (!alreadySorted) { array1.sort(compareFn); array2.sort(compareFn); } while (array1Index < array1.length && array2Index < array2.length) { var comparedValue = compareFn(array1[array1Index], array2[array2Index]); if (comparedValue === 0) { merged.push(mergeFn(array1[array1Index], array2[array2Index])); array1Index++; array2Index++; } else if (comparedValue < 0) { merged.push(mergeFn(array1[array1Index])); array1Index++; } else { merged.push(mergeFn(array2[array2Index])); array2Index++; } } while (array1Index < array1.length) { merged.push(mergeFn(array1[array1Index])); array1Index++; } while (array2Index < array2.length) { merged.push(mergeFn(array2[array2Index])); array2Index++; } return merged;}const array1 = [{ "id": 10, isArray1: true }, { "id": 11, isArray1: true }, { "id": 12, isArray1: true },];const array2 = [{ "id": 8, isArray2: true }, { "id": 11, isArray2: true }, { "id": 15, isArray2: true },];const result = mergeObjectsBasedOnKey(array1, array2, function(a, b) { return a.id - b.id;}, function(a, b) { if (b) { return _.merge(a, b); } return _.merge(a, { isArray1: true, isArray2: true });});console.log(result);<script src="https://cdnjs.cloudflare.com/ajax/libs/lodash.js/4.17.4/lodash.min.js"></script>And the results would be:
[ { id: 8, isArray2: true, isArray1: true }, { id: 10, isArray1: true, isArray2: true }, { id: 11, isArray1: true, isArray2: true }, { id: 12, isArray1: true, isArray2: true }, { id: 15, isArray2: true, isArray1: true } ]