-
Notifications
You must be signed in to change notification settings - Fork 0
/
simmut.js
406 lines (371 loc) · 10.1 KB
/
simmut.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
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
const EventEmitter = require("events");
// Generic get. Given a model and a path, retrieve what's in the path
// If the model contains a get function, we use that one
const get = (model, path) => {
if (model && model.get) {
return model.get(path);
}
if (!path) {
return model;
}
let iter = model;
const parts = path.split(".");
for (let i = 0; iter && i < parts.length; i++) {
const part = parts[i];
iter = iter[part];
}
return iter;
};
// Creates a duplicate sharing children
const _duplicate = item => {
if (!item) {
return {};
}
if (item instanceof Array) {
return [...item];
} else {
return { ...item };
}
};
// Deep cloning
const clone = value => {
switch (typeof value) {
case "boolean":
case "number":
case "string":
case "undefined":
return value;
case "object": {
if (value === null) {
return value;
}
// If the object is frozen, we assume that it will be
// frozen all the way down
if (Object.isFrozen(value)) {
return value;
}
if (value instanceof RegExp) {
return Object.freeze(new RegExp(value));
}
if (value.buffer && value.buffer instanceof ArrayBuffer) {
throw new Error("Models cannot contain typed arrays");
}
if (value instanceof Array) {
newArray = cloneArray(value);
Object.freeze(newArray);
return newArray;
}
const keys = Object.keys(value);
const newObj = {};
for (let i = 0; i < keys.length; i++) {
key = keys[i];
newObj[key] = clone(value[key]);
}
Object.freeze(newObj);
return newObj;
}
default:
throw new Error(`Cannot clone data of type ${typeof value}`);
}
};
// We have a specialised function so that JIT can optimize the loop
// If we have a generic cloneArray function it will be polymorphic and
// therefor very slow
const cloneBooleanArray = value => {
const result = [];
const l = 0 | value.length;
for (let i = 0; i < l; i++) {
result.push(value[i]);
}
return result;
};
// This code is a copy on purpose to be able to get advantage of JIT compilation
const cloneStringArray = value => {
const result = [];
const l = 0 | value.length;
for (let i = 0; i < l; i++) {
result.push(value[i]);
}
return result;
};
const cloneNumberArray = value => {
const result = [];
const l = 0 | value.length;
for (let i = 0; i < l; i++) {
result.push(value[i]);
}
return result;
};
const cloneArray = value => {
// For speed up purposes, we will assume that all the elements of an array
// are of the same type. If this is a simple type (string,boolean,number)
// we will not clone the array, but just copy all the values.
// Please note that this implies that the library will not work properly
// with mixed arrays line [3,{foo:bar}], as it will not freeze {foo:bar}
// But we assume that this is a very unlikely event to happen and worst
// case scenario is that those particular records will not be frozen.
// By doing this optimization, we will be able to deal with very large
// geometry structures or list of strings which will be made out of flat
// arrays.
if (value.length) {
const firstElement = value[0];
switch (typeof firstElement) {
case "boolean":
return cloneBooleanArray(value);
case "number":
return cloneNumberArray(value);
case "string":
return cloneStringArray(value);
default: {
const newArray = [];
for (let i = 0; i < value.length; i++) {
newArray[i] = clone(value[i]);
}
return newArray;
}
}
} else {
return [];
}
};
const instance = data => {
let _model = {};
const _eventEmitter = new EventEmitter();
const del = path => {
let parts = path.split(".");
_model = _duplicate(_model);
let iter = _model;
for (let i = 0; iter && i < parts.length - 1; i++) {
const part = parts[i];
if (iter[part]) {
iter[part] = _duplicate(iter[part]);
}
Object.freeze(iter);
iter = iter[part];
}
if (iter) {
const lastPart = parts[parts.length - 1];
delete iter[lastPart];
}
Object.freeze(iter);
Object.freeze(_model);
_eventEmitter.emit("change");
};
const _merge = (left, right) => {
switch (typeof right) {
case "boolean":
case "number":
case "string":
case "undefined":
return right;
case "object":
if (!right) {
return right;
}
// If right is a frozen object and we do not have
// a corresponding left, we return the right object
if (Object.isFrozen(right)) {
if (!left || !(left instanceof Object)) {
return right;
}
// If both left and right are frozen and they
// refer to the same object, it means that they are
// equal so we do not have to perform any further merging
if (left === right && Object.isFrozen(left)) {
return right;
}
}
if (right instanceof RegExp) {
return Object.freeze(new RegExp(right));
}
if (right.buffer && right.buffer instanceof ArrayBuffer) {
throw new Error("Models cannot contain typed arrays");
}
if (right instanceof Array) {
let result;
if (left instanceof Array) {
result = [...left];
} else {
result = [];
}
for (let i = 0; i < right.length; i++) {
if (right[i] !== undefined) {
result[i] = clone(right[i]);
}
}
return result;
} else {
let result;
if (left && typeof left === "object" && !(left instanceof Array)) {
result = { ...left };
} else {
result = {};
}
Object.keys(right).forEach(key => {
result[key] = _merge(result[key], right[key]);
});
return result;
}
default:
throw new Error(`Cannot merge data of type ${typeof right}`);
}
};
const merge = (path, right) => {
if (path) {
const parts = path.split(".");
_model = {
..._model
};
let iter = _model;
for (let i = 0; i < parts.length - 1; i++) {
const part = parts[i];
iter[part] = _duplicate(iter[part]);
iter = iter[part];
}
const lastPart = parts[parts.length - 1];
iter[lastPart] = _merge(iter[lastPart], right);
Object.freeze(iter);
} else {
if (!right || typeof right !== "object")
throw new Error("Cannot merge an empty or a non object at top level");
_model = _merge(_model, right);
Object.freeze(_model);
}
_eventEmitter.emit("change");
};
const set = (path, value, cloneValue = true) => {
const newValue = cloneValue ? clone(value) : value;
if (!path) {
if (value && typeof value == "object") {
_model = newValue;
}
} else {
let parts = path.split(".");
_model = _duplicate(_model);
iter = _model;
for (let i = 0; i < parts.length; i++) {
const part = parts[i];
if (i < parts.length - 1) {
iter[part] = _duplicate(iter[part]);
Object.freeze(iter);
iter = iter[part];
} else {
iter[part] = newValue;
Object.freeze(iter);
}
}
}
Object.freeze(_model);
_eventEmitter.emit("change");
};
const _get = path => {
return get(_model, path);
};
const on = (...args) => _eventEmitter.on(...args);
const off = (...args) => _eventEmitter.off(...args);
set(null, data);
return {
del,
get: _get,
merge,
off,
on,
set
};
};
const proxy = ({ model, prefix }) => {
return {
del: path => model.del(`${prefix}.${path}`),
get: path => model.get(path ? `${prefix}.${path}` : prefix),
merge: (path, right) =>
model.merge(path ? `${prefix}.${path}` : prefix, right),
set: (path, value, cloneValue) =>
model.set(path ? `${prefix}.${path}` : prefix, value, cloneValue)
};
};
const layered = data => {
let _layered = null;
let _model = instance(data);
const addLayer = (path, layerData) => {
if (_layered) {
throw new Error("Cannot add layers once data is set");
}
_model.merge(path, layerData);
};
const get = (...args) => _model.get(...args);
const set = (...args) => {
if (!_layered) {
_layered = _model.get();
}
_model.set(...args);
};
const merge = (...args) => {
if (!_layered) {
_layered = _model.get();
}
_model.merge(...args);
};
const _get = (root, path) => {
let iter = root;
const parts = path.split(".");
for (let i = 0; iter && i < parts.length; i++) {
const part = parts[i];
iter = iter[part];
}
return iter;
};
// When we delete a property, the layered one must come up
const del = path => {
_model.del(path);
const valueBefore = _get(_layered, path);
if (valueBefore !== undefined) {
_model.set(path, valueBefore);
}
};
return {
addLayer,
del,
get,
merge,
set
};
};
// Smart deep freezer. It does not freeze arrays made out of basic types
const deepFreeze = iter => {
if (!iter) {
return iter;
}
if (typeof iter === "object") {
Object.freeze(iter);
if (iter instanceof Array) {
if (iter.length) {
const firstElement = iter[0];
// If the first element is not an object, we do not freeze recursively an
// array to speed up freezing. We assume non heterogeneous
// arrays (that is, all elements of an array are of the same type)
if (typeof firstElement === "object") {
for (let i = 0; i < iter.length; i++) {
deepFreeze(iter[i]);
}
}
}
} else {
for (key in iter) {
if (iter.hasOwnProperty(key)) {
const child = iter[key];
if (typeof child === "object") {
deepFreeze(child);
}
}
}
}
}
return iter;
};
module.exports = {
deepFreeze,
get,
instance,
layered,
proxy
};