-
Notifications
You must be signed in to change notification settings - Fork 2
Expand file tree
/
Copy pathindex.js
More file actions
249 lines (226 loc) · 4.99 KB
/
index.js
File metadata and controls
249 lines (226 loc) · 4.99 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
var AND = 1;
var OR = 2;
var isRegex = function(regex) {
return Object.prototype.toString.call(regex) === '[object RegExp]';
};
var isArray = function(list) { // TODO: add a polyfill for the browser
return Array.isArray(list);
};
// convert a list of validator functions into a single one using a bool relation
var reduce = function(op, list) {
if (list.length === 1) { // single item track
return list[0];
}
if (list.length === 2) { // fast op track
var a = list[0];
var b = list[1];
return op === AND ?
function(doc,prev) {
return a(doc,prev) && b(doc,prev);
} :
function(doc,prev) {
return a(doc,prev) || b(doc,prev);
};
}
return op === AND ? // list iteration track
function(doc,prev) {
for (var i = 0; i < list.length; i++) {
if (!list[i](doc,prev)) {
return false;
}
}
return true;
} :
function(doc,prev) {
for (var i = 0; i < list.length; i++) {
if (list[i](doc,prev)) {
return true;
}
}
return false;
};
};
// given some input and a constructor function, map this to the input and reduce
var mapReduce = function(op, list, fn) {
if (!isArray(list)) {
return fn(list);
}
return reduce(op, list.map(fn));
};
// the outer language: doc:{$op:value}
var outer = {
$has: function(keys) {
return mapReduce(AND, keys, function(key) {
return function(doc) {
return key in doc;
};
});
},
$or: function(paths) {
return mapReduce(OR, paths, compile);
}
};
// the inner language: doc:{key:{$op:value}}
var inner = {
$not: function(key, val) {
if (isRegex(val)) {
var fn = inner.$regex(key, val);
return function(doc) {
return !fn(doc);
};
}
return function(doc) {
return doc[key] !== val;
};
},
$exists: function(key, val) {
return function(doc) {
return (key in doc) === val;
};
},
$nil: function(key, val) {
return function(doc) {
return (doc[key] === undefined || doc[key] === null) === val;
};
},
$any: function(key, vals) {
return mapReduce(OR, vals, function(val) {
return function(doc) {
return doc[key] === val;
};
});
},
$like: function(key, vals) {
return mapReduce(AND, vals, function(val) {
val = val.toLowerCase();
return function(doc) {
return typeof doc[key] === 'string' && doc[key].toLowerCase().indexOf(val) > -1;
};
});
},
$regex: function(key, regex) { // normalized syntax for regex queries
if (typeof regex === 'string') {
var index = regex.lastIndexOf('/');
var modifiers = regex.substring(index+1);
regex = new RegExp(regex.substring(1,index), modifiers);
}
return function(doc) {
return doc[key] !== undefined && doc[key] !== null && regex.test(doc[key]);
};
},
// transitional queries
$changed: function(key) {
return function(doc, prev) {
return !prev || (doc[key] !== prev[key]);
};
},
$from: function(key, vals) {
return mapReduce(OR, vals, function(val) {
return function(doc, prev) {
return !!prev && prev[key] === val && doc[key] !== val;
};
});
},
$to: function(key, vals) {
return mapReduce(OR, vals, function(val) {
return function(doc, prev) {
return (!prev || prev[key] !== val) && doc[key] === val;
};
});
},
// classic number operators
$gt: function(key, val) {
return function(doc) {
return doc[key] > val;
};
},
$gte: function(key, val) {
return function(doc) {
return doc[key] >= val;
};
},
$lt: function(key, val) {
return function(doc) {
return doc[key] < val;
};
},
$lte: function(key, val) {
return function(doc) {
return doc[key] <= val;
};
},
$mod: function(key, val) {
return function(doc) {
return doc[key] % val[0] === val[1];
};
}
};
var not = function(definition) {
return function(a,b) {
var fn = definition(a,b);
return function(doc) {
return !fn(doc);
};
};
};
// lets add all the "$not"s
[inner, outer].forEach(function(col) {
for (var i in col) {
col['$not'+i.substring(1)] = not(col[i]);
}
});
var thruthy = function() {
return true;
};
var compile = function(query) {
var subset = {};
var list = [];
if (!query) {
return thruthy;
}
list.push(function(doc) {
for (var i in subset) {
if (subset[i] !== doc[i]) {
return false;
}
}
return true;
});
for (var i in query) {
var val = query[i];
if (isRegex(val)) { // shorthand for regex
list.push(inner.$regex(i, val));
continue;
}
if (outer[i]) {
list.push(outer[i](val));
continue;
}
if (typeof val === 'object') {
for (var j in val) {
if (inner[j]) {
list.push(inner[j](i, val[j]));
}
}
continue;
}
if (i.charAt(0) !== '$') {
subset[i] = val;
}
}
return reduce(AND, list);
};
module.exports = exports = compile;
// a useful utility for sending queries as json (regex is NOT json)
exports.toJSON = function(query) {
for (var i in query) {
if (isRegex(query[i])) {
query[i] = {$regex:query[i].toString()};
}
}
return query;
};
// shortcut to JSON.stringify(normalize(query))
exports.stringify = function(query) {
return JSON.stringify(exports.normalize(query));
};