corrade-nucleus-nucleons – Blame information for rev 24
?pathlinks?
Rev | Author | Line No. | Line |
---|---|---|---|
20 | office | 1 | // Underscore.js 1.7.0 |
2 | // http://underscorejs.org |
||
3 | // (c) 2009-2014 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors |
||
4 | // Underscore may be freely distributed under the MIT license. |
||
5 | |||
6 | (function() { |
||
7 | |||
8 | // Baseline setup |
||
9 | // -------------- |
||
10 | |||
11 | // Establish the root object, `window` in the browser, or `exports` on the server. |
||
12 | var root = this; |
||
13 | |||
14 | // Save the previous value of the `_` variable. |
||
15 | var previousUnderscore = root._; |
||
16 | |||
17 | // Save bytes in the minified (but not gzipped) version: |
||
18 | var ArrayProto = Array.prototype, ObjProto = Object.prototype, FuncProto = Function.prototype; |
||
19 | |||
20 | // Create quick reference variables for speed access to core prototypes. |
||
21 | var |
||
22 | push = ArrayProto.push, |
||
23 | slice = ArrayProto.slice, |
||
24 | toString = ObjProto.toString, |
||
25 | hasOwnProperty = ObjProto.hasOwnProperty; |
||
26 | |||
27 | // All **ECMAScript 5** native function implementations that we hope to use |
||
28 | // are declared here. |
||
29 | var |
||
30 | nativeIsArray = Array.isArray, |
||
31 | nativeKeys = Object.keys, |
||
32 | nativeBind = FuncProto.bind; |
||
33 | |||
34 | // Create a safe reference to the Underscore object for use below. |
||
35 | var _ = function(obj) { |
||
36 | if (obj instanceof _) return obj; |
||
37 | if (!(this instanceof _)) return new _(obj); |
||
38 | this._wrapped = obj; |
||
39 | }; |
||
40 | |||
41 | // Export the Underscore object for **Node.js**, with |
||
42 | // backwards-compatibility for the old `require()` API. If we're in |
||
43 | // the browser, add `_` as a global object. |
||
44 | if (typeof exports !== 'undefined') { |
||
45 | if (typeof module !== 'undefined' && module.exports) { |
||
46 | exports = module.exports = _; |
||
47 | } |
||
48 | exports._ = _; |
||
49 | } else { |
||
50 | root._ = _; |
||
51 | } |
||
52 | |||
53 | // Current version. |
||
54 | _.VERSION = '1.7.0'; |
||
55 | |||
56 | // Internal function that returns an efficient (for current engines) version |
||
57 | // of the passed-in callback, to be repeatedly applied in other Underscore |
||
58 | // functions. |
||
59 | var optimizeCb = function(func, context, argCount) { |
||
60 | if (context === void 0) return func; |
||
61 | switch (argCount == null ? 3 : argCount) { |
||
62 | case 1: return function(value) { |
||
63 | return func.call(context, value); |
||
64 | }; |
||
65 | case 2: return function(value, other) { |
||
66 | return func.call(context, value, other); |
||
67 | }; |
||
68 | case 3: return function(value, index, collection) { |
||
69 | return func.call(context, value, index, collection); |
||
70 | }; |
||
71 | case 4: return function(accumulator, value, index, collection) { |
||
72 | return func.call(context, accumulator, value, index, collection); |
||
73 | }; |
||
74 | } |
||
75 | return function() { |
||
76 | return func.apply(context, arguments); |
||
77 | }; |
||
78 | }; |
||
79 | |||
80 | // A mostly-internal function to generate callbacks that can be applied |
||
81 | // to each element in a collection, returning the desired result — either |
||
82 | // identity, an arbitrary callback, a property matcher, or a property accessor. |
||
83 | var cb = function(value, context, argCount) { |
||
84 | if (value == null) return _.identity; |
||
85 | if (_.isFunction(value)) return optimizeCb(value, context, argCount); |
||
86 | if (_.isObject(value)) return _.matches(value); |
||
87 | return _.property(value); |
||
88 | }; |
||
89 | _.iteratee = function(value, context) { |
||
90 | return cb(value, context); |
||
91 | }; |
||
92 | |||
93 | // Collection Functions |
||
94 | // -------------------- |
||
95 | |||
96 | // The cornerstone, an `each` implementation, aka `forEach`. |
||
97 | // Handles raw objects in addition to array-likes. Treats all |
||
98 | // sparse array-likes as if they were dense. |
||
99 | _.each = _.forEach = function(obj, iteratee, context) { |
||
100 | if (obj == null) return obj; |
||
101 | iteratee = optimizeCb(iteratee, context); |
||
102 | var i, length = obj.length; |
||
103 | if (length === +length) { |
||
104 | for (i = 0; i < length; i++) { |
||
105 | iteratee(obj[i], i, obj); |
||
106 | } |
||
107 | } else { |
||
108 | var keys = _.keys(obj); |
||
109 | for (i = 0, length = keys.length; i < length; i++) { |
||
110 | iteratee(obj[keys[i]], keys[i], obj); |
||
111 | } |
||
112 | } |
||
113 | return obj; |
||
114 | }; |
||
115 | |||
116 | // Return the results of applying the iteratee to each element. |
||
117 | _.map = _.collect = function(obj, iteratee, context) { |
||
118 | if (obj == null) return []; |
||
119 | iteratee = cb(iteratee, context); |
||
120 | var keys = obj.length !== +obj.length && _.keys(obj), |
||
121 | length = (keys || obj).length, |
||
122 | results = Array(length), |
||
123 | currentKey; |
||
124 | for (var index = 0; index < length; index++) { |
||
125 | currentKey = keys ? keys[index] : index; |
||
126 | results[index] = iteratee(obj[currentKey], currentKey, obj); |
||
127 | } |
||
128 | return results; |
||
129 | }; |
||
130 | |||
131 | var reduceError = 'Reduce of empty array with no initial value'; |
||
132 | |||
133 | // **Reduce** builds up a single result from a list of values, aka `inject`, |
||
134 | // or `foldl`. |
||
135 | _.reduce = _.foldl = _.inject = function(obj, iteratee, memo, context) { |
||
136 | if (obj == null) obj = []; |
||
137 | iteratee = optimizeCb(iteratee, context, 4); |
||
138 | var keys = obj.length !== +obj.length && _.keys(obj), |
||
139 | length = (keys || obj).length, |
||
140 | index = 0, currentKey; |
||
141 | if (arguments.length < 3) { |
||
142 | if (!length) throw new TypeError(reduceError); |
||
143 | memo = obj[keys ? keys[index++] : index++]; |
||
144 | } |
||
145 | for (; index < length; index++) { |
||
146 | currentKey = keys ? keys[index] : index; |
||
147 | memo = iteratee(memo, obj[currentKey], currentKey, obj); |
||
148 | } |
||
149 | return memo; |
||
150 | }; |
||
151 | |||
152 | // The right-associative version of reduce, also known as `foldr`. |
||
153 | _.reduceRight = _.foldr = function(obj, iteratee, memo, context) { |
||
154 | if (obj == null) obj = []; |
||
155 | iteratee = optimizeCb(iteratee, context, 4); |
||
156 | var keys = obj.length !== + obj.length && _.keys(obj), |
||
157 | index = (keys || obj).length, |
||
158 | currentKey; |
||
159 | if (arguments.length < 3) { |
||
160 | if (!index) throw new TypeError(reduceError); |
||
161 | memo = obj[keys ? keys[--index] : --index]; |
||
162 | } |
||
163 | while (index--) { |
||
164 | currentKey = keys ? keys[index] : index; |
||
165 | memo = iteratee(memo, obj[currentKey], currentKey, obj); |
||
166 | } |
||
167 | return memo; |
||
168 | }; |
||
169 | |||
170 | // Return the first value which passes a truth test. Aliased as `detect`. |
||
171 | _.find = _.detect = function(obj, predicate, context) { |
||
172 | var result; |
||
173 | predicate = cb(predicate, context); |
||
174 | _.some(obj, function(value, index, list) { |
||
175 | if (predicate(value, index, list)) { |
||
176 | result = value; |
||
177 | return true; |
||
178 | } |
||
179 | }); |
||
180 | return result; |
||
181 | }; |
||
182 | |||
183 | // Return all the elements that pass a truth test. |
||
184 | // Aliased as `select`. |
||
185 | _.filter = _.select = function(obj, predicate, context) { |
||
186 | var results = []; |
||
187 | if (obj == null) return results; |
||
188 | predicate = cb(predicate, context); |
||
189 | _.each(obj, function(value, index, list) { |
||
190 | if (predicate(value, index, list)) results.push(value); |
||
191 | }); |
||
192 | return results; |
||
193 | }; |
||
194 | |||
195 | // Return all the elements for which a truth test fails. |
||
196 | _.reject = function(obj, predicate, context) { |
||
197 | return _.filter(obj, _.negate(cb(predicate)), context); |
||
198 | }; |
||
199 | |||
200 | // Determine whether all of the elements match a truth test. |
||
201 | // Aliased as `all`. |
||
202 | _.every = _.all = function(obj, predicate, context) { |
||
203 | if (obj == null) return true; |
||
204 | predicate = cb(predicate, context); |
||
205 | var keys = obj.length !== +obj.length && _.keys(obj), |
||
206 | length = (keys || obj).length, |
||
207 | index, currentKey; |
||
208 | for (index = 0; index < length; index++) { |
||
209 | currentKey = keys ? keys[index] : index; |
||
210 | if (!predicate(obj[currentKey], currentKey, obj)) return false; |
||
211 | } |
||
212 | return true; |
||
213 | }; |
||
214 | |||
215 | // Determine if at least one element in the object matches a truth test. |
||
216 | // Aliased as `any`. |
||
217 | _.some = _.any = function(obj, predicate, context) { |
||
218 | if (obj == null) return false; |
||
219 | predicate = cb(predicate, context); |
||
220 | var keys = obj.length !== +obj.length && _.keys(obj), |
||
221 | length = (keys || obj).length, |
||
222 | index, currentKey; |
||
223 | for (index = 0; index < length; index++) { |
||
224 | currentKey = keys ? keys[index] : index; |
||
225 | if (predicate(obj[currentKey], currentKey, obj)) return true; |
||
226 | } |
||
227 | return false; |
||
228 | }; |
||
229 | |||
230 | // Determine if the array or object contains a given value (using `===`). |
||
231 | // Aliased as `include`. |
||
232 | _.contains = _.include = function(obj, target) { |
||
233 | if (obj == null) return false; |
||
234 | if (obj.length !== +obj.length) obj = _.values(obj); |
||
235 | return _.indexOf(obj, target) >= 0; |
||
236 | }; |
||
237 | |||
238 | // Invoke a method (with arguments) on every item in a collection. |
||
239 | _.invoke = function(obj, method) { |
||
240 | var args = slice.call(arguments, 2); |
||
241 | var isFunc = _.isFunction(method); |
||
242 | return _.map(obj, function(value) { |
||
243 | return (isFunc ? method : value[method]).apply(value, args); |
||
244 | }); |
||
245 | }; |
||
246 | |||
247 | // Convenience version of a common use case of `map`: fetching a property. |
||
248 | _.pluck = function(obj, key) { |
||
249 | return _.map(obj, _.property(key)); |
||
250 | }; |
||
251 | |||
252 | // Convenience version of a common use case of `filter`: selecting only objects |
||
253 | // containing specific `key:value` pairs. |
||
254 | _.where = function(obj, attrs) { |
||
255 | return _.filter(obj, _.matches(attrs)); |
||
256 | }; |
||
257 | |||
258 | // Convenience version of a common use case of `find`: getting the first object |
||
259 | // containing specific `key:value` pairs. |
||
260 | _.findWhere = function(obj, attrs) { |
||
261 | return _.find(obj, _.matches(attrs)); |
||
262 | }; |
||
263 | |||
264 | // Return the maximum element (or element-based computation). |
||
265 | _.max = function(obj, iteratee, context) { |
||
266 | var result = -Infinity, lastComputed = -Infinity, |
||
267 | value, computed; |
||
268 | if (iteratee == null && obj != null) { |
||
269 | obj = obj.length === +obj.length ? obj : _.values(obj); |
||
270 | for (var i = 0, length = obj.length; i < length; i++) { |
||
271 | value = obj[i]; |
||
272 | if (value > result) { |
||
273 | result = value; |
||
274 | } |
||
275 | } |
||
276 | } else { |
||
277 | iteratee = cb(iteratee, context); |
||
278 | _.each(obj, function(value, index, list) { |
||
279 | computed = iteratee(value, index, list); |
||
280 | if (computed > lastComputed || computed === -Infinity && result === -Infinity) { |
||
281 | result = value; |
||
282 | lastComputed = computed; |
||
283 | } |
||
284 | }); |
||
285 | } |
||
286 | return result; |
||
287 | }; |
||
288 | |||
289 | // Return the minimum element (or element-based computation). |
||
290 | _.min = function(obj, iteratee, context) { |
||
291 | var result = Infinity, lastComputed = Infinity, |
||
292 | value, computed; |
||
293 | if (iteratee == null && obj != null) { |
||
294 | obj = obj.length === +obj.length ? obj : _.values(obj); |
||
295 | for (var i = 0, length = obj.length; i < length; i++) { |
||
296 | value = obj[i]; |
||
297 | if (value < result) { |
||
298 | result = value; |
||
299 | } |
||
300 | } |
||
301 | } else { |
||
302 | iteratee = cb(iteratee, context); |
||
303 | _.each(obj, function(value, index, list) { |
||
304 | computed = iteratee(value, index, list); |
||
305 | if (computed < lastComputed || computed === Infinity && result === Infinity) { |
||
306 | result = value; |
||
307 | lastComputed = computed; |
||
308 | } |
||
309 | }); |
||
310 | } |
||
311 | return result; |
||
312 | }; |
||
313 | |||
314 | // Shuffle a collection, using the modern version of the |
||
315 | // [Fisher-Yates shuffle](http://en.wikipedia.org/wiki/Fisher–Yates_shuffle). |
||
316 | _.shuffle = function(obj) { |
||
317 | var set = obj && obj.length === +obj.length ? obj : _.values(obj); |
||
318 | var length = set.length; |
||
319 | var shuffled = Array(length); |
||
320 | for (var index = 0, rand; index < length; index++) { |
||
321 | rand = _.random(0, index); |
||
322 | if (rand !== index) shuffled[index] = shuffled[rand]; |
||
323 | shuffled[rand] = set[index]; |
||
324 | } |
||
325 | return shuffled; |
||
326 | }; |
||
327 | |||
328 | // Sample **n** random values from a collection. |
||
329 | // If **n** is not specified, returns a single random element. |
||
330 | // The internal `guard` argument allows it to work with `map`. |
||
331 | _.sample = function(obj, n, guard) { |
||
332 | if (n == null || guard) { |
||
333 | if (obj.length !== +obj.length) obj = _.values(obj); |
||
334 | return obj[_.random(obj.length - 1)]; |
||
335 | } |
||
336 | return _.shuffle(obj).slice(0, Math.max(0, n)); |
||
337 | }; |
||
338 | |||
339 | // Sort the object's values by a criterion produced by an iteratee. |
||
340 | _.sortBy = function(obj, iteratee, context) { |
||
341 | iteratee = cb(iteratee, context); |
||
342 | return _.pluck(_.map(obj, function(value, index, list) { |
||
343 | return { |
||
344 | value: value, |
||
345 | index: index, |
||
346 | criteria: iteratee(value, index, list) |
||
347 | }; |
||
348 | }).sort(function(left, right) { |
||
349 | var a = left.criteria; |
||
350 | var b = right.criteria; |
||
351 | if (a !== b) { |
||
352 | if (a > b || a === void 0) return 1; |
||
353 | if (a < b || b === void 0) return -1; |
||
354 | } |
||
355 | return left.index - right.index; |
||
356 | }), 'value'); |
||
357 | }; |
||
358 | |||
359 | // An internal function used for aggregate "group by" operations. |
||
360 | var group = function(behavior) { |
||
361 | return function(obj, iteratee, context) { |
||
362 | var result = {}; |
||
363 | iteratee = cb(iteratee, context); |
||
364 | _.each(obj, function(value, index) { |
||
365 | var key = iteratee(value, index, obj); |
||
366 | behavior(result, value, key); |
||
367 | }); |
||
368 | return result; |
||
369 | }; |
||
370 | }; |
||
371 | |||
372 | // Groups the object's values by a criterion. Pass either a string attribute |
||
373 | // to group by, or a function that returns the criterion. |
||
374 | _.groupBy = group(function(result, value, key) { |
||
375 | if (_.has(result, key)) result[key].push(value); else result[key] = [value]; |
||
376 | }); |
||
377 | |||
378 | // Indexes the object's values by a criterion, similar to `groupBy`, but for |
||
379 | // when you know that your index values will be unique. |
||
380 | _.indexBy = group(function(result, value, key) { |
||
381 | result[key] = value; |
||
382 | }); |
||
383 | |||
384 | // Counts instances of an object that group by a certain criterion. Pass |
||
385 | // either a string attribute to count by, or a function that returns the |
||
386 | // criterion. |
||
387 | _.countBy = group(function(result, value, key) { |
||
388 | if (_.has(result, key)) result[key]++; else result[key] = 1; |
||
389 | }); |
||
390 | |||
391 | // Use a comparator function to figure out the smallest index at which |
||
392 | // an object should be inserted so as to maintain order. Uses binary search. |
||
393 | _.sortedIndex = function(array, obj, iteratee, context) { |
||
394 | iteratee = cb(iteratee, context, 1); |
||
395 | var value = iteratee(obj); |
||
396 | var low = 0, high = array.length; |
||
397 | while (low < high) { |
||
398 | var mid = low + high >>> 1; |
||
399 | if (iteratee(array[mid]) < value) low = mid + 1; else high = mid; |
||
400 | } |
||
401 | return low; |
||
402 | }; |
||
403 | |||
404 | // Safely create a real, live array from anything iterable. |
||
405 | _.toArray = function(obj) { |
||
406 | if (!obj) return []; |
||
407 | if (_.isArray(obj)) return slice.call(obj); |
||
408 | if (obj.length === +obj.length) return _.map(obj, _.identity); |
||
409 | return _.values(obj); |
||
410 | }; |
||
411 | |||
412 | // Return the number of elements in an object. |
||
413 | _.size = function(obj) { |
||
414 | if (obj == null) return 0; |
||
415 | return obj.length === +obj.length ? obj.length : _.keys(obj).length; |
||
416 | }; |
||
417 | |||
418 | // Split a collection into two arrays: one whose elements all satisfy the given |
||
419 | // predicate, and one whose elements all do not satisfy the predicate. |
||
420 | _.partition = function(obj, predicate, context) { |
||
421 | predicate = cb(predicate, context); |
||
422 | var pass = [], fail = []; |
||
423 | _.each(obj, function(value, key, obj) { |
||
424 | (predicate(value, key, obj) ? pass : fail).push(value); |
||
425 | }); |
||
426 | return [pass, fail]; |
||
427 | }; |
||
428 | |||
429 | // Array Functions |
||
430 | // --------------- |
||
431 | |||
432 | // Get the first element of an array. Passing **n** will return the first N |
||
433 | // values in the array. Aliased as `head` and `take`. The **guard** check |
||
434 | // allows it to work with `_.map`. |
||
435 | _.first = _.head = _.take = function(array, n, guard) { |
||
436 | if (array == null) return void 0; |
||
437 | if (n == null || guard) return array[0]; |
||
438 | return _.initial(array, array.length - n); |
||
439 | }; |
||
440 | |||
441 | // Returns everything but the last entry of the array. Especially useful on |
||
442 | // the arguments object. Passing **n** will return all the values in |
||
443 | // the array, excluding the last N. The **guard** check allows it to work with |
||
444 | // `_.map`. |
||
445 | _.initial = function(array, n, guard) { |
||
446 | return slice.call(array, 0, Math.max(0, array.length - (n == null || guard ? 1 : n))); |
||
447 | }; |
||
448 | |||
449 | // Get the last element of an array. Passing **n** will return the last N |
||
450 | // values in the array. The **guard** check allows it to work with `_.map`. |
||
451 | _.last = function(array, n, guard) { |
||
452 | if (array == null) return void 0; |
||
453 | if (n == null || guard) return array[array.length - 1]; |
||
454 | return _.rest(array, Math.max(0, array.length - n)); |
||
455 | }; |
||
456 | |||
457 | // Returns everything but the first entry of the array. Aliased as `tail` and `drop`. |
||
458 | // Especially useful on the arguments object. Passing an **n** will return |
||
459 | // the rest N values in the array. The **guard** |
||
460 | // check allows it to work with `_.map`. |
||
461 | _.rest = _.tail = _.drop = function(array, n, guard) { |
||
462 | return slice.call(array, n == null || guard ? 1 : n); |
||
463 | }; |
||
464 | |||
465 | // Trim out all falsy values from an array. |
||
466 | _.compact = function(array) { |
||
467 | return _.filter(array, _.identity); |
||
468 | }; |
||
469 | |||
470 | // Internal implementation of a recursive `flatten` function. |
||
471 | var flatten = function(input, shallow, strict, startIndex) { |
||
472 | var output = [], idx = 0, value; |
||
473 | for (var i = startIndex || 0, length = input && input.length; i < length; i++) { |
||
474 | value = input[i]; |
||
475 | if (value && value.length >= 0 && (_.isArray(value) || _.isArguments(value))) { |
||
476 | //flatten current level of array or arguments object |
||
477 | if (!shallow) value = flatten(value, shallow, strict); |
||
478 | var j = 0, len = value.length; |
||
479 | output.length += len; |
||
480 | while (j < len) { |
||
481 | output[idx++] = value[j++]; |
||
482 | } |
||
483 | } else if (!strict) { |
||
484 | output[idx++] = value; |
||
485 | } |
||
486 | } |
||
487 | return output; |
||
488 | }; |
||
489 | |||
490 | // Flatten out an array, either recursively (by default), or just one level. |
||
491 | _.flatten = function(array, shallow) { |
||
492 | return flatten(array, shallow, false); |
||
493 | }; |
||
494 | |||
495 | // Return a version of the array that does not contain the specified value(s). |
||
496 | _.without = function(array) { |
||
497 | return _.difference(array, slice.call(arguments, 1)); |
||
498 | }; |
||
499 | |||
500 | // Produce a duplicate-free version of the array. If the array has already |
||
501 | // been sorted, you have the option of using a faster algorithm. |
||
502 | // Aliased as `unique`. |
||
503 | _.uniq = _.unique = function(array, isSorted, iteratee, context) { |
||
504 | if (array == null) return []; |
||
505 | if (!_.isBoolean(isSorted)) { |
||
506 | context = iteratee; |
||
507 | iteratee = isSorted; |
||
508 | isSorted = false; |
||
509 | } |
||
510 | if (iteratee != null) iteratee = cb(iteratee, context); |
||
511 | var result = []; |
||
512 | var seen = []; |
||
513 | for (var i = 0, length = array.length; i < length; i++) { |
||
514 | var value = array[i], |
||
515 | computed = iteratee ? iteratee(value, i, array) : value; |
||
516 | if (isSorted) { |
||
517 | if (!i || seen !== computed) result.push(value); |
||
518 | seen = computed; |
||
519 | } else if (iteratee) { |
||
520 | if (!_.contains(seen, computed)) { |
||
521 | seen.push(computed); |
||
522 | result.push(value); |
||
523 | } |
||
524 | } else if (!_.contains(result, value)) { |
||
525 | result.push(value); |
||
526 | } |
||
527 | } |
||
528 | return result; |
||
529 | }; |
||
530 | |||
531 | // Produce an array that contains the union: each distinct element from all of |
||
532 | // the passed-in arrays. |
||
533 | _.union = function() { |
||
534 | return _.uniq(flatten(arguments, true, true)); |
||
535 | }; |
||
536 | |||
537 | // Produce an array that contains every item shared between all the |
||
538 | // passed-in arrays. |
||
539 | _.intersection = function(array) { |
||
540 | if (array == null) return []; |
||
541 | var result = []; |
||
542 | var argsLength = arguments.length; |
||
543 | for (var i = 0, length = array.length; i < length; i++) { |
||
544 | var item = array[i]; |
||
545 | if (_.contains(result, item)) continue; |
||
546 | for (var j = 1; j < argsLength; j++) { |
||
547 | if (!_.contains(arguments[j], item)) break; |
||
548 | } |
||
549 | if (j === argsLength) result.push(item); |
||
550 | } |
||
551 | return result; |
||
552 | }; |
||
553 | |||
554 | // Take the difference between one array and a number of other arrays. |
||
555 | // Only the elements present in just the first array will remain. |
||
556 | _.difference = function(array) { |
||
557 | var rest = flatten(arguments, true, true, 1); |
||
558 | return _.filter(array, function(value){ |
||
559 | return !_.contains(rest, value); |
||
560 | }); |
||
561 | }; |
||
562 | |||
563 | // Zip together multiple lists into a single array -- elements that share |
||
564 | // an index go together. |
||
565 | _.zip = function(array) { |
||
566 | if (array == null) return []; |
||
567 | var length = _.max(arguments, 'length').length; |
||
568 | var results = Array(length); |
||
569 | while (length-- > 0) { |
||
570 | results[length] = _.pluck(arguments, length); |
||
571 | } |
||
572 | return results; |
||
573 | }; |
||
574 | |||
575 | // Complement of _.zip. Unzip accepts an array of arrays and groups |
||
576 | // each array's elements on shared indices |
||
577 | _.unzip = function(array) { |
||
578 | return _.zip.apply(null, array); |
||
579 | }; |
||
580 | |||
581 | // Converts lists into objects. Pass either a single array of `[key, value]` |
||
582 | // pairs, or two parallel arrays of the same length -- one of keys, and one of |
||
583 | // the corresponding values. |
||
584 | _.object = function(list, values) { |
||
585 | if (list == null) return {}; |
||
586 | var result = {}; |
||
587 | for (var i = 0, length = list.length; i < length; i++) { |
||
588 | if (values) { |
||
589 | result[list[i]] = values[i]; |
||
590 | } else { |
||
591 | result[list[i][0]] = list[i][1]; |
||
592 | } |
||
593 | } |
||
594 | return result; |
||
595 | }; |
||
596 | |||
597 | // Return the position of the first occurrence of an item in an array, |
||
598 | // or -1 if the item is not included in the array. |
||
599 | // If the array is large and already in sort order, pass `true` |
||
600 | // for **isSorted** to use binary search. |
||
601 | _.indexOf = function(array, item, isSorted) { |
||
602 | var i = 0, length = array && array.length; |
||
603 | if (typeof isSorted == 'number') { |
||
604 | i = isSorted < 0 ? Math.max(0, length + isSorted) : isSorted; |
||
605 | } else if (isSorted) { |
||
606 | i = _.sortedIndex(array, item); |
||
607 | return array[i] === item ? i : -1; |
||
608 | } |
||
609 | for (; i < length; i++) if (array[i] === item) return i; |
||
610 | return -1; |
||
611 | }; |
||
612 | |||
613 | _.lastIndexOf = function(array, item, from) { |
||
614 | var idx = array ? array.length : 0; |
||
615 | if (typeof from == 'number') { |
||
616 | idx = from < 0 ? idx + from + 1 : Math.min(idx, from + 1); |
||
617 | } |
||
618 | while (--idx >= 0) if (array[idx] === item) return idx; |
||
619 | return -1; |
||
620 | }; |
||
621 | |||
622 | // Generate an integer Array containing an arithmetic progression. A port of |
||
623 | // the native Python `range()` function. See |
||
624 | // [the Python documentation](http://docs.python.org/library/functions.html#range). |
||
625 | _.range = function(start, stop, step) { |
||
626 | if (arguments.length <= 1) { |
||
627 | stop = start || 0; |
||
628 | start = 0; |
||
629 | } |
||
630 | step = step || 1; |
||
631 | |||
632 | var length = Math.max(Math.ceil((stop - start) / step), 0); |
||
633 | var range = Array(length); |
||
634 | |||
635 | for (var idx = 0; idx < length; idx++, start += step) {> |
||
636 | < length; idx++, start += step) { range[idx] = start;> |
||
637 | < length; idx++, start += step) { }> |
||
638 | |||
639 | < length; idx++, start += step) { return range;> |
||
640 | < length; idx++, start += step) { };> |
||
641 | |||
642 | < length; idx++, start += step) { // Function (ahem) Functions> |
||
643 | < length; idx++, start += step) { // ------------------> |
||
644 | |||
645 | < length; idx++, start += step) { // Reusable constructor function for prototype setting.> |
||
646 | < length; idx++, start += step) { var Ctor = function(){};> |
||
647 | |||
648 | < length; idx++, start += step) { // Create a function bound to a given object (assigning `this`, and arguments,> |
||
649 | < length; idx++, start += step) { // optionally). Delegates to **ECMAScript 5**'s native `Function.bind` if> |
||
650 | < length; idx++, start += step) { // available.> |
||
651 | < length; idx++, start += step) { _.bind = function(func, context) {> |
||
652 | < length; idx++, start += step) { var args, bound;> |
||
653 | < length; idx++, start += step) { if (nativeBind && func.bind === nativeBind) return nativeBind.apply(func, slice.call(arguments, 1));> |
||
654 | < length; idx++, start += step) { if (!_.isFunction(func)) throw new TypeError('Bind must be called on a function');> |
||
655 | < length; idx++, start += step) { args = slice.call(arguments, 2);> |
||
656 | < length; idx++, start += step) { bound = function() {> |
||
657 | < length; idx++, start += step) { if (!(this instanceof bound)) return func.apply(context, args.concat(slice.call(arguments)));> |
||
658 | < length; idx++, start += step) { Ctor.prototype = func.prototype;> |
||
659 | < length; idx++, start += step) { var self = new Ctor;> |
||
660 | < length; idx++, start += step) { Ctor.prototype = null;> |
||
661 | < length; idx++, start += step) { var result = func.apply(self, args.concat(slice.call(arguments)));> |
||
662 | < length; idx++, start += step) { if (_.isObject(result)) return result;> |
||
663 | < length; idx++, start += step) { return self;> |
||
664 | < length; idx++, start += step) { };> |
||
665 | < length; idx++, start += step) { return bound;> |
||
666 | < length; idx++, start += step) { };> |
||
667 | |||
668 | < length; idx++, start += step) { // Partially apply a function by creating a version that has had some of its> |
||
669 | < length; idx++, start += step) { // arguments pre-filled, without changing its dynamic `this` context. _ acts> |
||
670 | < length; idx++, start += step) { // as a placeholder, allowing any combination of arguments to be pre-filled.> |
||
671 | < length; idx++, start += step) { _.partial = function(func) {> |
||
672 | < length; idx++, start += step) { var boundArgs = slice.call(arguments, 1);> |
||
673 | < length; idx++, start += step) { return function() {> |
||
674 | < length; idx++, start += step) { var position = 0;> |
||
675 | < length; idx++, start += step) { var args = boundArgs.slice();> |
||
676 | < length; idx++, start += step) { for (var i = 0, length = args.length; i < length; i++) {>> |
||
677 | < length; idx++, start += step) {< length; i++) { if (args[i] === _) args[i] = arguments[position++];>> |
||
678 | < length; idx++, start += step) {< length; i++) { }>> |
||
679 | < length; idx++, start += step) {< length; i++) { while (position < arguments.length) args.push(arguments[position++]);>>> |
||
680 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]); return func.apply(this, args);>>> |
||
681 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]); };>>> |
||
682 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]); };>>> |
||
683 | |||
684 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]); // Bind a number of an object's methods to that object. Remaining arguments>>> |
||
685 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]); // are the method names to be bound. Useful for ensuring that all callbacks>>> |
||
686 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]); // defined on an object belong to it.>>> |
||
687 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]); _.bindAll = function(obj) {>>> |
||
688 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]); var i, length = arguments.length, key;>>> |
||
689 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]); if (length <= 1) throw new Error('bindAll must be passed function names');=>>>> |
||
690 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names'); for (i = 1; i < length; i++) {>=>>>> |
||
691 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { key = arguments[i];>=>>>> |
||
692 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { obj[key] = _.bind(obj[key], obj);>=>>>> |
||
693 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { }>=>>>> |
||
694 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { return obj;>=>>>> |
||
695 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { };>=>>>> |
||
696 | |||
697 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { // Memoize an expensive function by storing its results.>=>>>> |
||
698 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { _.memoize = function(func, hasher) {>=>>>> |
||
699 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { var memoize = function(key) {>=>>>> |
||
700 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { var cache = memoize.cache;>=>>>> |
||
701 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { var address = '' + (hasher ? hasher.apply(this, arguments) : key);>=>>>> |
||
702 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { if (!_.has(cache, address)) cache[address] = func.apply(this, arguments);>=>>>> |
||
703 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { return cache[address];>=>>>> |
||
704 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { };>=>>>> |
||
705 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { memoize.cache = {};>=>>>> |
||
706 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { return memoize;>=>>>> |
||
707 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { };>=>>>> |
||
708 | |||
709 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { // Delays a function for the given number of milliseconds, and then calls>=>>>> |
||
710 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { // it with the arguments supplied.>=>>>> |
||
711 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { _.delay = function(func, wait) {>=>>>> |
||
712 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { var args = slice.call(arguments, 2);>=>>>> |
||
713 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { return setTimeout(function(){>=>>>> |
||
714 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { return func.apply(null, args);>=>>>> |
||
715 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { }, wait);>=>>>> |
||
716 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { };>=>>>> |
||
717 | |||
718 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { // Defers a function, scheduling it to run after the current call stack has>=>>>> |
||
719 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { // cleared.>=>>>> |
||
720 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { _.defer = function(func) {>=>>>> |
||
721 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { return _.delay.apply(_, [func, 1].concat(slice.call(arguments, 1)));>=>>>> |
||
722 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { };>=>>>> |
||
723 | |||
724 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { // Returns a function, that, when invoked, will only be triggered at most once>=>>>> |
||
725 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { // during a given window of time. Normally, the throttled function will run>=>>>> |
||
726 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { // as much as it can, without ever going more than once per `wait` duration;>=>>>> |
||
727 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { // but if you'd like to disable the execution on the leading edge, pass>=>>>> |
||
728 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { // `{leading: false}`. To disable execution on the trailing edge, ditto.>=>>>> |
||
729 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { _.throttle = function(func, wait, options) {>=>>>> |
||
730 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { var context, args, result;>=>>>> |
||
731 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { var timeout = null;>=>>>> |
||
732 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { var previous = 0;>=>>>> |
||
733 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { if (!options) options = {};>=>>>> |
||
734 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { var later = function() {>=>>>> |
||
735 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { previous = options.leading === false ? 0 : _.now();>=>>>> |
||
736 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { timeout = null;>=>>>> |
||
737 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { result = func.apply(context, args);>=>>>> |
||
738 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { if (!timeout) context = args = null;>=>>>> |
||
739 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { };>=>>>> |
||
740 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { return function() {>=>>>> |
||
741 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { var now = _.now();>=>>>> |
||
742 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { if (!previous && options.leading === false) previous = now;>=>>>> |
||
743 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { var remaining = wait - (now - previous);>=>>>> |
||
744 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { context = this;>=>>>> |
||
745 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { args = arguments;>=>>>> |
||
746 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) { if (remaining <= 0 || remaining > wait) {=>>=>>>> |
||
747 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining > if (timeout) {=>>=>>>> |
||
748 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining > clearTimeout(timeout);=>>=>>>> |
||
749 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining > timeout = null;=>>=>>>> |
||
750 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining > }=>>=>>>> |
||
751 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining > previous = now;=>>=>>>> |
||
752 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining > result = func.apply(context, args);=>>=>>>> |
||
753 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining > if (!timeout) context = args = null;=>>=>>>> |
||
754 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining > } else if (!timeout && options.trailing !== false) {=>>=>>>> |
||
755 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining > timeout = setTimeout(later, remaining);=>>=>>>> |
||
756 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining > }=>>=>>>> |
||
757 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining > return result;=>>=>>>> |
||
758 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining > };=>>=>>>> |
||
759 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining > };=>>=>>>> |
||
760 | |||
761 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining > // Returns a function, that, as long as it continues to be invoked, will not=>>=>>>> |
||
762 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining > // be triggered. The function will be called after it stops being called for=>>=>>>> |
||
763 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining > // N milliseconds. If `immediate` is passed, trigger the function on the=>>=>>>> |
||
764 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining > // leading edge, instead of the trailing.=>>=>>>> |
||
765 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining > _.debounce = function(func, wait, immediate) {=>>=>>>> |
||
766 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining > var timeout, args, context, timestamp, result;=>>=>>>> |
||
767 | |||
768 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining > var later = function() {=>>=>>>> |
||
769 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining > var last = _.now() - timestamp;=>>=>>>> |
||
770 | |||
771 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining > if (last < wait && last >= 0) {>=>>=>>>> |
||
772 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > timeout = setTimeout(later, wait - last);>=>>=>>>> |
||
773 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > } else {>=>>=>>>> |
||
774 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > timeout = null;>=>>=>>>> |
||
775 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > if (!immediate) {>=>>=>>>> |
||
776 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > result = func.apply(context, args);>=>>=>>>> |
||
777 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > if (!timeout) context = args = null;>=>>=>>>> |
||
778 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > }>=>>=>>>> |
||
779 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > }>=>>=>>>> |
||
780 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > };>=>>=>>>> |
||
781 | |||
782 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > return function() {>=>>=>>>> |
||
783 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > context = this;>=>>=>>>> |
||
784 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > args = arguments;>=>>=>>>> |
||
785 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > timestamp = _.now();>=>>=>>>> |
||
786 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > var callNow = immediate && !timeout;>=>>=>>>> |
||
787 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > if (!timeout) timeout = setTimeout(later, wait);>=>>=>>>> |
||
788 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > if (callNow) {>=>>=>>>> |
||
789 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > result = func.apply(context, args);>=>>=>>>> |
||
790 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > context = args = null;>=>>=>>>> |
||
791 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > }>=>>=>>>> |
||
792 | |||
793 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > return result;>=>>=>>>> |
||
794 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > };>=>>=>>>> |
||
795 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > };>=>>=>>>> |
||
796 | |||
797 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > // Returns the first function passed as an argument to the second,>=>>=>>>> |
||
798 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > // allowing you to adjust arguments, run code before and after, and>=>>=>>>> |
||
799 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > // conditionally execute the original function.>=>>=>>>> |
||
800 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > _.wrap = function(func, wrapper) {>=>>=>>>> |
||
801 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > return _.partial(wrapper, func);>=>>=>>>> |
||
802 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > };>=>>=>>>> |
||
803 | |||
804 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > // Returns a negated version of the passed-in predicate.>=>>=>>>> |
||
805 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > _.negate = function(predicate) {>=>>=>>>> |
||
806 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > return function() {>=>>=>>>> |
||
807 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > return !predicate.apply(this, arguments);>=>>=>>>> |
||
808 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > };>=>>=>>>> |
||
809 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > };>=>>=>>>> |
||
810 | |||
811 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > // Returns a function that is the composition of a list of functions, each>=>>=>>>> |
||
812 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > // consuming the return value of the function that follows.>=>>=>>>> |
||
813 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > _.compose = function() {>=>>=>>>> |
||
814 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > var args = arguments;>=>>=>>>> |
||
815 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > var start = args.length - 1;>=>>=>>>> |
||
816 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > return function() {>=>>=>>>> |
||
817 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > var i = start;>=>>=>>>> |
||
818 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > var result = args[start].apply(this, arguments);>=>>=>>>> |
||
819 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > while (i--) result = args[i].call(this, result);>=>>=>>>> |
||
820 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > return result;>=>>=>>>> |
||
821 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > };>=>>=>>>> |
||
822 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > };>=>>=>>>> |
||
823 | |||
824 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > // Returns a function that will only be executed after being called N times.>=>>=>>>> |
||
825 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > _.after = function(times, func) {>=>>=>>>> |
||
826 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > return function() {>=>>=>>>> |
||
827 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last > if (--times < 1) {>>=>>=>>>> |
||
828 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) { return func.apply(this, arguments);>>=>>=>>>> |
||
829 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) { }>>=>>=>>>> |
||
830 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) { };>>=>>=>>>> |
||
831 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) { };>>=>>=>>>> |
||
832 | |||
833 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) { // Returns a function that will only be executed before being called N times.>>=>>=>>>> |
||
834 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) { _.before = function(times, func) {>>=>>=>>>> |
||
835 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) { var memo;>>=>>=>>>> |
||
836 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) { return function() {>>=>>=>>>> |
||
837 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) { if (--times > 0) {>>=>>=>>>> |
||
838 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) { memo = func.apply(this, arguments);>>=>>=>>>> |
||
839 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) { } else {>>=>>=>>>> |
||
840 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) { func = null;>>=>>=>>>> |
||
841 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) { }>>=>>=>>>> |
||
842 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) { return memo;>>=>>=>>>> |
||
843 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) { };>>=>>=>>>> |
||
844 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) { };>>=>>=>>>> |
||
845 | |||
846 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) { // Returns a function that will be executed at most one time, no matter how>>=>>=>>>> |
||
847 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) { // often you call it. Useful for lazy initialization.>>=>>=>>>> |
||
848 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) { _.once = _.partial(_.before, 2);>>=>>=>>>> |
||
849 | |||
850 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) { // Object Functions>>=>>=>>>> |
||
851 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) { // ---------------->>=>>=>>>> |
||
852 | |||
853 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) { // Keys in IE < 9 that won't be iterated by `for key in ...` and thus missed.>>>=>>=>>>> |
||
854 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed. var hasEnumBug = !({toString: null}).propertyIsEnumerable('toString');>>>=>>=>>>> |
||
855 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed. var nonEnumerableProps = ['constructor', 'valueOf', 'isPrototypeOf', 'toString',>>>=>>=>>>> |
||
856 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed. 'propertyIsEnumerable', 'hasOwnProperty', 'toLocaleString'];>>>=>>=>>>> |
||
857 | |||
858 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed. // Retrieve the names of an object's properties.>>>=>>=>>>> |
||
859 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed. // Delegates to **ECMAScript 5**'s native `Object.keys`>>>=>>=>>>> |
||
860 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed. _.keys = function(obj) {>>>=>>=>>>> |
||
861 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed. if (!_.isObject(obj)) return [];>>>=>>=>>>> |
||
862 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed. if (nativeKeys) return nativeKeys(obj);>>>=>>=>>>> |
||
863 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed. var keys = [];>>>=>>=>>>> |
||
864 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed. for (var key in obj) if (_.has(obj, key)) keys.push(key);>>>=>>=>>>> |
||
865 | |||
866 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed. // Ahem, IE < 9.>>>>=>>=>>>> |
||
867 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9. if (hasEnumBug) {>>>>=>>=>>>> |
||
868 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9. var nonEnumIdx = nonEnumerableProps.length;>>>>=>>=>>>> |
||
869 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9. while (nonEnumIdx--) {>>>>=>>=>>>> |
||
870 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9. var prop = nonEnumerableProps[nonEnumIdx];>>>>=>>=>>>> |
||
871 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9. if (_.has(obj, prop) && !_.contains(keys, prop)) keys.push(prop);>>>>=>>=>>>> |
||
872 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9. }>>>>=>>=>>>> |
||
873 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9. }>>>>=>>=>>>> |
||
874 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9. return keys;>>>>=>>=>>>> |
||
875 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9. };>>>>=>>=>>>> |
||
876 | |||
877 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9. // Retrieve the values of an object's properties.>>>>=>>=>>>> |
||
878 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9. _.values = function(obj) {>>>>=>>=>>>> |
||
879 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9. var keys = _.keys(obj);>>>>=>>=>>>> |
||
880 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9. var length = keys.length;>>>>=>>=>>>> |
||
881 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9. var values = Array(length);>>>>=>>=>>>> |
||
882 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9. for (var i = 0; i < length; i++) {>>>>>=>>=>>>> |
||
883 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) { values[i] = obj[keys[i]];>>>>>=>>=>>>> |
||
884 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) { }>>>>>=>>=>>>> |
||
885 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) { return values;>>>>>=>>=>>>> |
||
886 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) { };>>>>>=>>=>>>> |
||
887 | |||
888 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) { // Convert an object into a list of `[key, value]` pairs.>>>>>=>>=>>>> |
||
889 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) { _.pairs = function(obj) {>>>>>=>>=>>>> |
||
890 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) { var keys = _.keys(obj);>>>>>=>>=>>>> |
||
891 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) { var length = keys.length;>>>>>=>>=>>>> |
||
892 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) { var pairs = Array(length);>>>>>=>>=>>>> |
||
893 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) { for (var i = 0; i < length; i++) {>>>>>>=>>=>>>> |
||
894 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) { pairs[i] = [keys[i], obj[keys[i]]];>>>>>>=>>=>>>> |
||
895 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) { }>>>>>>=>>=>>>> |
||
896 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) { return pairs;>>>>>>=>>=>>>> |
||
897 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) { };>>>>>>=>>=>>>> |
||
898 | |||
899 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) { // Invert the keys and values of an object. The values must be serializable.>>>>>>=>>=>>>> |
||
900 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) { _.invert = function(obj) {>>>>>>=>>=>>>> |
||
901 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) { var result = {};>>>>>>=>>=>>>> |
||
902 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) { var keys = _.keys(obj);>>>>>>=>>=>>>> |
||
903 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) { for (var i = 0, length = keys.length; i < length; i++) {>>>>>>>=>>=>>>> |
||
904 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) { result[obj[keys[i]]] = keys[i];>>>>>>>=>>=>>>> |
||
905 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) { }>>>>>>>=>>=>>>> |
||
906 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) { return result;>>>>>>>=>>=>>>> |
||
907 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) { };>>>>>>>=>>=>>>> |
||
908 | |||
909 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) { // Return a sorted list of the function names available on the object.>>>>>>>=>>=>>>> |
||
910 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) { // Aliased as `methods`>>>>>>>=>>=>>>> |
||
911 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) { _.functions = _.methods = function(obj) {>>>>>>>=>>=>>>> |
||
912 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) { var names = [];>>>>>>>=>>=>>>> |
||
913 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) { for (var key in obj) {>>>>>>>=>>=>>>> |
||
914 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) { if (_.isFunction(obj[key])) names.push(key);>>>>>>>=>>=>>>> |
||
915 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) { }>>>>>>>=>>=>>>> |
||
916 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) { return names.sort();>>>>>>>=>>=>>>> |
||
917 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) { };>>>>>>>=>>=>>>> |
||
918 | |||
919 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) { // Extend a given object with all the properties in passed-in object(s).>>>>>>>=>>=>>>> |
||
920 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) { _.extend = function(obj) {>>>>>>>=>>=>>>> |
||
921 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) { if (!_.isObject(obj)) return obj;>>>>>>>=>>=>>>> |
||
922 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) { var source, prop;>>>>>>>=>>=>>>> |
||
923 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) { for (var i = 1, length = arguments.length; i < length; i++) {>>>>>>>>=>>=>>>> |
||
924 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) { source = arguments[i];>>>>>>>>=>>=>>>> |
||
925 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) { for (prop in source) {>>>>>>>>=>>=>>>> |
||
926 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) { obj[prop] = source[prop];>>>>>>>>=>>=>>>> |
||
927 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) { }>>>>>>>>=>>=>>>> |
||
928 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) { }>>>>>>>>=>>=>>>> |
||
929 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) { return obj;>>>>>>>>=>>=>>>> |
||
930 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) { };>>>>>>>>=>>=>>>> |
||
931 | |||
932 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Return a copy of the object only containing the whitelisted properties.>>>>>>>>=>>=>>>> |
||
933 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) { _.pick = function(obj, iteratee, context) {>>>>>>>>=>>=>>>> |
||
934 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) { var result = {}, key;>>>>>>>>=>>=>>>> |
||
935 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) { if (obj == null) return result;>>>>>>>>=>>=>>>> |
||
936 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) { if (_.isFunction(iteratee)) {>>>>>>>>=>>=>>>> |
||
937 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) { iteratee = optimizeCb(iteratee, context);>>>>>>>>=>>=>>>> |
||
938 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) { for (key in obj) {>>>>>>>>=>>=>>>> |
||
939 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) { var value = obj[key];>>>>>>>>=>>=>>>> |
||
940 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) { if (iteratee(value, key, obj)) result[key] = value;>>>>>>>>=>>=>>>> |
||
941 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) { }>>>>>>>>=>>=>>>> |
||
942 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) { } else {>>>>>>>>=>>=>>>> |
||
943 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) { var keys = flatten(arguments, false, false, 1);>>>>>>>>=>>=>>>> |
||
944 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) { obj = new Object(obj);>>>>>>>>=>>=>>>> |
||
945 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) { for (var i = 0, length = keys.length; i < length; i++) {>>>>>>>>>=>>=>>>> |
||
946 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { key = keys[i];>>>>>>>>>=>>=>>>> |
||
947 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { if (key in obj) result[key] = obj[key];>>>>>>>>>=>>=>>>> |
||
948 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { }>>>>>>>>>=>>=>>>> |
||
949 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { }>>>>>>>>>=>>=>>>> |
||
950 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { return result;>>>>>>>>>=>>=>>>> |
||
951 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { };>>>>>>>>>=>>=>>>> |
||
952 | |||
953 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Return a copy of the object without the blacklisted properties.>>>>>>>>>=>>=>>>> |
||
954 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { _.omit = function(obj, iteratee, context) {>>>>>>>>>=>>=>>>> |
||
955 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { if (_.isFunction(iteratee)) {>>>>>>>>>=>>=>>>> |
||
956 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { iteratee = _.negate(iteratee);>>>>>>>>>=>>=>>>> |
||
957 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { } else {>>>>>>>>>=>>=>>>> |
||
958 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { var keys = _.map(flatten(arguments, false, false, 1), String);>>>>>>>>>=>>=>>>> |
||
959 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { iteratee = function(value, key) {>>>>>>>>>=>>=>>>> |
||
960 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { return !_.contains(keys, key);>>>>>>>>>=>>=>>>> |
||
961 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { };>>>>>>>>>=>>=>>>> |
||
962 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { }>>>>>>>>>=>>=>>>> |
||
963 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { return _.pick(obj, iteratee, context);>>>>>>>>>=>>=>>>> |
||
964 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { };>>>>>>>>>=>>=>>>> |
||
965 | |||
966 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Fill in a given object with default properties.>>>>>>>>>=>>=>>>> |
||
967 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { _.defaults = function(obj) {>>>>>>>>>=>>=>>>> |
||
968 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { if (!_.isObject(obj)) return obj;>>>>>>>>>=>>=>>>> |
||
969 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { for (var i = 1, length = arguments.length; i < length; i++) {>>>>>>>>>>=>>=>>>> |
||
970 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { var source = arguments[i];>>>>>>>>>>=>>=>>>> |
||
971 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { for (var prop in source) {>>>>>>>>>>=>>=>>>> |
||
972 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { if (obj[prop] === void 0) obj[prop] = source[prop];>>>>>>>>>>=>>=>>>> |
||
973 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { }>>>>>>>>>>=>>=>>>> |
||
974 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { }>>>>>>>>>>=>>=>>>> |
||
975 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { return obj;>>>>>>>>>>=>>=>>>> |
||
976 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { };>>>>>>>>>>=>>=>>>> |
||
977 | |||
978 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Create a (shallow-cloned) duplicate of an object.>>>>>>>>>>=>>=>>>> |
||
979 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { _.clone = function(obj) {>>>>>>>>>>=>>=>>>> |
||
980 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { if (!_.isObject(obj)) return obj;>>>>>>>>>>=>>=>>>> |
||
981 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { return _.isArray(obj) ? obj.slice() : _.extend({}, obj);>>>>>>>>>>=>>=>>>> |
||
982 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { };>>>>>>>>>>=>>=>>>> |
||
983 | |||
984 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Invokes interceptor with the obj, and then returns obj.>>>>>>>>>>=>>=>>>> |
||
985 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // The primary purpose of this method is to "tap into" a method chain, in>>>>>>>>>>=>>=>>>> |
||
986 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // order to perform operations on intermediate results within the chain.>>>>>>>>>>=>>=>>>> |
||
987 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { _.tap = function(obj, interceptor) {>>>>>>>>>>=>>=>>>> |
||
988 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { interceptor(obj);>>>>>>>>>>=>>=>>>> |
||
989 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { return obj;>>>>>>>>>>=>>=>>>> |
||
990 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { };>>>>>>>>>>=>>=>>>> |
||
991 | |||
992 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Internal recursive comparison function for `isEqual`.>>>>>>>>>>=>>=>>>> |
||
993 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { var eq = function(a, b, aStack, bStack) {>>>>>>>>>>=>>=>>>> |
||
994 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Identical objects are equal. `0 === -0`, but they aren't identical.>>>>>>>>>>=>>=>>>> |
||
995 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // See the [Harmony `egal` proposal](http://wiki.ecmascript.org/doku.php?id=harmony:egal).>>>>>>>>>>=>>=>>>> |
||
996 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { if (a === b) return a !== 0 || 1 / a === 1 / b;>>>>>>>>>>=>>=>>>> |
||
997 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // A strict comparison is necessary because `null == undefined`.>>>>>>>>>>=>>=>>>> |
||
998 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { if (a == null || b == null) return a === b;>>>>>>>>>>=>>=>>>> |
||
999 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Unwrap any wrapped objects.>>>>>>>>>>=>>=>>>> |
||
1000 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { if (a instanceof _) a = a._wrapped;>>>>>>>>>>=>>=>>>> |
||
1001 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { if (b instanceof _) b = b._wrapped;>>>>>>>>>>=>>=>>>> |
||
1002 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Compare `[[Class]]` names.>>>>>>>>>>=>>=>>>> |
||
1003 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { var className = toString.call(a);>>>>>>>>>>=>>=>>>> |
||
1004 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { if (className !== toString.call(b)) return false;>>>>>>>>>>=>>=>>>> |
||
1005 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { switch (className) {>>>>>>>>>>=>>=>>>> |
||
1006 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Strings, numbers, regular expressions, dates, and booleans are compared by value.>>>>>>>>>>=>>=>>>> |
||
1007 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { case '[object RegExp]':>>>>>>>>>>=>>=>>>> |
||
1008 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // RegExps are coerced to strings for comparison (Note: '' + /a/i === '/a/i')>>>>>>>>>>=>>=>>>> |
||
1009 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { case '[object String]':>>>>>>>>>>=>>=>>>> |
||
1010 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Primitives and their corresponding object wrappers are equivalent; thus, `"5"` is>>>>>>>>>>=>>=>>>> |
||
1011 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // equivalent to `new String("5")`.>>>>>>>>>>=>>=>>>> |
||
1012 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { return '' + a === '' + b;>>>>>>>>>>=>>=>>>> |
||
1013 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { case '[object Number]':>>>>>>>>>>=>>=>>>> |
||
1014 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // `NaN`s are equivalent, but non-reflexive.>>>>>>>>>>=>>=>>>> |
||
1015 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Object(NaN) is equivalent to NaN>>>>>>>>>>=>>=>>>> |
||
1016 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { if (+a !== +a) return +b !== +b;>>>>>>>>>>=>>=>>>> |
||
1017 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // An `egal` comparison is performed for other numeric values.>>>>>>>>>>=>>=>>>> |
||
1018 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { return +a === 0 ? 1 / +a === 1 / b : +a === +b;>>>>>>>>>>=>>=>>>> |
||
1019 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { case '[object Date]':>>>>>>>>>>=>>=>>>> |
||
1020 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { case '[object Boolean]':>>>>>>>>>>=>>=>>>> |
||
1021 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Coerce dates and booleans to numeric primitive values. Dates are compared by their>>>>>>>>>>=>>=>>>> |
||
1022 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // millisecond representations. Note that invalid dates with millisecond representations>>>>>>>>>>=>>=>>>> |
||
1023 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // of `NaN` are not equivalent.>>>>>>>>>>=>>=>>>> |
||
1024 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { return +a === +b;>>>>>>>>>>=>>=>>>> |
||
1025 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { }>>>>>>>>>>=>>=>>>> |
||
1026 | |||
1027 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { var areArrays = className === '[object Array]';>>>>>>>>>>=>>=>>>> |
||
1028 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { if (!areArrays) {>>>>>>>>>>=>>=>>>> |
||
1029 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { if (typeof a != 'object' || typeof b != 'object') return false;>>>>>>>>>>=>>=>>>> |
||
1030 | |||
1031 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Objects with different constructors are not equivalent, but `Object`s or `Array`s>>>>>>>>>>=>>=>>>> |
||
1032 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // from different frames are.>>>>>>>>>>=>>=>>>> |
||
1033 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { var aCtor = a.constructor, bCtor = b.constructor;>>>>>>>>>>=>>=>>>> |
||
1034 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { if (aCtor !== bCtor && !(_.isFunction(aCtor) && aCtor instanceof aCtor &&>>>>>>>>>>=>>=>>>> |
||
1035 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { _.isFunction(bCtor) && bCtor instanceof bCtor)>>>>>>>>>>=>>=>>>> |
||
1036 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { && ('constructor' in a && 'constructor' in b)) {>>>>>>>>>>=>>=>>>> |
||
1037 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { return false;>>>>>>>>>>=>>=>>>> |
||
1038 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { }>>>>>>>>>>=>>=>>>> |
||
1039 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { }>>>>>>>>>>=>>=>>>> |
||
1040 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Assume equality for cyclic structures. The algorithm for detecting cyclic>>>>>>>>>>=>>=>>>> |
||
1041 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // structures is adapted from ES 5.1 section 15.12.3, abstract operation `JO`.>>>>>>>>>>=>>=>>>> |
||
1042 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { var length = aStack.length;>>>>>>>>>>=>>=>>>> |
||
1043 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { while (length--) {>>>>>>>>>>=>>=>>>> |
||
1044 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Linear search. Performance is inversely proportional to the number of>>>>>>>>>>=>>=>>>> |
||
1045 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // unique nested structures.>>>>>>>>>>=>>=>>>> |
||
1046 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { if (aStack[length] === a) return bStack[length] === b;>>>>>>>>>>=>>=>>>> |
||
1047 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { }>>>>>>>>>>=>>=>>>> |
||
1048 | |||
1049 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Add the first object to the stack of traversed objects.>>>>>>>>>>=>>=>>>> |
||
1050 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { aStack.push(a);>>>>>>>>>>=>>=>>>> |
||
1051 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { bStack.push(b);>>>>>>>>>>=>>=>>>> |
||
1052 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { var size, result;>>>>>>>>>>=>>=>>>> |
||
1053 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Recursively compare objects and arrays.>>>>>>>>>>=>>=>>>> |
||
1054 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { if (areArrays) {>>>>>>>>>>=>>=>>>> |
||
1055 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Compare array lengths to determine if a deep comparison is necessary.>>>>>>>>>>=>>=>>>> |
||
1056 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { size = a.length;>>>>>>>>>>=>>=>>>> |
||
1057 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { result = size === b.length;>>>>>>>>>>=>>=>>>> |
||
1058 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { if (result) {>>>>>>>>>>=>>=>>>> |
||
1059 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Deep compare the contents, ignoring non-numeric properties.>>>>>>>>>>=>>=>>>> |
||
1060 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { while (size--) {>>>>>>>>>>=>>=>>>> |
||
1061 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { if (!(result = eq(a[size], b[size], aStack, bStack))) break;>>>>>>>>>>=>>=>>>> |
||
1062 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { }>>>>>>>>>>=>>=>>>> |
||
1063 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { }>>>>>>>>>>=>>=>>>> |
||
1064 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { } else {>>>>>>>>>>=>>=>>>> |
||
1065 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Deep compare objects.>>>>>>>>>>=>>=>>>> |
||
1066 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { var keys = _.keys(a), key;>>>>>>>>>>=>>=>>>> |
||
1067 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { size = keys.length;>>>>>>>>>>=>>=>>>> |
||
1068 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Ensure that both objects contain the same number of properties before comparing deep equality.>>>>>>>>>>=>>=>>>> |
||
1069 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { result = _.keys(b).length === size;>>>>>>>>>>=>>=>>>> |
||
1070 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { if (result) {>>>>>>>>>>=>>=>>>> |
||
1071 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { while (size--) {>>>>>>>>>>=>>=>>>> |
||
1072 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Deep compare each member>>>>>>>>>>=>>=>>>> |
||
1073 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { key = keys[size];>>>>>>>>>>=>>=>>>> |
||
1074 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { if (!(result = _.has(b, key) && eq(a[key], b[key], aStack, bStack))) break;>>>>>>>>>>=>>=>>>> |
||
1075 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { }>>>>>>>>>>=>>=>>>> |
||
1076 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { }>>>>>>>>>>=>>=>>>> |
||
1077 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { }>>>>>>>>>>=>>=>>>> |
||
1078 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Remove the first object from the stack of traversed objects.>>>>>>>>>>=>>=>>>> |
||
1079 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { aStack.pop();>>>>>>>>>>=>>=>>>> |
||
1080 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { bStack.pop();>>>>>>>>>>=>>=>>>> |
||
1081 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { return result;>>>>>>>>>>=>>=>>>> |
||
1082 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { };>>>>>>>>>>=>>=>>>> |
||
1083 | |||
1084 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Perform a deep comparison to check if two objects are equal.>>>>>>>>>>=>>=>>>> |
||
1085 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { _.isEqual = function(a, b) {>>>>>>>>>>=>>=>>>> |
||
1086 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { return eq(a, b, [], []);>>>>>>>>>>=>>=>>>> |
||
1087 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { };>>>>>>>>>>=>>=>>>> |
||
1088 | |||
1089 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Is a given array, string, or object empty?>>>>>>>>>>=>>=>>>> |
||
1090 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // An "empty" object has no enumerable own-properties.>>>>>>>>>>=>>=>>>> |
||
1091 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { _.isEmpty = function(obj) {>>>>>>>>>>=>>=>>>> |
||
1092 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { if (obj == null) return true;>>>>>>>>>>=>>=>>>> |
||
1093 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { if (_.isArray(obj) || _.isString(obj) || _.isArguments(obj)) return obj.length === 0;>>>>>>>>>>=>>=>>>> |
||
1094 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { for (var key in obj) if (_.has(obj, key)) return false;>>>>>>>>>>=>>=>>>> |
||
1095 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { return true;>>>>>>>>>>=>>=>>>> |
||
1096 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { };>>>>>>>>>>=>>=>>>> |
||
1097 | |||
1098 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Is a given value a DOM element?>>>>>>>>>>=>>=>>>> |
||
1099 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { _.isElement = function(obj) {>>>>>>>>>>=>>=>>>> |
||
1100 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { return !!(obj && obj.nodeType === 1);>>>>>>>>>>=>>=>>>> |
||
1101 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { };>>>>>>>>>>=>>=>>>> |
||
1102 | |||
1103 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Is a given value an array?>>>>>>>>>>=>>=>>>> |
||
1104 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Delegates to ECMA5's native Array.isArray>>>>>>>>>>=>>=>>>> |
||
1105 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { _.isArray = nativeIsArray || function(obj) {>>>>>>>>>>=>>=>>>> |
||
1106 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { return toString.call(obj) === '[object Array]';>>>>>>>>>>=>>=>>>> |
||
1107 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { };>>>>>>>>>>=>>=>>>> |
||
1108 | |||
1109 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Is a given variable an object?>>>>>>>>>>=>>=>>>> |
||
1110 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { _.isObject = function(obj) {>>>>>>>>>>=>>=>>>> |
||
1111 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { var type = typeof obj;>>>>>>>>>>=>>=>>>> |
||
1112 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { return type === 'function' || type === 'object' && !!obj;>>>>>>>>>>=>>=>>>> |
||
1113 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { };>>>>>>>>>>=>>=>>>> |
||
1114 | |||
1115 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Add some isType methods: isArguments, isFunction, isString, isNumber, isDate, isRegExp, isError.>>>>>>>>>>=>>=>>>> |
||
1116 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { _.each(['Arguments', 'Function', 'String', 'Number', 'Date', 'RegExp', 'Error'], function(name) {>>>>>>>>>>=>>=>>>> |
||
1117 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { _['is' + name] = function(obj) {>>>>>>>>>>=>>=>>>> |
||
1118 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { return toString.call(obj) === '[object ' + name + ']';>>>>>>>>>>=>>=>>>> |
||
1119 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { };>>>>>>>>>>=>>=>>>> |
||
1120 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { });>>>>>>>>>>=>>=>>>> |
||
1121 | |||
1122 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Define a fallback version of the method in browsers (ahem, IE < 9), where>>>>>>>>>>=>>=>>>> |
||
1123 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // there isn't any inspectable "Arguments" type.>>>>>>>>>>=>>=>>>> |
||
1124 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { if (!_.isArguments(arguments)) {>>>>>>>>>>=>>=>>>> |
||
1125 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { _.isArguments = function(obj) {>>>>>>>>>>=>>=>>>> |
||
1126 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { return _.has(obj, 'callee');>>>>>>>>>>=>>=>>>> |
||
1127 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { };>>>>>>>>>>=>>=>>>> |
||
1128 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { }>>>>>>>>>>=>>=>>>> |
||
1129 | |||
1130 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Optimize `isFunction` if appropriate. Work around an IE 11 bug.>>>>>>>>>>=>>=>>>> |
||
1131 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { if (typeof /./ !== 'function') {>>>>>>>>>>=>>=>>>> |
||
1132 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { _.isFunction = function(obj) {>>>>>>>>>>=>>=>>>> |
||
1133 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { return typeof obj == 'function' || false;>>>>>>>>>>=>>=>>>> |
||
1134 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { };>>>>>>>>>>=>>=>>>> |
||
1135 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { }>>>>>>>>>>=>>=>>>> |
||
1136 | |||
1137 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Is a given object a finite number?>>>>>>>>>>=>>=>>>> |
||
1138 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { _.isFinite = function(obj) {>>>>>>>>>>=>>=>>>> |
||
1139 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { return isFinite(obj) && !isNaN(parseFloat(obj));>>>>>>>>>>=>>=>>>> |
||
1140 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { };>>>>>>>>>>=>>=>>>> |
||
1141 | |||
1142 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Is the given value `NaN`? (NaN is the only number which does not equal itself).>>>>>>>>>>=>>=>>>> |
||
1143 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { _.isNaN = function(obj) {>>>>>>>>>>=>>=>>>> |
||
1144 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { return _.isNumber(obj) && obj !== +obj;>>>>>>>>>>=>>=>>>> |
||
1145 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { };>>>>>>>>>>=>>=>>>> |
||
1146 | |||
1147 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Is a given value a boolean?>>>>>>>>>>=>>=>>>> |
||
1148 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { _.isBoolean = function(obj) {>>>>>>>>>>=>>=>>>> |
||
1149 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { return obj === true || obj === false || toString.call(obj) === '[object Boolean]';>>>>>>>>>>=>>=>>>> |
||
1150 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { };>>>>>>>>>>=>>=>>>> |
||
1151 | |||
1152 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Is a given value equal to null?>>>>>>>>>>=>>=>>>> |
||
1153 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { _.isNull = function(obj) {>>>>>>>>>>=>>=>>>> |
||
1154 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { return obj === null;>>>>>>>>>>=>>=>>>> |
||
1155 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { };>>>>>>>>>>=>>=>>>> |
||
1156 | |||
1157 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Is a given variable undefined?>>>>>>>>>>=>>=>>>> |
||
1158 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { _.isUndefined = function(obj) {>>>>>>>>>>=>>=>>>> |
||
1159 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { return obj === void 0;>>>>>>>>>>=>>=>>>> |
||
1160 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { };>>>>>>>>>>=>>=>>>> |
||
1161 | |||
1162 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Shortcut function for checking if an object has a given property directly>>>>>>>>>>=>>=>>>> |
||
1163 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // on itself (in other words, not on a prototype).>>>>>>>>>>=>>=>>>> |
||
1164 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { _.has = function(obj, key) {>>>>>>>>>>=>>=>>>> |
||
1165 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { return obj != null && hasOwnProperty.call(obj, key);>>>>>>>>>>=>>=>>>> |
||
1166 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { };>>>>>>>>>>=>>=>>>> |
||
1167 | |||
1168 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Utility Functions>>>>>>>>>>=>>=>>>> |
||
1169 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // ----------------->>>>>>>>>>=>>=>>>> |
||
1170 | |||
1171 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Run Underscore.js in *noConflict* mode, returning the `_` variable to its>>>>>>>>>>=>>=>>>> |
||
1172 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // previous owner. Returns a reference to the Underscore object.>>>>>>>>>>=>>=>>>> |
||
1173 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { _.noConflict = function() {>>>>>>>>>>=>>=>>>> |
||
1174 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { root._ = previousUnderscore;>>>>>>>>>>=>>=>>>> |
||
1175 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { return this;>>>>>>>>>>=>>=>>>> |
||
1176 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { };>>>>>>>>>>=>>=>>>> |
||
1177 | |||
1178 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Keep the identity function around for default iteratees.>>>>>>>>>>=>>=>>>> |
||
1179 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { _.identity = function(value) {>>>>>>>>>>=>>=>>>> |
||
1180 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { return value;>>>>>>>>>>=>>=>>>> |
||
1181 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { };>>>>>>>>>>=>>=>>>> |
||
1182 | |||
1183 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Predicate-generating functions. Often useful outside of Underscore.>>>>>>>>>>=>>=>>>> |
||
1184 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { _.constant = function(value) {>>>>>>>>>>=>>=>>>> |
||
1185 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { return function() {>>>>>>>>>>=>>=>>>> |
||
1186 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { return value;>>>>>>>>>>=>>=>>>> |
||
1187 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { };>>>>>>>>>>=>>=>>>> |
||
1188 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { };>>>>>>>>>>=>>=>>>> |
||
1189 | |||
1190 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { _.noop = function(){};>>>>>>>>>>=>>=>>>> |
||
1191 | |||
1192 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { _.property = function(key) {>>>>>>>>>>=>>=>>>> |
||
1193 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { return function(obj) {>>>>>>>>>>=>>=>>>> |
||
1194 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { return obj == null ? void 0 : obj[key];>>>>>>>>>>=>>=>>>> |
||
1195 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { };>>>>>>>>>>=>>=>>>> |
||
1196 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { };>>>>>>>>>>=>>=>>>> |
||
1197 | |||
1198 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Returns a predicate for checking whether an object has a given set of `key:value` pairs.>>>>>>>>>>=>>=>>>> |
||
1199 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { _.matches = function(attrs) {>>>>>>>>>>=>>=>>>> |
||
1200 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { var pairs = _.pairs(attrs), length = pairs.length;>>>>>>>>>>=>>=>>>> |
||
1201 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { return function(obj) {>>>>>>>>>>=>>=>>>> |
||
1202 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { if (obj == null) return !length;>>>>>>>>>>=>>=>>>> |
||
1203 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { obj = new Object(obj);>>>>>>>>>>=>>=>>>> |
||
1204 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { for (var i = 0; i < length; i++) {>>>>>>>>>>=>>=>>>> |
||
1205 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { var pair = pairs[i], key = pair[0];>>>>>>>>>>=>>=>>>> |
||
1206 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { if (pair[1] !== obj[key] || !(key in obj)) return false;>>>>>>>>>>=>>=>>>> |
||
1207 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { }>>>>>>>>>>=>>=>>>> |
||
1208 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { return true;>>>>>>>>>>=>>=>>>> |
||
1209 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { };>>>>>>>>>>=>>=>>>> |
||
1210 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { };>>>>>>>>>>=>>=>>>> |
||
1211 | |||
1212 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Run a function **n** times.>>>>>>>>>>=>>=>>>> |
||
1213 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { _.times = function(n, iteratee, context) {>>>>>>>>>>=>>=>>>> |
||
1214 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { var accum = Array(Math.max(0, n));>>>>>>>>>>=>>=>>>> |
||
1215 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { iteratee = optimizeCb(iteratee, context, 1);>>>>>>>>>>=>>=>>>> |
||
1216 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { for (var i = 0; i < n; i++) accum[i] = iteratee(i);>>>>>>>>>>=>>=>>>> |
||
1217 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { return accum;>>>>>>>>>>=>>=>>>> |
||
1218 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { };>>>>>>>>>>=>>=>>>> |
||
1219 | |||
1220 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Return a random integer between min and max (inclusive).>>>>>>>>>>=>>=>>>> |
||
1221 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { _.random = function(min, max) {>>>>>>>>>>=>>=>>>> |
||
1222 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { if (max == null) {>>>>>>>>>>=>>=>>>> |
||
1223 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { max = min;>>>>>>>>>>=>>=>>>> |
||
1224 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { min = 0;>>>>>>>>>>=>>=>>>> |
||
1225 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { }>>>>>>>>>>=>>=>>>> |
||
1226 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { return min + Math.floor(Math.random() * (max - min + 1));>>>>>>>>>>=>>=>>>> |
||
1227 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { };>>>>>>>>>>=>>=>>>> |
||
1228 | |||
1229 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // A (possibly faster) way to get the current timestamp as an integer.>>>>>>>>>>=>>=>>>> |
||
1230 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { _.now = Date.now || function() {>>>>>>>>>>=>>=>>>> |
||
1231 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { return new Date().getTime();>>>>>>>>>>=>>=>>>> |
||
1232 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { };>>>>>>>>>>=>>=>>>> |
||
1233 | |||
1234 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // List of HTML entities for escaping.>>>>>>>>>>=>>=>>>> |
||
1235 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { var escapeMap = {>>>>>>>>>>=>>=>>>> |
||
1236 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { '&': '&',>>>>>>>>>>=>>=>>>> |
||
1237 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { '<': '<',>>>>>>>>>>=>>=>>>> |
||
1238 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { '>': '>',>>>>>>>>>>=>>=>>>> |
||
1239 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { '"': '"',>>>>>>>>>>=>>=>>>> |
||
1240 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { "'": ''',>>>>>>>>>>=>>=>>>> |
||
1241 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { '`': '`'>>>>>>>>>>=>>=>>>> |
||
1242 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { };>>>>>>>>>>=>>=>>>> |
||
1243 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { var unescapeMap = _.invert(escapeMap);>>>>>>>>>>=>>=>>>> |
||
1244 | |||
1245 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Functions for escaping and unescaping strings to/from HTML interpolation.>>>>>>>>>>=>>=>>>> |
||
1246 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { var createEscaper = function(map) {>>>>>>>>>>=>>=>>>> |
||
1247 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { var escaper = function(match) {>>>>>>>>>>=>>=>>>> |
||
1248 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { return map[match];>>>>>>>>>>=>>=>>>> |
||
1249 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { };>>>>>>>>>>=>>=>>>> |
||
1250 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Regexes for identifying a key that needs to be escaped>>>>>>>>>>=>>=>>>> |
||
1251 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { var source = '(?:' + _.keys(map).join('|') + ')';>>>>>>>>>>=>>=>>>> |
||
1252 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { var testRegexp = RegExp(source);>>>>>>>>>>=>>=>>>> |
||
1253 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { var replaceRegexp = RegExp(source, 'g');>>>>>>>>>>=>>=>>>> |
||
1254 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { return function(string) {>>>>>>>>>>=>>=>>>> |
||
1255 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { string = string == null ? '' : '' + string;>>>>>>>>>>=>>=>>>> |
||
1256 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { return testRegexp.test(string) ? string.replace(replaceRegexp, escaper) : string;>>>>>>>>>>=>>=>>>> |
||
1257 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { };>>>>>>>>>>=>>=>>>> |
||
1258 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { };>>>>>>>>>>=>>=>>>> |
||
1259 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { _.escape = createEscaper(escapeMap);>>>>>>>>>>=>>=>>>> |
||
1260 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { _.unescape = createEscaper(unescapeMap);>>>>>>>>>>=>>=>>>> |
||
1261 | |||
1262 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // If the value of the named `property` is a function then invoke it with the>>>>>>>>>>=>>=>>>> |
||
1263 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // `object` as context; otherwise, return it.>>>>>>>>>>=>>=>>>> |
||
1264 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { _.result = function(object, property, fallback) {>>>>>>>>>>=>>=>>>> |
||
1265 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { var value = object == null ? void 0 : object[property];>>>>>>>>>>=>>=>>>> |
||
1266 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { if (value === void 0) {>>>>>>>>>>=>>=>>>> |
||
1267 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { return fallback;>>>>>>>>>>=>>=>>>> |
||
1268 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { }>>>>>>>>>>=>>=>>>> |
||
1269 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { return _.isFunction(value) ? object[property]() : value;>>>>>>>>>>=>>=>>>> |
||
1270 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { };>>>>>>>>>>=>>=>>>> |
||
1271 | |||
1272 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Generate a unique integer id (unique within the entire client session).>>>>>>>>>>=>>=>>>> |
||
1273 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // Useful for temporary DOM ids.>>>>>>>>>>=>>=>>>> |
||
1274 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { var idCounter = 0;>>>>>>>>>>=>>=>>>> |
||
1275 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { _.uniqueId = function(prefix) {>>>>>>>>>>=>>=>>>> |
||
1276 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { var id = ++idCounter + '';>>>>>>>>>>=>>=>>>> |
||
1277 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { return prefix ? prefix + id : id;>>>>>>>>>>=>>=>>>> |
||
1278 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { };>>>>>>>>>>=>>=>>>> |
||
1279 | |||
1280 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // By default, Underscore uses ERB-style template delimiters, change the>>>>>>>>>>=>>=>>>> |
||
1281 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { // following template settings to use alternative delimiters.>>>>>>>>>>=>>=>>>> |
||
1282 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { _.templateSettings = {>>>>>>>>>>=>>=>>>> |
||
1283 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) { evaluate : /<%([\s\S]+?)%>/g,%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1284 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%> interpolate : /<%=([\s\S]+?)%>/g,%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1285 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%> escape : /<%-([\s\S]+?)%>/g%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1286 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> };%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1287 | |||
1288 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> // When customizing `templateSettings`, if you don't want to define an%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1289 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> // interpolation, evaluation or escaping regex, we need one that is%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1290 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> // guaranteed not to match.%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1291 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> var noMatch = /(.)^/;%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1292 | |||
1293 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> // Certain characters need to be escaped so that they can be put into a%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1294 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> // string literal.%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1295 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> var escapes = {%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1296 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> "'": "'",%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1297 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> '\\': '\\',%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1298 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> '\r': 'r',%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1299 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> '\n': 'n',%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1300 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> '\u2028': 'u2028',%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1301 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> '\u2029': 'u2029'%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1302 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> };%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1303 | |||
1304 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> var escaper = /\\|'|\r|\n|\u2028|\u2029/g;%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1305 | |||
1306 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> var escapeChar = function(match) {%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1307 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> return '\\' + escapes[match];%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1308 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> };%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1309 | |||
1310 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> // JavaScript micro-templating, similar to John Resig's implementation.%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1311 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> // Underscore templating handles arbitrary delimiters, preserves whitespace,%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1312 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> // and correctly escapes quotes within interpolated code.%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1313 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> // NB: `oldSettings` only exists for backwards compatibility.%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1314 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> _.template = function(text, settings, oldSettings) {%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1315 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> if (!settings && oldSettings) settings = oldSettings;%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1316 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> settings = _.defaults({}, settings, _.templateSettings);%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1317 | |||
1318 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> // Combine delimiters into one regular expression via alternation.%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1319 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> var matcher = RegExp([%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1320 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> (settings.escape || noMatch).source,%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1321 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> (settings.interpolate || noMatch).source,%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1322 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> (settings.evaluate || noMatch).source%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1323 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> ].join('|') + '|$', 'g');%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1324 | |||
1325 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> // Compile the template source, escaping string literals appropriately.%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1326 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> var index = 0;%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1327 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> var source = "__p+='";%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1328 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> text.replace(matcher, function(match, escape, interpolate, evaluate, offset) {%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1329 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> source += text.slice(index, offset).replace(escaper, escapeChar);%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1330 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> index = offset + match.length;%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1331 | |||
1332 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> if (escape) {%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1333 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> source += "'+\n((__t=(" + escape + "))==null?'':_.escape(__t))+\n'";%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1334 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> } else if (interpolate) {%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1335 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> source += "'+\n((__t=(" + interpolate + "))==null?'':__t)+\n'";%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1336 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> } else if (evaluate) {%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1337 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> source += "';\n" + evaluate + "\n__p+='";%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1338 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> }%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1339 | |||
1340 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> // Adobe VMs need the match returned to produce the correct offest.%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1341 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> return match;%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1342 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> });%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1343 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> source += "';\n";%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1344 | |||
1345 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> // If a variable is not specified, place data values in local scope.%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1346 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> if (!settings.variable) source = 'with(obj||{}){\n' + source + '}\n';%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1347 | |||
1348 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> source = "var __t,__p='',__j=Array.prototype.join," +%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1349 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> "print=function(){__p+=__j.call(arguments,'');};\n" +%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1350 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> source + 'return __p;\n';%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1351 | |||
1352 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> try {%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1353 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> var render = new Function(settings.variable || 'obj', '_', source);%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1354 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> } catch (e) {%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1355 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> e.source = source;%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1356 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> throw e;%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1357 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> }%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1358 | |||
1359 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> var template = function(data) {%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1360 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> return render.call(this, data, _);%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1361 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> };%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1362 | |||
1363 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> // Provide the compiled source as a convenience for precompilation.%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1364 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> var argument = settings.variable || 'obj';%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1365 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> template.source = 'function(' + argument + '){\n' + source + '}';%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1366 | |||
1367 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> return template;%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1368 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> };%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1369 | |||
1370 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> // Add a "chain" function. Start chaining a wrapped Underscore object.%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1371 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> _.chain = function(obj) {%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1372 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> var instance = _(obj);%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1373 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> instance._chain = true;%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1374 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> return instance;%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1375 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> };%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1376 | |||
1377 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> // OOP%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1378 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> // ---------------%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1379 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> // If Underscore is called as a function, it returns a wrapped object that%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1380 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> // can be used OO-style. This wrapper holds altered versions of all the%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1381 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> // underscore functions. Wrapped objects may be chained.%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1382 | |||
1383 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> // Helper function to continue chaining intermediate results.%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1384 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> var result = function(instance, obj) {%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1385 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> return instance._chain ? _(obj).chain() : obj;%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1386 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> };%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1387 | |||
1388 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> // Add your own custom functions to the Underscore object.%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1389 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> _.mixin = function(obj) {%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1390 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> _.each(_.functions(obj), function(name) {%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1391 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> var func = _[name] = obj[name];%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1392 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> _.prototype[name] = function() {%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1393 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> var args = [this._wrapped];%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1394 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> push.apply(args, arguments);%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1395 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> return result(this, func.apply(_, args));%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1396 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> };%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1397 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> });%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1398 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> };%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1399 | |||
1400 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> // Add all of the Underscore functions to the wrapper object.%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1401 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> _.mixin(_);%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1402 | |||
1403 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> // Add all mutator Array functions to the wrapper.%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1404 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> _.each(['pop', 'push', 'reverse', 'shift', 'sort', 'splice', 'unshift'], function(name) {%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1405 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> var method = ArrayProto[name];%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1406 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> _.prototype[name] = function() {%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1407 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> var obj = this._wrapped;%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1408 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> method.apply(obj, arguments);%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1409 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> if ((name === 'shift' || name === 'splice') && obj.length === 0) delete obj[0];%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1410 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> return result(this, obj);%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1411 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> };%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1412 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> });%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1413 | |||
1414 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> // Add all accessor Array functions to the wrapper.%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1415 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> _.each(['concat', 'join', 'slice'], function(name) {%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1416 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> var method = ArrayProto[name];%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1417 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> _.prototype[name] = function() {%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1418 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> return result(this, method.apply(this._wrapped, arguments));%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1419 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> };%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1420 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> });%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1421 | |||
1422 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> // Extracts the result from a wrapped and chained object.%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1423 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> _.prototype.value = function() {%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1424 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> return this._wrapped;%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1425 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> };%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1426 | |||
1427 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> // AMD registration happens at the end for compatibility with AMD loaders%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1428 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> // that may not enforce next-turn semantics on modules. Even though general%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1429 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> // practice for AMD registration is to be anonymous, underscore registers%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1430 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> // as a named module because, like jQuery, it is a base library that is%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1431 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> // popular enough to be bundled in a third party lib, but not be part of%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1432 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> // an AMD load request. Those cases could generate an error when an%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1433 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> // anonymous define() is called outside of a loader request.%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1434 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> if (typeof define === 'function' && define.amd) {%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1435 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> define('underscore', [], function() {%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1436 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> return _;%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1437 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> });%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1438 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%> }%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |
||
1439 | < length; idx++, start += step) {< length; i++) {< arguments.length) args.push(arguments[position++]);<= 1) throw new Error('bindAll must be passed function names');< length; i++) {<= 0 || remaining >< wait && last >< 1) {< 9 that won't be iterated by `for key in ...` and thus missed.< 9.< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {< length; i++) {<%([\s\S]+?)%><%=([\s\S]+?)%><%-([\s\S]+?)%>}.call(this));%-([\s\S]+?)%>%=([\s\S]+?)%>%([\s\S]+?)%>>>>>>>>>>>=>>=>>>> |