forked from ramda/ramda
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmergeWithKey.js
61 lines (47 loc) · 1.79 KB
/
mergeWithKey.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
var assert = require('assert');
var R = require('../source/index.js');
var eq = require('./shared/eq.js');
describe('mergeWithKey', function() {
function last(k, x, y) { return y; }
it('takes two objects, merges their own properties and returns a new object', function() {
var a = {w: 1, x: 2};
var b = {y: 3, z: 4};
eq(R.mergeWithKey(last, a, b), {w: 1, x: 2, y: 3, z: 4});
});
it('applies the provided function to the key, the value from the first object' +
' and the value from the second object to determine the value for keys that' +
' exist in both objects', function() {
var a = {a: 'b', x: 'd'};
var b = {a: 'c', y: 'e'};
var c = R.mergeWithKey(function(k, a, b) { return k + a + b; }, a, b);
eq(c, {a: 'abc', x: 'd', y: 'e'});
});
it('is not destructive', function() {
var a = {w: 1, x: 2};
var res = R.mergeWithKey(last, a, {x: 5});
assert.notStrictEqual(a, res);
eq(res, {w: 1, x: 5});
});
it('reports only own properties', function() {
var a = {w: 1, x: 2};
function Cla() {}
Cla.prototype.x = 5;
eq(R.mergeWithKey(last, new Cla(), a), {w: 1, x: 2});
eq(R.mergeWithKey(last, a, new Cla()), {w: 1, x: 2});
});
describe('acts as if nil values are simply empty objects', function() {
var a = {a: 'b', x: 'd'};
var b = {a: 'c', y: 'e'};
const combine = function(k, a, b) { return k + a + b; };
eq(R.mergeWithKey(combine, a, b), {a: 'abc', x: 'd', y: 'e'});
it('... if the first object is nil', function() {
eq(R.mergeWithKey(combine, null, b), b);
});
it('... if the second object is nil', function() {
eq(R.mergeWithKey(combine, a, undefined), a);
});
it('... if both objects are nil', function() {
eq(R.mergeWithKey(combine, null, undefined), {});
});
});
});