-
-
Notifications
You must be signed in to change notification settings - Fork 115
/
update.js
257 lines (224 loc) · 5.73 KB
/
update.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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
/**
* Baobab Update
* ==============
*
* The tree's update scheme.
*/
import type from './type';
import {
freeze,
deepFreeze,
deepMerge,
makeError,
shallowClone,
shallowMerge,
splice
} from './helpers';
function err(operation, expectedTarget, path) {
return makeError(
`Baobab.update: cannot apply the "${operation}" on ` +
`a non ${expectedTarget} (path: /${path.join('/')}).`,
{path}
);
}
const tr = true;
const arrayMethods = {push: tr, unshift: tr, concat: tr, splice: tr, pop: tr, shift: tr};
const objectMethods = {merge: tr, deepMerge: tr};
/**
* Function aiming at applying a single update operation on the given tree's
* data.
*
* @param {mixed} data - The tree's data.
* @param {path} path - Path of the update.
* @param {object} operation - The operation to apply.
* @param {object} [opts] - Optional options.
* @return {mixed} - Both the new tree's data and the updated node.
*/
export default function update(data, path, operation, opts = {}) {
const {type: operationType, value, options: operationOptions = {}} = operation;
// Dummy root, so we can shift and alter the root
const dummy = {root: data},
dummyPath = ['root', ...path];
// Walking the path
let p = dummy,
s;
const l = dummyPath.length;
for (let i = 0; i < l; i++) {
// Current item's reference is therefore p[s]
// The reason why we don't create a variable here for convenience
// is because we actually need to mutate the reference.
s = dummyPath[i];
// If we reached the end of the path, we apply the operation
if (i === l - 1) {
if (operationType in arrayMethods && !type.array(p[s])) {
throw err(
operationType,
'array',
path
);
}
if (operationType in objectMethods && !type.object(p[s])) {
throw err(
operationType,
'object',
path
);
}
/**
* Set
*/
if (operationType === 'set') {
// Purity check
if (opts.pure && p[s] === value)
return {node: p[s]};
if (type.lazyGetter(p, s)) {
Object.defineProperty(p, s, {
value,
enumerable: true,
configurable: true
});
}
else if (opts.persistent && !operationOptions.mutableLeaf) {
p[s] = shallowClone(value);
}
else {
p[s] = value;
}
}
/**
* Monkey
*/
else if (operationType === 'monkey') {
Object.defineProperty(p, s, {
get: value,
enumerable: true,
configurable: true
});
}
/**
* Apply
*/
else if (operationType === 'apply') {
const result = value(p[s]);
// Purity check
if (opts.pure && p[s] === result)
return {node: p[s]};
if (type.lazyGetter(p, s)) {
Object.defineProperty(p, s, {
value: result,
enumerable: true,
configurable: true
});
}
else if (opts.persistent) {
p[s] = shallowClone(result);
}
else {
p[s] = result;
}
}
/**
* Push
*/
else if (operationType === 'push') {
if (opts.persistent)
p[s] = p[s].concat([value]);
else
p[s].push(value);
}
/**
* Unshift
*/
else if (operationType === 'unshift') {
if (opts.persistent)
p[s] = [value].concat(p[s]);
else
p[s].unshift(value);
}
/**
* Concat
*/
else if (operationType === 'concat') {
if (opts.persistent)
p[s] = p[s].concat(value);
else
p[s].push.apply(p[s], value);
}
/**
* Splice
*/
else if (operationType === 'splice') {
if (opts.persistent)
p[s] = splice.apply(null, [p[s]].concat(value));
else
p[s].splice.apply(p[s], value);
}
/**
* Pop
*/
else if (operationType === 'pop') {
if (opts.persistent)
p[s] = splice(p[s], -1, 1);
else
p[s].pop();
}
/**
* Shift
*/
else if (operationType === 'shift') {
if (opts.persistent)
p[s] = splice(p[s], 0, 1);
else
p[s].shift();
}
/**
* Unset
*/
else if (operationType === 'unset') {
if (type.object(p))
delete p[s];
else if (type.array(p))
p.splice(s, 1);
}
/**
* Merge
*/
else if (operationType === 'merge') {
if (opts.persistent)
p[s] = shallowMerge({}, p[s], value);
else
p[s] = shallowMerge(p[s], value);
}
/**
* Deep merge
*/
else if (operationType === 'deepMerge') {
if (opts.persistent)
p[s] = deepMerge({}, p[s], value);
else
p[s] = deepMerge(p[s], value);
}
// Deep freezing the resulting value
if (opts.immutable && !operationOptions.mutableLeaf)
deepFreeze(p);
break;
}
// If we reached a leaf, we override by setting an empty object
else if (type.primitive(p[s])) {
p[s] = {};
}
// Else, we shift the reference and continue the path
else if (opts.persistent) {
p[s] = shallowClone(p[s]);
}
// Should we freeze the current step before continuing?
if (opts.immutable && l > 0)
freeze(p);
p = p[s];
}
// If we are updating a dynamic node, we need not return the affected node
if (type.lazyGetter(p, s))
return {data: dummy.root};
// Returning new data object
return {data: dummy.root, node: p[s]};
}