/
OrmUtils.ts
283 lines (232 loc) · 9.32 KB
/
OrmUtils.ts
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
import { ObjectLiteral } from "../common/ObjectLiteral";
import { URL } from "url";
export class OrmUtils {
// -------------------------------------------------------------------------
// Public methods
// -------------------------------------------------------------------------
/**
* Chunks array into peaces.
*/
static chunk<T>(array: T[], size: number): T[][] {
return Array.from(Array(Math.ceil(array.length / size)), (_, i) => {
return array.slice(i * size, i * size + size);
});
}
static splitClassesAndStrings<T>(clsesAndStrings: (string | T)[]): [T[], string[]] {
return [
(clsesAndStrings).filter((cls): cls is T => typeof cls !== "string"),
(clsesAndStrings).filter((str): str is string => typeof str === "string"),
];
}
static groupBy<T, R>(array: T[], propertyCallback: (item: T) => R): { id: R, items: T[] }[] {
return array.reduce((groupedArray, value) => {
const key = propertyCallback(value);
let grouped = groupedArray.find(i => i.id === key);
if (!grouped) {
grouped = { id: key, items: [] };
groupedArray.push(grouped);
}
grouped.items.push(value);
return groupedArray;
}, [] as Array<{ id: R, items: T[] }>);
}
static uniq<T>(array: T[], criteria?: (item: T) => any): T[];
static uniq<T, K extends keyof T>(array: T[], property: K): T[];
static uniq<T, K extends keyof T>(array: T[], criteriaOrProperty?: ((item: T) => any) | K): T[] {
return array.reduce((uniqueArray, item) => {
let found: boolean = false;
if (criteriaOrProperty instanceof Function) {
const itemValue = criteriaOrProperty(item);
found = !!uniqueArray.find(uniqueItem => criteriaOrProperty(uniqueItem) === itemValue);
} else if (typeof criteriaOrProperty === "string") {
found = !!uniqueArray.find(uniqueItem => uniqueItem[criteriaOrProperty] === item[criteriaOrProperty]);
} else {
found = uniqueArray.indexOf(item) !== -1;
}
if (!found)
uniqueArray.push(item);
return uniqueArray;
}, [] as T[]);
}
static isObject(item: any) {
return (item && typeof item === "object" && !Array.isArray(item));
}
/**
* Deep Object.assign.
*
* @see http://stackoverflow.com/a/34749873
*/
static mergeDeep(target: any, ...sources: any[]): any {
if (!sources.length) return target;
const source = sources.shift();
if (this.isObject(target) && this.isObject(source)) {
for (const key in source) {
const value = source[key];
if (key === "__proto__" || value instanceof Promise)
continue;
if (this.isObject(value)
&& !(value instanceof Map)
&& !(value instanceof Set)
&& !(value instanceof Date)
&& !(value instanceof Buffer)
&& !(value instanceof RegExp)
&& !(value instanceof URL)) {
if (!target[key])
Object.assign(target, { [key]: Object.create(Object.getPrototypeOf(value)) });
this.mergeDeep(target[key], value);
} else {
Object.assign(target, { [key]: value });
}
}
}
return this.mergeDeep(target, ...sources);
}
/**
* Deep compare objects.
*
* @see http://stackoverflow.com/a/1144249
*/
static deepCompare(...args: any[]): boolean {
let i: any, l: any, leftChain: any, rightChain: any;
if (arguments.length < 1) {
return true; // Die silently? Don't know how to handle such case, please help...
// throw "Need two or more arguments to compare";
}
for (i = 1, l = arguments.length; i < l; i++) {
leftChain = []; // Todo: this can be cached
rightChain = [];
if (!this.compare2Objects(leftChain, rightChain, arguments[0], arguments[i])) {
return false;
}
}
return true;
}
/**
* Check if two entity-id-maps are the same
*/
static compareIds(firstId: ObjectLiteral|undefined, secondId: ObjectLiteral|undefined): boolean {
if (firstId === undefined || firstId === null || secondId === undefined || secondId === null)
return false;
// Optimized version for the common case
if (
((typeof firstId.id === "string" && typeof secondId.id === "string") ||
(typeof firstId.id === "number" && typeof secondId.id === "number")) &&
Object.keys(firstId).length === 1 &&
Object.keys(secondId).length === 1
) {
return firstId.id === secondId.id;
}
return OrmUtils.deepCompare(firstId, secondId);
}
/**
* Transforms given value into boolean value.
*/
static toBoolean(value: any): boolean {
if (typeof value === "boolean")
return value;
if (typeof value === "string")
return value === "true" || value === "1";
if (typeof value === "number")
return value > 0;
return false;
}
/**
* Composes an object from the given array of keys and values.
*/
static zipObject(keys: any[], values: any[]): ObjectLiteral {
return keys.reduce((object, column, index) => {
object[column] = values[index];
return object;
}, {} as ObjectLiteral);
}
/**
* Compares two arrays.
*/
static isArraysEqual(arr1: any[], arr2: any[]): boolean {
if (arr1.length !== arr2.length) return false;
return arr1.every(element => {
return arr2.indexOf(element) !== -1;
});
}
// -------------------------------------------------------------------------
// Private methods
// -------------------------------------------------------------------------
private static compare2Objects(leftChain: any, rightChain: any, x: any, y: any) {
let p;
// remember that NaN === NaN returns false
// and isNaN(undefined) returns true
if (Number.isNaN(x) && Number.isNaN(y))
return true;
// Compare primitives and functions.
// Check if both arguments link to the same object.
// Especially useful on the step where we compare prototypes
if (x === y)
return true;
// Unequal, but either is null or undefined (use case: jsonb comparasion)
// PR #3776, todo: add tests
if (x === null || y === null || x === undefined || y === undefined)
return false;
// Fix the buffer compare bug.
// See: https://github.com/typeorm/typeorm/issues/3654
if ((typeof x.equals === "function" || x.equals instanceof Function) && x.equals(y))
return true;
// Works in case when functions are created in constructor.
// Comparing dates is a common scenario. Another built-ins?
// We can even handle functions passed across iframes
if ((typeof x === "function" && typeof y === "function") ||
(x instanceof Date && y instanceof Date) ||
(x instanceof RegExp && y instanceof RegExp) ||
(x instanceof String && y instanceof String) ||
(x instanceof Number && y instanceof Number) ||
(x instanceof URL && y instanceof URL))
return x.toString() === y.toString();
// At last checking prototypes as good as we can
if (!(x instanceof Object && y instanceof Object))
return false;
if (x.isPrototypeOf(y) || y.isPrototypeOf(x))
return false;
if (x.constructor !== y.constructor)
return false;
if (x.prototype !== y.prototype)
return false;
// Check for infinitive linking loops
if (leftChain.indexOf(x) > -1 || rightChain.indexOf(y) > -1)
return false;
// Quick checking of one object being a subset of another.
// todo: cache the structure of arguments[0] for performance
for (p in y) {
if (y.hasOwnProperty(p) !== x.hasOwnProperty(p)) {
return false;
}
else if (typeof y[p] !== typeof x[p]) {
return false;
}
}
for (p in x) {
if (y.hasOwnProperty(p) !== x.hasOwnProperty(p)) {
return false;
}
else if (typeof y[p] !== typeof x[p]) {
return false;
}
switch (typeof (x[p])) {
case "object":
case "function":
leftChain.push(x);
rightChain.push(y);
if (!this.compare2Objects(leftChain, rightChain, x[p], y[p])) {
return false;
}
leftChain.pop();
rightChain.pop();
break;
default:
if (x[p] !== y[p]) {
return false;
}
break;
}
}
return true;
}
}