-
-
Notifications
You must be signed in to change notification settings - Fork 1.4k
Expand file tree
/
Copy pathFilters.js
More file actions
333 lines (320 loc) · 7.16 KB
/
Copy pathFilters.js
File metadata and controls
333 lines (320 loc) · 7.16 KB
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
/*
* Copyright (c) 2016-present, Parse, LLC
* All rights reserved.
*
* This source code is licensed under the license found in the LICENSE file in
* the root directory of this source tree.
*/
import Parse from 'parse';
export const Constraints = {
exists: {
name: 'exists',
field: null,
comparable: false,
},
dne: {
name: 'does not exist',
field: null,
comparable: false,
},
eq: {
name: 'equals',
comparable: true,
},
neq: {
name: 'does not equal',
comparable: true,
},
lt: {
name: 'less than',
field: 'Number',
composable: true,
comparable: true,
},
lte: {
name: 'less than or equal',
field: 'Number',
composable: true,
comparable: true,
},
gt: {
name: 'greater than',
field: 'Number',
composable: true,
comparable: true,
},
gte: {
name: 'greater than or equal',
field: 'Number',
composable: true,
comparable: true,
},
starts: {
name: 'starts with',
comparable: true,
},
ends: {
name: 'ends with',
comparable: true,
},
matches: {
name: 'matches regex',
field: 'String',
composable: true,
comparable: true,
},
contains: {
name: 'contains substring',
field: 'String',
composable: true,
comparable: true,
},
before: {
name: 'is before',
field: 'Date',
composable: true,
comparable: true,
},
after: {
name: 'is after',
field: 'Date',
composable: true,
comparable: true,
},
onOrAfter: {
name: 'is on or after',
field: 'Date',
composable: true,
comparable: true,
},
onOrBefore: {
name: 'is on or before',
field: 'Date',
composable: true,
comparable: true,
},
containsString: {
name: 'contains string',
field: 'String',
composable: true,
comparable: true,
},
doesNotContainString: {
name: 'without string',
field: 'String',
composable: true,
comparable: true,
},
containsNumber: {
name: 'contains number',
field: 'Number',
composable: true,
comparable: true,
},
doesNotContainNumber: {
name: 'without number',
field: 'Number',
composable: true,
comparable: true,
},
containsAny: {
name: 'contains',
field: 'Array',
comparable: true,
},
doesNotContainAny: {
name: 'does not contain',
field: 'Array',
comparable: true,
},
keyExists: {
name: 'key exists',
field: 'String',
composable: true,
comparable: true,
},
keyDne: {
name: 'key does not exist',
field: 'String',
composable: true,
comparable: true,
},
keyEq: {
name: 'key equals',
field: 'Object',
composable: true,
comparable: true,
},
keyNeq: {
name: 'key does not equal',
field: 'Object',
composable: true,
comparable: true,
},
keyGt: {
name: 'key greater than',
field: 'Object',
composable: true,
comparable: true,
},
keyGte: {
name: 'key greater than/equal',
field: 'Object',
composable: true,
comparable: true,
},
keyLt: {
name: 'key less than',
field: 'Object',
composable: true,
comparable: true,
},
keyLte: {
name: 'key less than/equal',
field: 'Object',
composable: true,
comparable: true,
},
unique: {
name: 'unique',
field: null,
comparable: false,
},
containedIn: {
name: 'contained in',
comparable: true,
},
};
export const FieldConstraints = {
Pointer: ['exists', 'dne', 'eq', 'neq', 'starts', 'containedIn', 'unique'],
Boolean: ['exists', 'dne', 'eq', 'neq', 'containedIn', 'unique'],
Number: ['exists', 'dne', 'eq', 'neq', 'lt', 'lte', 'gt', 'gte', 'containedIn', 'unique'],
String: [
'exists',
'dne',
'eq',
'neq',
'starts',
'ends',
'matches',
'contains',
'containedIn',
'unique',
],
Date: [
'exists',
'dne',
'before',
'onOrBefore',
'after',
'onOrAfter',
'containedIn',
'unique',
],
Object: [
'exists',
'dne',
'keyExists',
'keyDne',
'keyEq',
'keyNeq',
'keyGt',
'keyGte',
'keyLt',
'keyLte',
'unique',
],
Array: [
'exists',
'dne',
'containsString',
'doesNotContainString',
'containsNumber',
'doesNotContainNumber',
'containsAny',
'doesNotContainAny',
],
};
export const DefaultComparisons = {
Pointer: '',
Boolean: false,
Number: '',
String: '',
Object: '',
Date: Parse._encode(new Date()),
};
// Given a class schema and an array of current filters, this returns the remaining available filters
// schema is a map of objects - column name -> {type string, targetClass string}
// currentFilters is an immutable List of filters, Maps of the form { column: string, constraint: string, ... }
// blacklist is an optional array of constraints to ignore
export function availableFilters(schema, currentFilters, blacklist) {
blacklist = blacklist || [];
const disabled = {};
if (currentFilters) {
currentFilters.forEach(filter => {
if (!Constraints[filter.get('constraint')].composable) {
disabled[filter.get('field')] = true;
}
});
}
const available = {};
for (const col in schema) {
if (disabled[col]) {
continue;
}
const type = schema[col].type;
if (!FieldConstraints[type]) {
continue;
}
available[col] = FieldConstraints[type].filter(c => blacklist.indexOf(c) < 0);
}
return available;
}
export function findRelatedClasses(referClass, allClasses, blacklist, currentFilters) {
const relatedClasses = {};
if (allClasses[referClass]) {
const availableForRefer = availableFilters(allClasses[referClass], currentFilters, blacklist);
if (Object.keys(availableForRefer).length > 0) {
relatedClasses[referClass] = availableForRefer;
}
}
for (const className in allClasses) {
if (className === referClass) {
continue;
}
if (!checkRelation(referClass, allClasses, className)) {
continue;
}
const schema = allClasses[className];
const available = availableFilters(schema, currentFilters, blacklist);
if (Object.keys(available).length > 0) {
relatedClasses[className] = available;
}
}
return relatedClasses;
}
const checkRelationHelper = (schema, col, className) =>
schema[col].type === 'Pointer' && schema[col].targetClass === className;
function checkRelation(currentClassname, schemas, classToReferName) {
const currentClassSchema = schemas[currentClassname];
const classSchemaBeingCheckedToRefer = schemas[classToReferName];
let flag = false;
for (const col in currentClassSchema) {
if (checkRelationHelper(currentClassSchema, col, classToReferName)) {
flag = true;
}
}
for (const col in classSchemaBeingCheckedToRefer) {
if (checkRelationHelper(classSchemaBeingCheckedToRefer, col, currentClassname)) {
flag = true;
}
}
return flag;
}
export const BLACKLISTED_FILTERS = ['containsAny', 'doesNotContainAny'];
export function getFilterDetails(available) {
const filterClass = Object.keys(available)[0];
const filterField = Object.keys(available[filterClass])[0];
const filterConstraint = available[filterClass][filterField][0];
return { filterClass, filterField, filterConstraint };
}