railsy_backbone 0.0.1

Sign up to get free protection for your applications and to get access to all the features.
@@ -0,0 +1,1246 @@
1
+ // Underscore.js 1.5.1
2
+ // http://underscorejs.org
3
+ // (c) 2009-2013 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 `global` on the server.
12
+ var root = this;
13
+
14
+ // Save the previous value of the `_` variable.
15
+ var previousUnderscore = root._;
16
+
17
+ // Establish the object that gets returned to break out of a loop iteration.
18
+ var breaker = {};
19
+
20
+ // Save bytes in the minified (but not gzipped) version:
21
+ var ArrayProto = Array.prototype, ObjProto = Object.prototype, FuncProto = Function.prototype;
22
+
23
+ // Create quick reference variables for speed access to core prototypes.
24
+ var
25
+ push = ArrayProto.push,
26
+ slice = ArrayProto.slice,
27
+ concat = ArrayProto.concat,
28
+ toString = ObjProto.toString,
29
+ hasOwnProperty = ObjProto.hasOwnProperty;
30
+
31
+ // All **ECMAScript 5** native function implementations that we hope to use
32
+ // are declared here.
33
+ var
34
+ nativeForEach = ArrayProto.forEach,
35
+ nativeMap = ArrayProto.map,
36
+ nativeReduce = ArrayProto.reduce,
37
+ nativeReduceRight = ArrayProto.reduceRight,
38
+ nativeFilter = ArrayProto.filter,
39
+ nativeEvery = ArrayProto.every,
40
+ nativeSome = ArrayProto.some,
41
+ nativeIndexOf = ArrayProto.indexOf,
42
+ nativeLastIndexOf = ArrayProto.lastIndexOf,
43
+ nativeIsArray = Array.isArray,
44
+ nativeKeys = Object.keys,
45
+ nativeBind = FuncProto.bind;
46
+
47
+ // Create a safe reference to the Underscore object for use below.
48
+ var _ = function(obj) {
49
+ if (obj instanceof _) return obj;
50
+ if (!(this instanceof _)) return new _(obj);
51
+ this._wrapped = obj;
52
+ };
53
+
54
+ // Export the Underscore object for **Node.js**, with
55
+ // backwards-compatibility for the old `require()` API. If we're in
56
+ // the browser, add `_` as a global object via a string identifier,
57
+ // for Closure Compiler "advanced" mode.
58
+ if (typeof exports !== 'undefined') {
59
+ if (typeof module !== 'undefined' && module.exports) {
60
+ exports = module.exports = _;
61
+ }
62
+ exports._ = _;
63
+ } else {
64
+ root._ = _;
65
+ }
66
+
67
+ // Current version.
68
+ _.VERSION = '1.5.1';
69
+
70
+ // Collection Functions
71
+ // --------------------
72
+
73
+ // The cornerstone, an `each` implementation, aka `forEach`.
74
+ // Handles objects with the built-in `forEach`, arrays, and raw objects.
75
+ // Delegates to **ECMAScript 5**'s native `forEach` if available.
76
+ var each = _.each = _.forEach = function(obj, iterator, context) {
77
+ if (obj == null) return;
78
+ if (nativeForEach && obj.forEach === nativeForEach) {
79
+ obj.forEach(iterator, context);
80
+ } else if (obj.length === +obj.length) {
81
+ for (var i = 0, l = obj.length; i < l; i++) {
82
+ if (iterator.call(context, obj[i], i, obj) === breaker) return;
83
+ }
84
+ } else {
85
+ for (var key in obj) {
86
+ if (_.has(obj, key)) {
87
+ if (iterator.call(context, obj[key], key, obj) === breaker) return;
88
+ }
89
+ }
90
+ }
91
+ };
92
+
93
+ // Return the results of applying the iterator to each element.
94
+ // Delegates to **ECMAScript 5**'s native `map` if available.
95
+ _.map = _.collect = function(obj, iterator, context) {
96
+ var results = [];
97
+ if (obj == null) return results;
98
+ if (nativeMap && obj.map === nativeMap) return obj.map(iterator, context);
99
+ each(obj, function(value, index, list) {
100
+ results.push(iterator.call(context, value, index, list));
101
+ });
102
+ return results;
103
+ };
104
+
105
+ var reduceError = 'Reduce of empty array with no initial value';
106
+
107
+ // **Reduce** builds up a single result from a list of values, aka `inject`,
108
+ // or `foldl`. Delegates to **ECMAScript 5**'s native `reduce` if available.
109
+ _.reduce = _.foldl = _.inject = function(obj, iterator, memo, context) {
110
+ var initial = arguments.length > 2;
111
+ if (obj == null) obj = [];
112
+ if (nativeReduce && obj.reduce === nativeReduce) {
113
+ if (context) iterator = _.bind(iterator, context);
114
+ return initial ? obj.reduce(iterator, memo) : obj.reduce(iterator);
115
+ }
116
+ each(obj, function(value, index, list) {
117
+ if (!initial) {
118
+ memo = value;
119
+ initial = true;
120
+ } else {
121
+ memo = iterator.call(context, memo, value, index, list);
122
+ }
123
+ });
124
+ if (!initial) throw new TypeError(reduceError);
125
+ return memo;
126
+ };
127
+
128
+ // The right-associative version of reduce, also known as `foldr`.
129
+ // Delegates to **ECMAScript 5**'s native `reduceRight` if available.
130
+ _.reduceRight = _.foldr = function(obj, iterator, memo, context) {
131
+ var initial = arguments.length > 2;
132
+ if (obj == null) obj = [];
133
+ if (nativeReduceRight && obj.reduceRight === nativeReduceRight) {
134
+ if (context) iterator = _.bind(iterator, context);
135
+ return initial ? obj.reduceRight(iterator, memo) : obj.reduceRight(iterator);
136
+ }
137
+ var length = obj.length;
138
+ if (length !== +length) {
139
+ var keys = _.keys(obj);
140
+ length = keys.length;
141
+ }
142
+ each(obj, function(value, index, list) {
143
+ index = keys ? keys[--length] : --length;
144
+ if (!initial) {
145
+ memo = obj[index];
146
+ initial = true;
147
+ } else {
148
+ memo = iterator.call(context, memo, obj[index], index, list);
149
+ }
150
+ });
151
+ if (!initial) throw new TypeError(reduceError);
152
+ return memo;
153
+ };
154
+
155
+ // Return the first value which passes a truth test. Aliased as `detect`.
156
+ _.find = _.detect = function(obj, iterator, context) {
157
+ var result;
158
+ any(obj, function(value, index, list) {
159
+ if (iterator.call(context, value, index, list)) {
160
+ result = value;
161
+ return true;
162
+ }
163
+ });
164
+ return result;
165
+ };
166
+
167
+ // Return all the elements that pass a truth test.
168
+ // Delegates to **ECMAScript 5**'s native `filter` if available.
169
+ // Aliased as `select`.
170
+ _.filter = _.select = function(obj, iterator, context) {
171
+ var results = [];
172
+ if (obj == null) return results;
173
+ if (nativeFilter && obj.filter === nativeFilter) return obj.filter(iterator, context);
174
+ each(obj, function(value, index, list) {
175
+ if (iterator.call(context, value, index, list)) results.push(value);
176
+ });
177
+ return results;
178
+ };
179
+
180
+ // Return all the elements for which a truth test fails.
181
+ _.reject = function(obj, iterator, context) {
182
+ return _.filter(obj, function(value, index, list) {
183
+ return !iterator.call(context, value, index, list);
184
+ }, context);
185
+ };
186
+
187
+ // Determine whether all of the elements match a truth test.
188
+ // Delegates to **ECMAScript 5**'s native `every` if available.
189
+ // Aliased as `all`.
190
+ _.every = _.all = function(obj, iterator, context) {
191
+ iterator || (iterator = _.identity);
192
+ var result = true;
193
+ if (obj == null) return result;
194
+ if (nativeEvery && obj.every === nativeEvery) return obj.every(iterator, context);
195
+ each(obj, function(value, index, list) {
196
+ if (!(result = result && iterator.call(context, value, index, list))) return breaker;
197
+ });
198
+ return !!result;
199
+ };
200
+
201
+ // Determine if at least one element in the object matches a truth test.
202
+ // Delegates to **ECMAScript 5**'s native `some` if available.
203
+ // Aliased as `any`.
204
+ var any = _.some = _.any = function(obj, iterator, context) {
205
+ iterator || (iterator = _.identity);
206
+ var result = false;
207
+ if (obj == null) return result;
208
+ if (nativeSome && obj.some === nativeSome) return obj.some(iterator, context);
209
+ each(obj, function(value, index, list) {
210
+ if (result || (result = iterator.call(context, value, index, list))) return breaker;
211
+ });
212
+ return !!result;
213
+ };
214
+
215
+ // Determine if the array or object contains a given value (using `===`).
216
+ // Aliased as `include`.
217
+ _.contains = _.include = function(obj, target) {
218
+ if (obj == null) return false;
219
+ if (nativeIndexOf && obj.indexOf === nativeIndexOf) return obj.indexOf(target) != -1;
220
+ return any(obj, function(value) {
221
+ return value === target;
222
+ });
223
+ };
224
+
225
+ // Invoke a method (with arguments) on every item in a collection.
226
+ _.invoke = function(obj, method) {
227
+ var args = slice.call(arguments, 2);
228
+ var isFunc = _.isFunction(method);
229
+ return _.map(obj, function(value) {
230
+ return (isFunc ? method : value[method]).apply(value, args);
231
+ });
232
+ };
233
+
234
+ // Convenience version of a common use case of `map`: fetching a property.
235
+ _.pluck = function(obj, key) {
236
+ return _.map(obj, function(value){ return value[key]; });
237
+ };
238
+
239
+ // Convenience version of a common use case of `filter`: selecting only objects
240
+ // containing specific `key:value` pairs.
241
+ _.where = function(obj, attrs, first) {
242
+ if (_.isEmpty(attrs)) return first ? void 0 : [];
243
+ return _[first ? 'find' : 'filter'](obj, function(value) {
244
+ for (var key in attrs) {
245
+ if (attrs[key] !== value[key]) return false;
246
+ }
247
+ return true;
248
+ });
249
+ };
250
+
251
+ // Convenience version of a common use case of `find`: getting the first object
252
+ // containing specific `key:value` pairs.
253
+ _.findWhere = function(obj, attrs) {
254
+ return _.where(obj, attrs, true);
255
+ };
256
+
257
+ // Return the maximum element or (element-based computation).
258
+ // Can't optimize arrays of integers longer than 65,535 elements.
259
+ // See [WebKit Bug 80797](https://bugs.webkit.org/show_bug.cgi?id=80797)
260
+ _.max = function(obj, iterator, context) {
261
+ if (!iterator && _.isArray(obj) && obj[0] === +obj[0] && obj.length < 65535) {
262
+ return Math.max.apply(Math, obj);
263
+ }
264
+ if (!iterator && _.isEmpty(obj)) return -Infinity;
265
+ var result = {computed : -Infinity, value: -Infinity};
266
+ each(obj, function(value, index, list) {
267
+ var computed = iterator ? iterator.call(context, value, index, list) : value;
268
+ computed > result.computed && (result = {value : value, computed : computed});
269
+ });
270
+ return result.value;
271
+ };
272
+
273
+ // Return the minimum element (or element-based computation).
274
+ _.min = function(obj, iterator, context) {
275
+ if (!iterator && _.isArray(obj) && obj[0] === +obj[0] && obj.length < 65535) {
276
+ return Math.min.apply(Math, obj);
277
+ }
278
+ if (!iterator && _.isEmpty(obj)) return Infinity;
279
+ var result = {computed : Infinity, value: Infinity};
280
+ each(obj, function(value, index, list) {
281
+ var computed = iterator ? iterator.call(context, value, index, list) : value;
282
+ computed < result.computed && (result = {value : value, computed : computed});
283
+ });
284
+ return result.value;
285
+ };
286
+
287
+ // Shuffle an array.
288
+ _.shuffle = function(obj) {
289
+ var rand;
290
+ var index = 0;
291
+ var shuffled = [];
292
+ each(obj, function(value) {
293
+ rand = _.random(index++);
294
+ shuffled[index - 1] = shuffled[rand];
295
+ shuffled[rand] = value;
296
+ });
297
+ return shuffled;
298
+ };
299
+
300
+ // An internal function to generate lookup iterators.
301
+ var lookupIterator = function(value) {
302
+ return _.isFunction(value) ? value : function(obj){ return obj[value]; };
303
+ };
304
+
305
+ // Sort the object's values by a criterion produced by an iterator.
306
+ _.sortBy = function(obj, value, context) {
307
+ var iterator = lookupIterator(value);
308
+ return _.pluck(_.map(obj, function(value, index, list) {
309
+ return {
310
+ value : value,
311
+ index : index,
312
+ criteria : iterator.call(context, value, index, list)
313
+ };
314
+ }).sort(function(left, right) {
315
+ var a = left.criteria;
316
+ var b = right.criteria;
317
+ if (a !== b) {
318
+ if (a > b || a === void 0) return 1;
319
+ if (a < b || b === void 0) return -1;
320
+ }
321
+ return left.index < right.index ? -1 : 1;
322
+ }), 'value');
323
+ };
324
+
325
+ // An internal function used for aggregate "group by" operations.
326
+ var group = function(obj, value, context, behavior) {
327
+ var result = {};
328
+ var iterator = lookupIterator(value == null ? _.identity : value);
329
+ each(obj, function(value, index) {
330
+ var key = iterator.call(context, value, index, obj);
331
+ behavior(result, key, value);
332
+ });
333
+ return result;
334
+ };
335
+
336
+ // Groups the object's values by a criterion. Pass either a string attribute
337
+ // to group by, or a function that returns the criterion.
338
+ _.groupBy = function(obj, value, context) {
339
+ return group(obj, value, context, function(result, key, value) {
340
+ (_.has(result, key) ? result[key] : (result[key] = [])).push(value);
341
+ });
342
+ };
343
+
344
+ // Counts instances of an object that group by a certain criterion. Pass
345
+ // either a string attribute to count by, or a function that returns the
346
+ // criterion.
347
+ _.countBy = function(obj, value, context) {
348
+ return group(obj, value, context, function(result, key) {
349
+ if (!_.has(result, key)) result[key] = 0;
350
+ result[key]++;
351
+ });
352
+ };
353
+
354
+ // Use a comparator function to figure out the smallest index at which
355
+ // an object should be inserted so as to maintain order. Uses binary search.
356
+ _.sortedIndex = function(array, obj, iterator, context) {
357
+ iterator = iterator == null ? _.identity : lookupIterator(iterator);
358
+ var value = iterator.call(context, obj);
359
+ var low = 0, high = array.length;
360
+ while (low < high) {
361
+ var mid = (low + high) >>> 1;
362
+ iterator.call(context, array[mid]) < value ? low = mid + 1 : high = mid;
363
+ }
364
+ return low;
365
+ };
366
+
367
+ // Safely create a real, live array from anything iterable.
368
+ _.toArray = function(obj) {
369
+ if (!obj) return [];
370
+ if (_.isArray(obj)) return slice.call(obj);
371
+ if (obj.length === +obj.length) return _.map(obj, _.identity);
372
+ return _.values(obj);
373
+ };
374
+
375
+ // Return the number of elements in an object.
376
+ _.size = function(obj) {
377
+ if (obj == null) return 0;
378
+ return (obj.length === +obj.length) ? obj.length : _.keys(obj).length;
379
+ };
380
+
381
+ // Array Functions
382
+ // ---------------
383
+
384
+ // Get the first element of an array. Passing **n** will return the first N
385
+ // values in the array. Aliased as `head` and `take`. The **guard** check
386
+ // allows it to work with `_.map`.
387
+ _.first = _.head = _.take = function(array, n, guard) {
388
+ if (array == null) return void 0;
389
+ return (n != null) && !guard ? slice.call(array, 0, n) : array[0];
390
+ };
391
+
392
+ // Returns everything but the last entry of the array. Especially useful on
393
+ // the arguments object. Passing **n** will return all the values in
394
+ // the array, excluding the last N. The **guard** check allows it to work with
395
+ // `_.map`.
396
+ _.initial = function(array, n, guard) {
397
+ return slice.call(array, 0, array.length - ((n == null) || guard ? 1 : n));
398
+ };
399
+
400
+ // Get the last element of an array. Passing **n** will return the last N
401
+ // values in the array. The **guard** check allows it to work with `_.map`.
402
+ _.last = function(array, n, guard) {
403
+ if (array == null) return void 0;
404
+ if ((n != null) && !guard) {
405
+ return slice.call(array, Math.max(array.length - n, 0));
406
+ } else {
407
+ return array[array.length - 1];
408
+ }
409
+ };
410
+
411
+ // Returns everything but the first entry of the array. Aliased as `tail` and `drop`.
412
+ // Especially useful on the arguments object. Passing an **n** will return
413
+ // the rest N values in the array. The **guard**
414
+ // check allows it to work with `_.map`.
415
+ _.rest = _.tail = _.drop = function(array, n, guard) {
416
+ return slice.call(array, (n == null) || guard ? 1 : n);
417
+ };
418
+
419
+ // Trim out all falsy values from an array.
420
+ _.compact = function(array) {
421
+ return _.filter(array, _.identity);
422
+ };
423
+
424
+ // Internal implementation of a recursive `flatten` function.
425
+ var flatten = function(input, shallow, output) {
426
+ if (shallow && _.every(input, _.isArray)) {
427
+ return concat.apply(output, input);
428
+ }
429
+ each(input, function(value) {
430
+ if (_.isArray(value) || _.isArguments(value)) {
431
+ shallow ? push.apply(output, value) : flatten(value, shallow, output);
432
+ } else {
433
+ output.push(value);
434
+ }
435
+ });
436
+ return output;
437
+ };
438
+
439
+ // Return a completely flattened version of an array.
440
+ _.flatten = function(array, shallow) {
441
+ return flatten(array, shallow, []);
442
+ };
443
+
444
+ // Return a version of the array that does not contain the specified value(s).
445
+ _.without = function(array) {
446
+ return _.difference(array, slice.call(arguments, 1));
447
+ };
448
+
449
+ // Produce a duplicate-free version of the array. If the array has already
450
+ // been sorted, you have the option of using a faster algorithm.
451
+ // Aliased as `unique`.
452
+ _.uniq = _.unique = function(array, isSorted, iterator, context) {
453
+ if (_.isFunction(isSorted)) {
454
+ context = iterator;
455
+ iterator = isSorted;
456
+ isSorted = false;
457
+ }
458
+ var initial = iterator ? _.map(array, iterator, context) : array;
459
+ var results = [];
460
+ var seen = [];
461
+ each(initial, function(value, index) {
462
+ if (isSorted ? (!index || seen[seen.length - 1] !== value) : !_.contains(seen, value)) {
463
+ seen.push(value);
464
+ results.push(array[index]);
465
+ }
466
+ });
467
+ return results;
468
+ };
469
+
470
+ // Produce an array that contains the union: each distinct element from all of
471
+ // the passed-in arrays.
472
+ _.union = function() {
473
+ return _.uniq(_.flatten(arguments, true));
474
+ };
475
+
476
+ // Produce an array that contains every item shared between all the
477
+ // passed-in arrays.
478
+ _.intersection = function(array) {
479
+ var rest = slice.call(arguments, 1);
480
+ return _.filter(_.uniq(array), function(item) {
481
+ return _.every(rest, function(other) {
482
+ return _.indexOf(other, item) >= 0;
483
+ });
484
+ });
485
+ };
486
+
487
+ // Take the difference between one array and a number of other arrays.
488
+ // Only the elements present in just the first array will remain.
489
+ _.difference = function(array) {
490
+ var rest = concat.apply(ArrayProto, slice.call(arguments, 1));
491
+ return _.filter(array, function(value){ return !_.contains(rest, value); });
492
+ };
493
+
494
+ // Zip together multiple lists into a single array -- elements that share
495
+ // an index go together.
496
+ _.zip = function() {
497
+ var length = _.max(_.pluck(arguments, "length").concat(0));
498
+ var results = new Array(length);
499
+ for (var i = 0; i < length; i++) {
500
+ results[i] = _.pluck(arguments, '' + i);
501
+ }
502
+ return results;
503
+ };
504
+
505
+ // Converts lists into objects. Pass either a single array of `[key, value]`
506
+ // pairs, or two parallel arrays of the same length -- one of keys, and one of
507
+ // the corresponding values.
508
+ _.object = function(list, values) {
509
+ if (list == null) return {};
510
+ var result = {};
511
+ for (var i = 0, l = list.length; i < l; i++) {
512
+ if (values) {
513
+ result[list[i]] = values[i];
514
+ } else {
515
+ result[list[i][0]] = list[i][1];
516
+ }
517
+ }
518
+ return result;
519
+ };
520
+
521
+ // If the browser doesn't supply us with indexOf (I'm looking at you, **MSIE**),
522
+ // we need this function. Return the position of the first occurrence of an
523
+ // item in an array, or -1 if the item is not included in the array.
524
+ // Delegates to **ECMAScript 5**'s native `indexOf` if available.
525
+ // If the array is large and already in sort order, pass `true`
526
+ // for **isSorted** to use binary search.
527
+ _.indexOf = function(array, item, isSorted) {
528
+ if (array == null) return -1;
529
+ var i = 0, l = array.length;
530
+ if (isSorted) {
531
+ if (typeof isSorted == 'number') {
532
+ i = (isSorted < 0 ? Math.max(0, l + isSorted) : isSorted);
533
+ } else {
534
+ i = _.sortedIndex(array, item);
535
+ return array[i] === item ? i : -1;
536
+ }
537
+ }
538
+ if (nativeIndexOf && array.indexOf === nativeIndexOf) return array.indexOf(item, isSorted);
539
+ for (; i < l; i++) if (array[i] === item) return i;
540
+ return -1;
541
+ };
542
+
543
+ // Delegates to **ECMAScript 5**'s native `lastIndexOf` if available.
544
+ _.lastIndexOf = function(array, item, from) {
545
+ if (array == null) return -1;
546
+ var hasIndex = from != null;
547
+ if (nativeLastIndexOf && array.lastIndexOf === nativeLastIndexOf) {
548
+ return hasIndex ? array.lastIndexOf(item, from) : array.lastIndexOf(item);
549
+ }
550
+ var i = (hasIndex ? from : array.length);
551
+ while (i--) if (array[i] === item) return i;
552
+ return -1;
553
+ };
554
+
555
+ // Generate an integer Array containing an arithmetic progression. A port of
556
+ // the native Python `range()` function. See
557
+ // [the Python documentation](http://docs.python.org/library/functions.html#range).
558
+ _.range = function(start, stop, step) {
559
+ if (arguments.length <= 1) {
560
+ stop = start || 0;
561
+ start = 0;
562
+ }
563
+ step = arguments[2] || 1;
564
+
565
+ var len = Math.max(Math.ceil((stop - start) / step), 0);
566
+ var idx = 0;
567
+ var range = new Array(len);
568
+
569
+ while(idx < len) {
570
+ range[idx++] = start;
571
+ start += step;
572
+ }
573
+
574
+ return range;
575
+ };
576
+
577
+ // Function (ahem) Functions
578
+ // ------------------
579
+
580
+ // Reusable constructor function for prototype setting.
581
+ var ctor = function(){};
582
+
583
+ // Create a function bound to a given object (assigning `this`, and arguments,
584
+ // optionally). Delegates to **ECMAScript 5**'s native `Function.bind` if
585
+ // available.
586
+ _.bind = function(func, context) {
587
+ var args, bound;
588
+ if (nativeBind && func.bind === nativeBind) return nativeBind.apply(func, slice.call(arguments, 1));
589
+ if (!_.isFunction(func)) throw new TypeError;
590
+ args = slice.call(arguments, 2);
591
+ return bound = function() {
592
+ if (!(this instanceof bound)) return func.apply(context, args.concat(slice.call(arguments)));
593
+ ctor.prototype = func.prototype;
594
+ var self = new ctor;
595
+ ctor.prototype = null;
596
+ var result = func.apply(self, args.concat(slice.call(arguments)));
597
+ if (Object(result) === result) return result;
598
+ return self;
599
+ };
600
+ };
601
+
602
+ // Partially apply a function by creating a version that has had some of its
603
+ // arguments pre-filled, without changing its dynamic `this` context.
604
+ _.partial = function(func) {
605
+ var args = slice.call(arguments, 1);
606
+ return function() {
607
+ return func.apply(this, args.concat(slice.call(arguments)));
608
+ };
609
+ };
610
+
611
+ // Bind all of an object's methods to that object. Useful for ensuring that
612
+ // all callbacks defined on an object belong to it.
613
+ _.bindAll = function(obj) {
614
+ var funcs = slice.call(arguments, 1);
615
+ if (funcs.length === 0) throw new Error("bindAll must be passed function names");
616
+ each(funcs, function(f) { obj[f] = _.bind(obj[f], obj); });
617
+ return obj;
618
+ };
619
+
620
+ // Memoize an expensive function by storing its results.
621
+ _.memoize = function(func, hasher) {
622
+ var memo = {};
623
+ hasher || (hasher = _.identity);
624
+ return function() {
625
+ var key = hasher.apply(this, arguments);
626
+ return _.has(memo, key) ? memo[key] : (memo[key] = func.apply(this, arguments));
627
+ };
628
+ };
629
+
630
+ // Delays a function for the given number of milliseconds, and then calls
631
+ // it with the arguments supplied.
632
+ _.delay = function(func, wait) {
633
+ var args = slice.call(arguments, 2);
634
+ return setTimeout(function(){ return func.apply(null, args); }, wait);
635
+ };
636
+
637
+ // Defers a function, scheduling it to run after the current call stack has
638
+ // cleared.
639
+ _.defer = function(func) {
640
+ return _.delay.apply(_, [func, 1].concat(slice.call(arguments, 1)));
641
+ };
642
+
643
+ // Returns a function, that, when invoked, will only be triggered at most once
644
+ // during a given window of time. Normally, the throttled function will run
645
+ // as much as it can, without ever going more than once per `wait` duration;
646
+ // but if you'd like to disable the execution on the leading edge, pass
647
+ // `{leading: false}`. To disable execution on the trailing edge, ditto.
648
+ _.throttle = function(func, wait, options) {
649
+ var context, args, result;
650
+ var timeout = null;
651
+ var previous = 0;
652
+ options || (options = {});
653
+ var later = function() {
654
+ previous = options.leading === false ? 0 : new Date;
655
+ timeout = null;
656
+ result = func.apply(context, args);
657
+ };
658
+ return function() {
659
+ var now = new Date;
660
+ if (!previous && options.leading === false) previous = now;
661
+ var remaining = wait - (now - previous);
662
+ context = this;
663
+ args = arguments;
664
+ if (remaining <= 0) {
665
+ clearTimeout(timeout);
666
+ timeout = null;
667
+ previous = now;
668
+ result = func.apply(context, args);
669
+ } else if (!timeout && options.trailing !== false) {
670
+ timeout = setTimeout(later, remaining);
671
+ }
672
+ return result;
673
+ };
674
+ };
675
+
676
+ // Returns a function, that, as long as it continues to be invoked, will not
677
+ // be triggered. The function will be called after it stops being called for
678
+ // N milliseconds. If `immediate` is passed, trigger the function on the
679
+ // leading edge, instead of the trailing.
680
+ _.debounce = function(func, wait, immediate) {
681
+ var result;
682
+ var timeout = null;
683
+ return function() {
684
+ var context = this, args = arguments;
685
+ var later = function() {
686
+ timeout = null;
687
+ if (!immediate) result = func.apply(context, args);
688
+ };
689
+ var callNow = immediate && !timeout;
690
+ clearTimeout(timeout);
691
+ timeout = setTimeout(later, wait);
692
+ if (callNow) result = func.apply(context, args);
693
+ return result;
694
+ };
695
+ };
696
+
697
+ // Returns a function that will be executed at most one time, no matter how
698
+ // often you call it. Useful for lazy initialization.
699
+ _.once = function(func) {
700
+ var ran = false, memo;
701
+ return function() {
702
+ if (ran) return memo;
703
+ ran = true;
704
+ memo = func.apply(this, arguments);
705
+ func = null;
706
+ return memo;
707
+ };
708
+ };
709
+
710
+ // Returns the first function passed as an argument to the second,
711
+ // allowing you to adjust arguments, run code before and after, and
712
+ // conditionally execute the original function.
713
+ _.wrap = function(func, wrapper) {
714
+ return function() {
715
+ var args = [func];
716
+ push.apply(args, arguments);
717
+ return wrapper.apply(this, args);
718
+ };
719
+ };
720
+
721
+ // Returns a function that is the composition of a list of functions, each
722
+ // consuming the return value of the function that follows.
723
+ _.compose = function() {
724
+ var funcs = arguments;
725
+ return function() {
726
+ var args = arguments;
727
+ for (var i = funcs.length - 1; i >= 0; i--) {
728
+ args = [funcs[i].apply(this, args)];
729
+ }
730
+ return args[0];
731
+ };
732
+ };
733
+
734
+ // Returns a function that will only be executed after being called N times.
735
+ _.after = function(times, func) {
736
+ return function() {
737
+ if (--times < 1) {
738
+ return func.apply(this, arguments);
739
+ }
740
+ };
741
+ };
742
+
743
+ // Object Functions
744
+ // ----------------
745
+
746
+ // Retrieve the names of an object's properties.
747
+ // Delegates to **ECMAScript 5**'s native `Object.keys`
748
+ _.keys = nativeKeys || function(obj) {
749
+ if (obj !== Object(obj)) throw new TypeError('Invalid object');
750
+ var keys = [];
751
+ for (var key in obj) if (_.has(obj, key)) keys.push(key);
752
+ return keys;
753
+ };
754
+
755
+ // Retrieve the values of an object's properties.
756
+ _.values = function(obj) {
757
+ var values = [];
758
+ for (var key in obj) if (_.has(obj, key)) values.push(obj[key]);
759
+ return values;
760
+ };
761
+
762
+ // Convert an object into a list of `[key, value]` pairs.
763
+ _.pairs = function(obj) {
764
+ var pairs = [];
765
+ for (var key in obj) if (_.has(obj, key)) pairs.push([key, obj[key]]);
766
+ return pairs;
767
+ };
768
+
769
+ // Invert the keys and values of an object. The values must be serializable.
770
+ _.invert = function(obj) {
771
+ var result = {};
772
+ for (var key in obj) if (_.has(obj, key)) result[obj[key]] = key;
773
+ return result;
774
+ };
775
+
776
+ // Return a sorted list of the function names available on the object.
777
+ // Aliased as `methods`
778
+ _.functions = _.methods = function(obj) {
779
+ var names = [];
780
+ for (var key in obj) {
781
+ if (_.isFunction(obj[key])) names.push(key);
782
+ }
783
+ return names.sort();
784
+ };
785
+
786
+ // Extend a given object with all the properties in passed-in object(s).
787
+ _.extend = function(obj) {
788
+ each(slice.call(arguments, 1), function(source) {
789
+ if (source) {
790
+ for (var prop in source) {
791
+ obj[prop] = source[prop];
792
+ }
793
+ }
794
+ });
795
+ return obj;
796
+ };
797
+
798
+ // Return a copy of the object only containing the whitelisted properties.
799
+ _.pick = function(obj) {
800
+ var copy = {};
801
+ var keys = concat.apply(ArrayProto, slice.call(arguments, 1));
802
+ each(keys, function(key) {
803
+ if (key in obj) copy[key] = obj[key];
804
+ });
805
+ return copy;
806
+ };
807
+
808
+ // Return a copy of the object without the blacklisted properties.
809
+ _.omit = function(obj) {
810
+ var copy = {};
811
+ var keys = concat.apply(ArrayProto, slice.call(arguments, 1));
812
+ for (var key in obj) {
813
+ if (!_.contains(keys, key)) copy[key] = obj[key];
814
+ }
815
+ return copy;
816
+ };
817
+
818
+ // Fill in a given object with default properties.
819
+ _.defaults = function(obj) {
820
+ each(slice.call(arguments, 1), function(source) {
821
+ if (source) {
822
+ for (var prop in source) {
823
+ if (obj[prop] === void 0) obj[prop] = source[prop];
824
+ }
825
+ }
826
+ });
827
+ return obj;
828
+ };
829
+
830
+ // Create a (shallow-cloned) duplicate of an object.
831
+ _.clone = function(obj) {
832
+ if (!_.isObject(obj)) return obj;
833
+ return _.isArray(obj) ? obj.slice() : _.extend({}, obj);
834
+ };
835
+
836
+ // Invokes interceptor with the obj, and then returns obj.
837
+ // The primary purpose of this method is to "tap into" a method chain, in
838
+ // order to perform operations on intermediate results within the chain.
839
+ _.tap = function(obj, interceptor) {
840
+ interceptor(obj);
841
+ return obj;
842
+ };
843
+
844
+ // Internal recursive comparison function for `isEqual`.
845
+ var eq = function(a, b, aStack, bStack) {
846
+ // Identical objects are equal. `0 === -0`, but they aren't identical.
847
+ // See the [Harmony `egal` proposal](http://wiki.ecmascript.org/doku.php?id=harmony:egal).
848
+ if (a === b) return a !== 0 || 1 / a == 1 / b;
849
+ // A strict comparison is necessary because `null == undefined`.
850
+ if (a == null || b == null) return a === b;
851
+ // Unwrap any wrapped objects.
852
+ if (a instanceof _) a = a._wrapped;
853
+ if (b instanceof _) b = b._wrapped;
854
+ // Compare `[[Class]]` names.
855
+ var className = toString.call(a);
856
+ if (className != toString.call(b)) return false;
857
+ switch (className) {
858
+ // Strings, numbers, dates, and booleans are compared by value.
859
+ case '[object String]':
860
+ // Primitives and their corresponding object wrappers are equivalent; thus, `"5"` is
861
+ // equivalent to `new String("5")`.
862
+ return a == String(b);
863
+ case '[object Number]':
864
+ // `NaN`s are equivalent, but non-reflexive. An `egal` comparison is performed for
865
+ // other numeric values.
866
+ return a != +a ? b != +b : (a == 0 ? 1 / a == 1 / b : a == +b);
867
+ case '[object Date]':
868
+ case '[object Boolean]':
869
+ // Coerce dates and booleans to numeric primitive values. Dates are compared by their
870
+ // millisecond representations. Note that invalid dates with millisecond representations
871
+ // of `NaN` are not equivalent.
872
+ return +a == +b;
873
+ // RegExps are compared by their source patterns and flags.
874
+ case '[object RegExp]':
875
+ return a.source == b.source &&
876
+ a.global == b.global &&
877
+ a.multiline == b.multiline &&
878
+ a.ignoreCase == b.ignoreCase;
879
+ }
880
+ if (typeof a != 'object' || typeof b != 'object') return false;
881
+ // Assume equality for cyclic structures. The algorithm for detecting cyclic
882
+ // structures is adapted from ES 5.1 section 15.12.3, abstract operation `JO`.
883
+ var length = aStack.length;
884
+ while (length--) {
885
+ // Linear search. Performance is inversely proportional to the number of
886
+ // unique nested structures.
887
+ if (aStack[length] == a) return bStack[length] == b;
888
+ }
889
+ // Objects with different constructors are not equivalent, but `Object`s
890
+ // from different frames are.
891
+ var aCtor = a.constructor, bCtor = b.constructor;
892
+ if (aCtor !== bCtor && !(_.isFunction(aCtor) && (aCtor instanceof aCtor) &&
893
+ _.isFunction(bCtor) && (bCtor instanceof bCtor))) {
894
+ return false;
895
+ }
896
+ // Add the first object to the stack of traversed objects.
897
+ aStack.push(a);
898
+ bStack.push(b);
899
+ var size = 0, result = true;
900
+ // Recursively compare objects and arrays.
901
+ if (className == '[object Array]') {
902
+ // Compare array lengths to determine if a deep comparison is necessary.
903
+ size = a.length;
904
+ result = size == b.length;
905
+ if (result) {
906
+ // Deep compare the contents, ignoring non-numeric properties.
907
+ while (size--) {
908
+ if (!(result = eq(a[size], b[size], aStack, bStack))) break;
909
+ }
910
+ }
911
+ } else {
912
+ // Deep compare objects.
913
+ for (var key in a) {
914
+ if (_.has(a, key)) {
915
+ // Count the expected number of properties.
916
+ size++;
917
+ // Deep compare each member.
918
+ if (!(result = _.has(b, key) && eq(a[key], b[key], aStack, bStack))) break;
919
+ }
920
+ }
921
+ // Ensure that both objects contain the same number of properties.
922
+ if (result) {
923
+ for (key in b) {
924
+ if (_.has(b, key) && !(size--)) break;
925
+ }
926
+ result = !size;
927
+ }
928
+ }
929
+ // Remove the first object from the stack of traversed objects.
930
+ aStack.pop();
931
+ bStack.pop();
932
+ return result;
933
+ };
934
+
935
+ // Perform a deep comparison to check if two objects are equal.
936
+ _.isEqual = function(a, b) {
937
+ return eq(a, b, [], []);
938
+ };
939
+
940
+ // Is a given array, string, or object empty?
941
+ // An "empty" object has no enumerable own-properties.
942
+ _.isEmpty = function(obj) {
943
+ if (obj == null) return true;
944
+ if (_.isArray(obj) || _.isString(obj)) return obj.length === 0;
945
+ for (var key in obj) if (_.has(obj, key)) return false;
946
+ return true;
947
+ };
948
+
949
+ // Is a given value a DOM element?
950
+ _.isElement = function(obj) {
951
+ return !!(obj && obj.nodeType === 1);
952
+ };
953
+
954
+ // Is a given value an array?
955
+ // Delegates to ECMA5's native Array.isArray
956
+ _.isArray = nativeIsArray || function(obj) {
957
+ return toString.call(obj) == '[object Array]';
958
+ };
959
+
960
+ // Is a given variable an object?
961
+ _.isObject = function(obj) {
962
+ return obj === Object(obj);
963
+ };
964
+
965
+ // Add some isType methods: isArguments, isFunction, isString, isNumber, isDate, isRegExp.
966
+ each(['Arguments', 'Function', 'String', 'Number', 'Date', 'RegExp'], function(name) {
967
+ _['is' + name] = function(obj) {
968
+ return toString.call(obj) == '[object ' + name + ']';
969
+ };
970
+ });
971
+
972
+ // Define a fallback version of the method in browsers (ahem, IE), where
973
+ // there isn't any inspectable "Arguments" type.
974
+ if (!_.isArguments(arguments)) {
975
+ _.isArguments = function(obj) {
976
+ return !!(obj && _.has(obj, 'callee'));
977
+ };
978
+ }
979
+
980
+ // Optimize `isFunction` if appropriate.
981
+ if (typeof (/./) !== 'function') {
982
+ _.isFunction = function(obj) {
983
+ return typeof obj === 'function';
984
+ };
985
+ }
986
+
987
+ // Is a given object a finite number?
988
+ _.isFinite = function(obj) {
989
+ return isFinite(obj) && !isNaN(parseFloat(obj));
990
+ };
991
+
992
+ // Is the given value `NaN`? (NaN is the only number which does not equal itself).
993
+ _.isNaN = function(obj) {
994
+ return _.isNumber(obj) && obj != +obj;
995
+ };
996
+
997
+ // Is a given value a boolean?
998
+ _.isBoolean = function(obj) {
999
+ return obj === true || obj === false || toString.call(obj) == '[object Boolean]';
1000
+ };
1001
+
1002
+ // Is a given value equal to null?
1003
+ _.isNull = function(obj) {
1004
+ return obj === null;
1005
+ };
1006
+
1007
+ // Is a given variable undefined?
1008
+ _.isUndefined = function(obj) {
1009
+ return obj === void 0;
1010
+ };
1011
+
1012
+ // Shortcut function for checking if an object has a given property directly
1013
+ // on itself (in other words, not on a prototype).
1014
+ _.has = function(obj, key) {
1015
+ return hasOwnProperty.call(obj, key);
1016
+ };
1017
+
1018
+ // Utility Functions
1019
+ // -----------------
1020
+
1021
+ // Run Underscore.js in *noConflict* mode, returning the `_` variable to its
1022
+ // previous owner. Returns a reference to the Underscore object.
1023
+ _.noConflict = function() {
1024
+ root._ = previousUnderscore;
1025
+ return this;
1026
+ };
1027
+
1028
+ // Keep the identity function around for default iterators.
1029
+ _.identity = function(value) {
1030
+ return value;
1031
+ };
1032
+
1033
+ // Run a function **n** times.
1034
+ _.times = function(n, iterator, context) {
1035
+ var accum = Array(Math.max(0, n));
1036
+ for (var i = 0; i < n; i++) accum[i] = iterator.call(context, i);
1037
+ return accum;
1038
+ };
1039
+
1040
+ // Return a random integer between min and max (inclusive).
1041
+ _.random = function(min, max) {
1042
+ if (max == null) {
1043
+ max = min;
1044
+ min = 0;
1045
+ }
1046
+ return min + Math.floor(Math.random() * (max - min + 1));
1047
+ };
1048
+
1049
+ // List of HTML entities for escaping.
1050
+ var entityMap = {
1051
+ escape: {
1052
+ '&': '&amp;',
1053
+ '<': '&lt;',
1054
+ '>': '&gt;',
1055
+ '"': '&quot;',
1056
+ "'": '&#x27;',
1057
+ '/': '&#x2F;'
1058
+ }
1059
+ };
1060
+ entityMap.unescape = _.invert(entityMap.escape);
1061
+
1062
+ // Regexes containing the keys and values listed immediately above.
1063
+ var entityRegexes = {
1064
+ escape: new RegExp('[' + _.keys(entityMap.escape).join('') + ']', 'g'),
1065
+ unescape: new RegExp('(' + _.keys(entityMap.unescape).join('|') + ')', 'g')
1066
+ };
1067
+
1068
+ // Functions for escaping and unescaping strings to/from HTML interpolation.
1069
+ _.each(['escape', 'unescape'], function(method) {
1070
+ _[method] = function(string) {
1071
+ if (string == null) return '';
1072
+ return ('' + string).replace(entityRegexes[method], function(match) {
1073
+ return entityMap[method][match];
1074
+ });
1075
+ };
1076
+ });
1077
+
1078
+ // If the value of the named `property` is a function then invoke it with the
1079
+ // `object` as context; otherwise, return it.
1080
+ _.result = function(object, property) {
1081
+ if (object == null) return void 0;
1082
+ var value = object[property];
1083
+ return _.isFunction(value) ? value.call(object) : value;
1084
+ };
1085
+
1086
+ // Add your own custom functions to the Underscore object.
1087
+ _.mixin = function(obj) {
1088
+ each(_.functions(obj), function(name){
1089
+ var func = _[name] = obj[name];
1090
+ _.prototype[name] = function() {
1091
+ var args = [this._wrapped];
1092
+ push.apply(args, arguments);
1093
+ return result.call(this, func.apply(_, args));
1094
+ };
1095
+ });
1096
+ };
1097
+
1098
+ // Generate a unique integer id (unique within the entire client session).
1099
+ // Useful for temporary DOM ids.
1100
+ var idCounter = 0;
1101
+ _.uniqueId = function(prefix) {
1102
+ var id = ++idCounter + '';
1103
+ return prefix ? prefix + id : id;
1104
+ };
1105
+
1106
+ // By default, Underscore uses ERB-style template delimiters, change the
1107
+ // following template settings to use alternative delimiters.
1108
+ _.templateSettings = {
1109
+ evaluate : /<%([\s\S]+?)%>/g,
1110
+ interpolate : /<%=([\s\S]+?)%>/g,
1111
+ escape : /<%-([\s\S]+?)%>/g
1112
+ };
1113
+
1114
+ // When customizing `templateSettings`, if you don't want to define an
1115
+ // interpolation, evaluation or escaping regex, we need one that is
1116
+ // guaranteed not to match.
1117
+ var noMatch = /(.)^/;
1118
+
1119
+ // Certain characters need to be escaped so that they can be put into a
1120
+ // string literal.
1121
+ var escapes = {
1122
+ "'": "'",
1123
+ '\\': '\\',
1124
+ '\r': 'r',
1125
+ '\n': 'n',
1126
+ '\t': 't',
1127
+ '\u2028': 'u2028',
1128
+ '\u2029': 'u2029'
1129
+ };
1130
+
1131
+ var escaper = /\\|'|\r|\n|\t|\u2028|\u2029/g;
1132
+
1133
+ // JavaScript micro-templating, similar to John Resig's implementation.
1134
+ // Underscore templating handles arbitrary delimiters, preserves whitespace,
1135
+ // and correctly escapes quotes within interpolated code.
1136
+ _.template = function(text, data, settings) {
1137
+ var render;
1138
+ settings = _.defaults({}, settings, _.templateSettings);
1139
+
1140
+ // Combine delimiters into one regular expression via alternation.
1141
+ var matcher = new RegExp([
1142
+ (settings.escape || noMatch).source,
1143
+ (settings.interpolate || noMatch).source,
1144
+ (settings.evaluate || noMatch).source
1145
+ ].join('|') + '|$', 'g');
1146
+
1147
+ // Compile the template source, escaping string literals appropriately.
1148
+ var index = 0;
1149
+ var source = "__p+='";
1150
+ text.replace(matcher, function(match, escape, interpolate, evaluate, offset) {
1151
+ source += text.slice(index, offset)
1152
+ .replace(escaper, function(match) { return '\\' + escapes[match]; });
1153
+
1154
+ if (escape) {
1155
+ source += "'+\n((__t=(" + escape + "))==null?'':_.escape(__t))+\n'";
1156
+ }
1157
+ if (interpolate) {
1158
+ source += "'+\n((__t=(" + interpolate + "))==null?'':__t)+\n'";
1159
+ }
1160
+ if (evaluate) {
1161
+ source += "';\n" + evaluate + "\n__p+='";
1162
+ }
1163
+ index = offset + match.length;
1164
+ return match;
1165
+ });
1166
+ source += "';\n";
1167
+
1168
+ // If a variable is not specified, place data values in local scope.
1169
+ if (!settings.variable) source = 'with(obj||{}){\n' + source + '}\n';
1170
+
1171
+ source = "var __t,__p='',__j=Array.prototype.join," +
1172
+ "print=function(){__p+=__j.call(arguments,'');};\n" +
1173
+ source + "return __p;\n";
1174
+
1175
+ try {
1176
+ render = new Function(settings.variable || 'obj', '_', source);
1177
+ } catch (e) {
1178
+ e.source = source;
1179
+ throw e;
1180
+ }
1181
+
1182
+ if (data) return render(data, _);
1183
+ var template = function(data) {
1184
+ return render.call(this, data, _);
1185
+ };
1186
+
1187
+ // Provide the compiled function source as a convenience for precompilation.
1188
+ template.source = 'function(' + (settings.variable || 'obj') + '){\n' + source + '}';
1189
+
1190
+ return template;
1191
+ };
1192
+
1193
+ // Add a "chain" function, which will delegate to the wrapper.
1194
+ _.chain = function(obj) {
1195
+ return _(obj).chain();
1196
+ };
1197
+
1198
+ // OOP
1199
+ // ---------------
1200
+ // If Underscore is called as a function, it returns a wrapped object that
1201
+ // can be used OO-style. This wrapper holds altered versions of all the
1202
+ // underscore functions. Wrapped objects may be chained.
1203
+
1204
+ // Helper function to continue chaining intermediate results.
1205
+ var result = function(obj) {
1206
+ return this._chain ? _(obj).chain() : obj;
1207
+ };
1208
+
1209
+ // Add all of the Underscore functions to the wrapper object.
1210
+ _.mixin(_);
1211
+
1212
+ // Add all mutator Array functions to the wrapper.
1213
+ each(['pop', 'push', 'reverse', 'shift', 'sort', 'splice', 'unshift'], function(name) {
1214
+ var method = ArrayProto[name];
1215
+ _.prototype[name] = function() {
1216
+ var obj = this._wrapped;
1217
+ method.apply(obj, arguments);
1218
+ if ((name == 'shift' || name == 'splice') && obj.length === 0) delete obj[0];
1219
+ return result.call(this, obj);
1220
+ };
1221
+ });
1222
+
1223
+ // Add all accessor Array functions to the wrapper.
1224
+ each(['concat', 'join', 'slice'], function(name) {
1225
+ var method = ArrayProto[name];
1226
+ _.prototype[name] = function() {
1227
+ return result.call(this, method.apply(this._wrapped, arguments));
1228
+ };
1229
+ });
1230
+
1231
+ _.extend(_.prototype, {
1232
+
1233
+ // Start chaining a wrapped Underscore object.
1234
+ chain: function() {
1235
+ this._chain = true;
1236
+ return this;
1237
+ },
1238
+
1239
+ // Extracts the result from a wrapped and chained object.
1240
+ value: function() {
1241
+ return this._wrapped;
1242
+ }
1243
+
1244
+ });
1245
+
1246
+ }).call(this);