tweet_live: comparison web/res/js/underscore.js

Mercurial Mercurial > tweet_live / comparison

summary | shortlog | changelog | graph | tags | bookmarks | branches | files | changeset | file | latest | revisions | annotate | diff | comparison | raw | help

web/res/js/underscore.js

changeset 1514	5869151a1f2f
parent 1304	10974bff4dae

equal deleted inserted replaced

-:b833d7c72ea9
+:5869151a1f2f
-//     Underscore.js 1.8.3
+//     Underscore.js 1.9.1
 //     http://underscorejs.org
-//     (c) 2009-2015 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
+//     (c) 2009-2018 Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors
 //     Underscore may be freely distributed under the MIT license.
 (function() {
 // Baseline setup
 // --------------
-// Establish the root object, `window` in the browser, or `exports` on the server.
+// Establish the root object, `window` (`self`) in the browser, `global`
-var root = this;
+// on the server, or `this` in some virtual machines. We use `self`
+// instead of `window` for `WebWorker` support.
+var root = typeof self == 'object' && self.self === self && self ||
+typeof global == 'object' && global.global === global && global ||
+this ||
+{};
 // Save the previous value of the `_` variable.
 var previousUnderscore = root._;
 // Save bytes in the minified (but not gzipped) version:
-var ArrayProto = Array.prototype, ObjProto = Object.prototype, FuncProto = Function.prototype;
+var ArrayProto = Array.prototype, ObjProto = Object.prototype;
+var SymbolProto = typeof Symbol !== 'undefined' ? Symbol.prototype : null;
 // Create quick reference variables for speed access to core prototypes.
-var
+var push = ArrayProto.push,
-push             = ArrayProto.push,
+slice = ArrayProto.slice,
-slice            = ArrayProto.slice,
+toString = ObjProto.toString,
-toString         = ObjProto.toString,
+hasOwnProperty = ObjProto.hasOwnProperty;
-hasOwnProperty   = ObjProto.hasOwnProperty;
 // All **ECMAScript 5** native function implementations that we hope to use
 // are declared here.
-var
+var nativeIsArray = Array.isArray,
-nativeIsArray      = Array.isArray,
+nativeKeys = Object.keys,
-nativeKeys         = Object.keys,
+nativeCreate = Object.create;
-nativeBind         = FuncProto.bind,
-nativeCreate       = Object.create;
 // Naked function reference for surrogate-prototype-swapping.
 var Ctor = function(){};
 // Create a safe reference to the Underscore object for use below.
 if (!(this instanceof _)) return new _(obj);
 this._wrapped = obj;
 };
 // Export the Underscore object for **Node.js**, with
-// backwards-compatibility for the old `require()` API. If we're in
+// backwards-compatibility for their old module API. If we're in
 // the browser, add `_` as a global object.
-if (typeof exports !== 'undefined') {
+// (`nodeType` is checked to ensure that `module`
-if (typeof module !== 'undefined' && module.exports) {
+// and `exports` are not HTML elements.)
+if (typeof exports != 'undefined' && !exports.nodeType) {
+if (typeof module != 'undefined' && !module.nodeType && module.exports) {
 exports = module.exports = _;
 }
 exports._ = _;
 } else {
 root._ = _;
 }
 // Current version.
-_.VERSION = '1.8.3';
+_.VERSION = '1.9.1';
 // Internal function that returns an efficient (for current engines) version
 // of the passed-in callback, to be repeatedly applied in other Underscore
 // functions.
 var optimizeCb = function(func, context, argCount) {
 if (context === void 0) return func;
 switch (argCount == null ? 3 : argCount) {
 case 1: return function(value) {
 return func.call(context, value);
 };
-case 2: return function(value, other) {
+// The 2-argument case is omitted because we’re not using it.
-return func.call(context, value, other);
-};
 case 3: return function(value, index, collection) {
 return func.call(context, value, index, collection);
 };
 case 4: return function(accumulator, value, index, collection) {
 return func.call(context, accumulator, value, index, collection);
 return function() {
 return func.apply(context, arguments);
 };
 };
-// A mostly-internal function to generate callbacks that can be applied
+var builtinIteratee;
-// to each element in a collection, returning the desired result — either
-// identity, an arbitrary callback, a property matcher, or a property accessor.
+// An internal function to generate callbacks that can be applied to each
+// element in a collection, returning the desired result — either `identity`,
+// an arbitrary callback, a property matcher, or a property accessor.
 var cb = function(value, context, argCount) {
+if (_.iteratee !== builtinIteratee) return _.iteratee(value, context);
 if (value == null) return _.identity;
 if (_.isFunction(value)) return optimizeCb(value, context, argCount);
-if (_.isObject(value)) return _.matcher(value);
+if (_.isObject(value) && !_.isArray(value)) return _.matcher(value);
 return _.property(value);
 };
-_.iteratee = function(value, context) {
+// External wrapper for our callback generator. Users may customize
+// `_.iteratee` if they want additional predicate/iteratee shorthand styles.
+// This abstraction hides the internal-only argCount argument.
+_.iteratee = builtinIteratee = function(value, context) {
 return cb(value, context, Infinity);
 };
-// An internal function for creating assigner functions.
+// Some functions take a variable number of arguments, or a few expected
-var createAssigner = function(keysFunc, undefinedOnly) {
+// arguments at the beginning and then a variable number of values to operate
-return function(obj) {
+// on. This helper accumulates all remaining arguments past the function’s
-var length = arguments.length;
+// argument length (or an explicit `startIndex`), into an array that becomes
-if (length < 2 || obj == null) return obj;
+// the last argument. Similar to ES6’s "rest parameter".
-for (var index = 1; index < length; index++) {
+var restArguments = function(func, startIndex) {
-var source = arguments[index],
+startIndex = startIndex == null ? func.length - 1 : +startIndex;
-keys = keysFunc(source),
+return function() {
-l = keys.length;
+var length = Math.max(arguments.length - startIndex, 0),
-for (var i = 0; i < l; i++) {
+rest = Array(length),
-var key = keys[i];
+index = 0;
-if (!undefinedOnly || obj[key] === void 0) obj[key] = source[key];
+for (; index < length; index++) {
-}
+rest[index] = arguments[index + startIndex];
 }
-return obj;
+switch (startIndex) {
+case 0: return func.call(this, rest);
+case 1: return func.call(this, arguments[0], rest);
+case 2: return func.call(this, arguments[0], arguments[1], rest);
+}
+var args = Array(startIndex + 1);
+for (index = 0; index < startIndex; index++) {
+args[index] = arguments[index];
+}
+args[startIndex] = rest;
+return func.apply(this, args);
 };
 };
 // An internal function for creating a new object that inherits from another.
 var baseCreate = function(prototype) {
 var result = new Ctor;
 Ctor.prototype = null;
 return result;
 };
-var property = function(key) {
+var shallowProperty = function(key) {
 return function(obj) {
 return obj == null ? void 0 : obj[key];
 };
 };
+var has = function(obj, path) {
+return obj != null && hasOwnProperty.call(obj, path);
+}
+var deepGet = function(obj, path) {
+var length = path.length;
+for (var i = 0; i < length; i++) {
+if (obj == null) return void 0;
+obj = obj[path[i]];
+}
+return length ? obj : void 0;
+};
 // Helper for collection methods to determine whether a collection
-// should be iterated as an array or as an object
+// should be iterated as an array or as an object.
 // Related: http://people.mozilla.org/~jorendorff/es6-draft.html#sec-tolength
 // Avoids a very nasty iOS 8 JIT bug on ARM-64. #2094
 var MAX_ARRAY_INDEX = Math.pow(2, 53) - 1;
-var getLength = property('length');
+var getLength = shallowProperty('length');
 var isArrayLike = function(collection) {
 var length = getLength(collection);
 return typeof length == 'number' && length >= 0 && length <= MAX_ARRAY_INDEX;
 };
 }
 return results;
 };
 // Create a reducing function iterating left or right.
-function createReduce(dir) {
+var createReduce = function(dir) {
-// Optimized iterator function as using arguments.length
+// Wrap code that reassigns argument variables in a separate function than
-// in the main function will deoptimize the, see #1991.
+// the one that accesses `arguments.length` to avoid a perf hit. (#1991)
-function iterator(obj, iteratee, memo, keys, index, length) {
+var reducer = function(obj, iteratee, memo, initial) {
+var keys = !isArrayLike(obj) && _.keys(obj),
+length = (keys || obj).length,
+index = dir > 0 ? 0 : length - 1;
+if (!initial) {
+memo = obj[keys ? keys[index] : index];
+index += dir;
+}
 for (; index >= 0 && index < length; index += dir) {
 var currentKey = keys ? keys[index] : index;
 memo = iteratee(memo, obj[currentKey], currentKey, obj);
 }
 return memo;
-}
+};
 return function(obj, iteratee, memo, context) {
-iteratee = optimizeCb(iteratee, context, 4);
+var initial = arguments.length >= 3;
-var keys = !isArrayLike(obj) && _.keys(obj),
+return reducer(obj, optimizeCb(iteratee, context, 4), memo, initial);
-length = (keys || obj).length,
+};
-index = dir > 0 ? 0 : length - 1;
+};
-// Determine the initial value if none is provided.
-if (arguments.length < 3) {
-memo = obj[keys ? keys[index] : index];
-index += dir;
-}
-return iterator(obj, iteratee, memo, keys, index, length);
-};
-}
 // **Reduce** builds up a single result from a list of values, aka `inject`,
 // or `foldl`.
 _.reduce = _.foldl = _.inject = createReduce(1);
 // The right-associative version of reduce, also known as `foldr`.
 _.reduceRight = _.foldr = createReduce(-1);
 // Return the first value which passes a truth test. Aliased as `detect`.
 _.find = _.detect = function(obj, predicate, context) {
-var key;
+var keyFinder = isArrayLike(obj) ? _.findIndex : _.findKey;
-if (isArrayLike(obj)) {
+var key = keyFinder(obj, predicate, context);
-key = _.findIndex(obj, predicate, context);
-} else {
-key = _.findKey(obj, predicate, context);
-}
 if (key !== void 0 && key !== -1) return obj[key];
 };
 // Return all the elements that pass a truth test.
 // Aliased as `select`.
 if (typeof fromIndex != 'number' || guard) fromIndex = 0;
 return _.indexOf(obj, item, fromIndex) >= 0;
 };
 // Invoke a method (with arguments) on every item in a collection.
-_.invoke = function(obj, method) {
+_.invoke = restArguments(function(obj, path, args) {
-var args = slice.call(arguments, 2);
+var contextPath, func;
-var isFunc = _.isFunction(method);
+if (_.isFunction(path)) {
-return _.map(obj, function(value) {
+func = path;
-var func = isFunc ? method : value[method];
+} else if (_.isArray(path)) {
-return func == null ? func : func.apply(value, args);
+contextPath = path.slice(0, -1);
+path = path[path.length - 1];
+}
+return _.map(obj, function(context) {
+var method = func;
+if (!method) {
+if (contextPath && contextPath.length) {
+context = deepGet(context, contextPath);
+}
+if (context == null) return void 0;
+method = context[path];
+}
+return method == null ? method : method.apply(context, args);
 });
-};
+});
 // Convenience version of a common use case of `map`: fetching a property.
 _.pluck = function(obj, key) {
 return _.map(obj, _.property(key));
 };
 // Return the maximum element (or element-based computation).
 _.max = function(obj, iteratee, context) {
 var result = -Infinity, lastComputed = -Infinity,
 value, computed;
-if (iteratee == null && obj != null) {
+if (iteratee == null || typeof iteratee == 'number' && typeof obj[0] != 'object' && obj != null) {
 obj = isArrayLike(obj) ? obj : _.values(obj);
 for (var i = 0, length = obj.length; i < length; i++) {
 value = obj[i];
-if (value > result) {
+if (value != null && value > result) {
 result = value;
 }
 }
 } else {
 iteratee = cb(iteratee, context);
-_.each(obj, function(value, index, list) {
+_.each(obj, function(v, index, list) {
-computed = iteratee(value, index, list);
+computed = iteratee(v, index, list);
 if (computed > lastComputed || computed === -Infinity && result === -Infinity) {
-result = value;
+result = v;
 lastComputed = computed;
 }
 });
 }
 return result;
 // Return the minimum element (or element-based computation).
 _.min = function(obj, iteratee, context) {
 var result = Infinity, lastComputed = Infinity,
 value, computed;
-if (iteratee == null && obj != null) {
+if (iteratee == null || typeof iteratee == 'number' && typeof obj[0] != 'object' && obj != null) {
 obj = isArrayLike(obj) ? obj : _.values(obj);
 for (var i = 0, length = obj.length; i < length; i++) {
 value = obj[i];
-if (value < result) {
+if (value != null && value < result) {
 result = value;
 }
 }
 } else {
 iteratee = cb(iteratee, context);
-_.each(obj, function(value, index, list) {
+_.each(obj, function(v, index, list) {
-computed = iteratee(value, index, list);
+computed = iteratee(v, index, list);
 if (computed < lastComputed || computed === Infinity && result === Infinity) {
-result = value;
+result = v;
 lastComputed = computed;
 }
 });
 }
 return result;
 };
-// Shuffle a collection, using the modern version of the
+// Shuffle a collection.
+_.shuffle = function(obj) {
+return _.sample(obj, Infinity);
+};
+// Sample **n** random values from a collection using the modern version of the
 // [Fisher-Yates shuffle](http://en.wikipedia.org/wiki/Fisher–Yates_shuffle).
-_.shuffle = function(obj) {
-var set = isArrayLike(obj) ? obj : _.values(obj);
-var length = set.length;
-var shuffled = Array(length);
-for (var index = 0, rand; index < length; index++) {
-rand = _.random(0, index);
-if (rand !== index) shuffled[index] = shuffled[rand];
-shuffled[rand] = set[index];
-}
-return shuffled;
-};
-// Sample **n** random values from a collection.
 // If **n** is not specified, returns a single random element.
 // The internal `guard` argument allows it to work with `map`.
 _.sample = function(obj, n, guard) {
 if (n == null || guard) {
 if (!isArrayLike(obj)) obj = _.values(obj);
 return obj[_.random(obj.length - 1)];
 }
-return _.shuffle(obj).slice(0, Math.max(0, n));
+var sample = isArrayLike(obj) ? _.clone(obj) : _.values(obj);
+var length = getLength(sample);
+n = Math.max(Math.min(n, length), 0);
+var last = length - 1;
+for (var index = 0; index < n; index++) {
+var rand = _.random(index, last);
+var temp = sample[index];
+sample[index] = sample[rand];
+sample[rand] = temp;
+}
+return sample.slice(0, n);
 };
 // Sort the object's values by a criterion produced by an iteratee.
 _.sortBy = function(obj, iteratee, context) {
+var index = 0;
 iteratee = cb(iteratee, context);
-return _.pluck(_.map(obj, function(value, index, list) {
+return _.pluck(_.map(obj, function(value, key, list) {
 return {
 value: value,
-index: index,
+index: index++,
-criteria: iteratee(value, index, list)
+criteria: iteratee(value, key, list)
 };
 }).sort(function(left, right) {
 var a = left.criteria;
 var b = right.criteria;
 if (a !== b) {
 return left.index - right.index;
 }), 'value');
 };
 // An internal function used for aggregate "group by" operations.
-var group = function(behavior) {
+var group = function(behavior, partition) {
 return function(obj, iteratee, context) {
-var result = {};
+var result = partition ? [[], []] : {};
 iteratee = cb(iteratee, context);
 _.each(obj, function(value, index) {
 var key = iteratee(value, index, obj);
 behavior(result, value, key);
 });
 };
 // Groups the object's values by a criterion. Pass either a string attribute
 // to group by, or a function that returns the criterion.
 _.groupBy = group(function(result, value, key) {
-if (_.has(result, key)) result[key].push(value); else result[key] = [value];
+if (has(result, key)) result[key].push(value); else result[key] = [value];
 });
 // Indexes the object's values by a criterion, similar to `groupBy`, but for
 // when you know that your index values will be unique.
 _.indexBy = group(function(result, value, key) {
 // Counts instances of an object that group by a certain criterion. Pass
 // either a string attribute to count by, or a function that returns the
 // criterion.
 _.countBy = group(function(result, value, key) {
-if (_.has(result, key)) result[key]++; else result[key] = 1;
+if (has(result, key)) result[key]++; else result[key] = 1;
 });
+var reStrSymbol = /[^\ud800-\udfff]|[\ud800-\udbff][\udc00-\udfff]|[\ud800-\udfff]/g;
 // Safely create a real, live array from anything iterable.
 _.toArray = function(obj) {
 if (!obj) return [];
 if (_.isArray(obj)) return slice.call(obj);
+if (_.isString(obj)) {
+// Keep surrogate pair characters together
+return obj.match(reStrSymbol);
+}
 if (isArrayLike(obj)) return _.map(obj, _.identity);
 return _.values(obj);
 };
 // Return the number of elements in an object.
 return isArrayLike(obj) ? obj.length : _.keys(obj).length;
 };
 // Split a collection into two arrays: one whose elements all satisfy the given
 // predicate, and one whose elements all do not satisfy the predicate.
-_.partition = function(obj, predicate, context) {
+_.partition = group(function(result, value, pass) {
-predicate = cb(predicate, context);
+result[pass ? 0 : 1].push(value);
-var pass = [], fail = [];
+}, true);
-_.each(obj, function(value, key, obj) {
-(predicate(value, key, obj) ? pass : fail).push(value);
-});
-return [pass, fail];
-};
 // Array Functions
 // ---------------
 // Get the first element of an array. Passing **n** will return the first N
 // values in the array. Aliased as `head` and `take`. The **guard** check
 // allows it to work with `_.map`.
 _.first = _.head = _.take = function(array, n, guard) {
-if (array == null) return void 0;
+if (array == null || array.length < 1) return n == null ? void 0 : [];
 if (n == null || guard) return array[0];
 return _.initial(array, array.length - n);
 };
 // Returns everything but the last entry of the array. Especially useful on
 };
 // Get the last element of an array. Passing **n** will return the last N
 // values in the array.
 _.last = function(array, n, guard) {
-if (array == null) return void 0;
+if (array == null || array.length < 1) return n == null ? void 0 : [];
 if (n == null || guard) return array[array.length - 1];
 return _.rest(array, Math.max(0, array.length - n));
 };
 // Returns everything but the first entry of the array. Aliased as `tail` and `drop`.
 return slice.call(array, n == null || guard ? 1 : n);
 };
 // Trim out all falsy values from an array.
 _.compact = function(array) {
-return _.filter(array, _.identity);
+return _.filter(array, Boolean);
 };
 // Internal implementation of a recursive `flatten` function.
-var flatten = function(input, shallow, strict, startIndex) {
+var flatten = function(input, shallow, strict, output) {
-var output = [], idx = 0;
+output = output || [];
-for (var i = startIndex || 0, length = getLength(input); i < length; i++) {
+var idx = output.length;
+for (var i = 0, length = getLength(input); i < length; i++) {
 var value = input[i];
 if (isArrayLike(value) && (_.isArray(value) || _.isArguments(value))) {
-//flatten current level of array or arguments object
+// Flatten current level of array or arguments object.
-if (!shallow) value = flatten(value, shallow, strict);
+if (shallow) {
 var j = 0, len = value.length;
-output.length += len;
+while (j < len) output[idx++] = value[j++];
-while (j < len) {
+} else {
-output[idx++] = value[j++];
+flatten(value, shallow, strict, output);
+idx = output.length;
 }
 } else if (!strict) {
 output[idx++] = value;
 }
 }
 _.flatten = function(array, shallow) {
 return flatten(array, shallow, false);
 };
 // Return a version of the array that does not contain the specified value(s).
-_.without = function(array) {
+_.without = restArguments(function(array, otherArrays) {
-return _.difference(array, slice.call(arguments, 1));
+return _.difference(array, otherArrays);
-};
+});
 // Produce a duplicate-free version of the array. If the array has already
 // been sorted, you have the option of using a faster algorithm.
+// The faster algorithm will not work with an iteratee if the iteratee
+// is not a one-to-one function, so providing an iteratee will disable
+// the faster algorithm.
 // Aliased as `unique`.
 _.uniq = _.unique = function(array, isSorted, iteratee, context) {
 if (!_.isBoolean(isSorted)) {
 context = iteratee;
 iteratee = isSorted;
 var result = [];
 var seen = [];
 for (var i = 0, length = getLength(array); i < length; i++) {
 var value = array[i],
 computed = iteratee ? iteratee(value, i, array) : value;
-if (isSorted) {
+if (isSorted && !iteratee) {
 if (!i || seen !== computed) result.push(value);
 seen = computed;
 } else if (iteratee) {
 if (!_.contains(seen, computed)) {
 seen.push(computed);
 return result;
 };
 // Produce an array that contains the union: each distinct element from all of
 // the passed-in arrays.
-_.union = function() {
+_.union = restArguments(function(arrays) {
-return _.uniq(flatten(arguments, true, true));
+return _.uniq(flatten(arrays, true, true));
-};
+});
 // Produce an array that contains every item shared between all the
 // passed-in arrays.
 _.intersection = function(array) {
 var result = [];
 var argsLength = arguments.length;
 for (var i = 0, length = getLength(array); i < length; i++) {
 var item = array[i];
 if (_.contains(result, item)) continue;
-for (var j = 1; j < argsLength; j++) {
+var j;
+for (j = 1; j < argsLength; j++) {
 if (!_.contains(arguments[j], item)) break;
 }
 if (j === argsLength) result.push(item);
 }
 return result;
 };
 // Take the difference between one array and a number of other arrays.
 // Only the elements present in just the first array will remain.
-_.difference = function(array) {
+_.difference = restArguments(function(array, rest) {
-var rest = flatten(arguments, true, true, 1);
+rest = flatten(rest, true, true);
 return _.filter(array, function(value){
 return !_.contains(rest, value);
 });
-};
+});
-// Zip together multiple lists into a single array -- elements that share
-// an index go together.
-_.zip = function() {
-return _.unzip(arguments);
-};
 // Complement of _.zip. Unzip accepts an array of arrays and groups
-// each array's elements on shared indices
+// each array's elements on shared indices.
 _.unzip = function(array) {
 var length = array && _.max(array, getLength).length || 0;
 var result = Array(length);
 for (var index = 0; index < length; index++) {
 result[index] = _.pluck(array, index);
 }
 return result;
 };
+// Zip together multiple lists into a single array -- elements that share
+// an index go together.
+_.zip = restArguments(_.unzip);
 // Converts lists into objects. Pass either a single array of `[key, value]`
 // pairs, or two parallel arrays of the same length -- one of keys, and one of
-// the corresponding values.
+// the corresponding values. Passing by pairs is the reverse of _.pairs.
 _.object = function(list, values) {
 var result = {};
 for (var i = 0, length = getLength(list); i < length; i++) {
 if (values) {
 result[list[i]] = values[i];
 }
 }
 return result;
 };
-// Generator function to create the findIndex and findLastIndex functions
+// Generator function to create the findIndex and findLastIndex functions.
-function createPredicateIndexFinder(dir) {
+var createPredicateIndexFinder = function(dir) {
 return function(array, predicate, context) {
 predicate = cb(predicate, context);
 var length = getLength(array);
 var index = dir > 0 ? 0 : length - 1;
 for (; index >= 0 && index < length; index += dir) {
 if (predicate(array[index], index, array)) return index;
 }
 return -1;
 };
-}
+};
-// Returns the first index on an array-like that passes a predicate test
+// Returns the first index on an array-like that passes a predicate test.
 _.findIndex = createPredicateIndexFinder(1);
 _.findLastIndex = createPredicateIndexFinder(-1);
 // Use a comparator function to figure out the smallest index at which
 // an object should be inserted so as to maintain order. Uses binary search.
 if (iteratee(array[mid]) < value) low = mid + 1; else high = mid;
 }
 return low;
 };
-// Generator function to create the indexOf and lastIndexOf functions
+// Generator function to create the indexOf and lastIndexOf functions.
-function createIndexFinder(dir, predicateFind, sortedIndex) {
+var createIndexFinder = function(dir, predicateFind, sortedIndex) {
 return function(array, item, idx) {
 var i = 0, length = getLength(array);
 if (typeof idx == 'number') {
 if (dir > 0) {
 i = idx >= 0 ? idx : Math.max(idx + length, i);
 } else {
 length = idx >= 0 ? Math.min(idx + 1, length) : idx + length + 1;
 }
 } else if (sortedIndex && idx && length) {
 idx = sortedIndex(array, item);
 return array[idx] === item ? idx : -1;
 }
 for (idx = dir > 0 ? i : length - 1; idx >= 0 && idx < length; idx += dir) {
 if (array[idx] === item) return idx;
 }
 return -1;
 };
-}
+};
 // Return the position of the first occurrence of an item in an array,
 // or -1 if the item is not included in the array.
 // If the array is large and already in sort order, pass `true`
 // for **isSorted** to use binary search.
 _.range = function(start, stop, step) {
 if (stop == null) {
 stop = start || 0;
 start = 0;
 }
-step = step || 1;
+if (!step) {
+step = stop < start ? -1 : 1;
+}
 var length = Math.max(Math.ceil((stop - start) / step), 0);
 var range = Array(length);
 for (var idx = 0; idx < length; idx++, start += step) {
 }
 return range;
 };
+// Chunk a single array into multiple arrays, each containing `count` or fewer
+// items.
+_.chunk = function(array, count) {
+if (count == null || count < 1) return [];
+var result = [];
+var i = 0, length = array.length;
+while (i < length) {
+result.push(slice.call(array, i, i += count));
+}
+return result;
+};
 // Function (ahem) Functions
 // ------------------
 // Determines whether to execute a function as a constructor
-// or a normal function with the provided arguments
+// or a normal function with the provided arguments.
 var executeBound = function(sourceFunc, boundFunc, context, callingContext, args) {
 if (!(callingContext instanceof boundFunc)) return sourceFunc.apply(context, args);
 var self = baseCreate(sourceFunc.prototype);
 var result = sourceFunc.apply(self, args);
 if (_.isObject(result)) return result;
 };
 // Create a function bound to a given object (assigning `this`, and arguments,
 // optionally). Delegates to **ECMAScript 5**'s native `Function.bind` if
 // available.
-_.bind = function(func, context) {
+_.bind = restArguments(function(func, context, args) {
-if (nativeBind && func.bind === nativeBind) return nativeBind.apply(func, slice.call(arguments, 1));
 if (!_.isFunction(func)) throw new TypeError('Bind must be called on a function');
-var args = slice.call(arguments, 2);
+var bound = restArguments(function(callArgs) {
-var bound = function() {
+return executeBound(func, bound, context, this, args.concat(callArgs));
-return executeBound(func, bound, context, this, args.concat(slice.call(arguments)));
+});
-};
 return bound;
-};
+});
 // Partially apply a function by creating a version that has had some of its
 // arguments pre-filled, without changing its dynamic `this` context. _ acts
-// as a placeholder, allowing any combination of arguments to be pre-filled.
+// as a placeholder by default, allowing any combination of arguments to be
-_.partial = function(func) {
+// pre-filled. Set `_.partial.placeholder` for a custom placeholder argument.
-var boundArgs = slice.call(arguments, 1);
+_.partial = restArguments(function(func, boundArgs) {
+var placeholder = _.partial.placeholder;
 var bound = function() {
 var position = 0, length = boundArgs.length;
 var args = Array(length);
 for (var i = 0; i < length; i++) {
-args[i] = boundArgs[i] === _ ? arguments[position++] : boundArgs[i];
+args[i] = boundArgs[i] === placeholder ? arguments[position++] : boundArgs[i];
 }
 while (position < arguments.length) args.push(arguments[position++]);
 return executeBound(func, bound, this, this, args);
 };
 return bound;
-};
+});
+_.partial.placeholder = _;
 // Bind a number of an object's methods to that object. Remaining arguments
 // are the method names to be bound. Useful for ensuring that all callbacks
 // defined on an object belong to it.
-_.bindAll = function(obj) {
+_.bindAll = restArguments(function(obj, keys) {
-var i, length = arguments.length, key;
+keys = flatten(keys, false, false);
-if (length <= 1) throw new Error('bindAll must be passed function names');
+var index = keys.length;
-for (i = 1; i < length; i++) {
+if (index < 1) throw new Error('bindAll must be passed function names');
-key = arguments[i];
+while (index--) {
+var key = keys[index];
 obj[key] = _.bind(obj[key], obj);
 }
-return obj;
+});
-};
 // Memoize an expensive function by storing its results.
 _.memoize = function(func, hasher) {
 var memoize = function(key) {
 var cache = memoize.cache;
 var address = '' + (hasher ? hasher.apply(this, arguments) : key);
-if (!_.has(cache, address)) cache[address] = func.apply(this, arguments);
+if (!has(cache, address)) cache[address] = func.apply(this, arguments);
 return cache[address];
 };
 memoize.cache = {};
 return memoize;
 };
 // Delays a function for the given number of milliseconds, and then calls
 // it with the arguments supplied.
-_.delay = function(func, wait) {
+_.delay = restArguments(function(func, wait, args) {
-var args = slice.call(arguments, 2);
+return setTimeout(function() {
-return setTimeout(function(){
 return func.apply(null, args);
 }, wait);
-};
+});
 // Defers a function, scheduling it to run after the current call stack has
 // cleared.
 _.defer = _.partial(_.delay, _, 1);
 // during a given window of time. Normally, the throttled function will run
 // as much as it can, without ever going more than once per `wait` duration;
 // but if you'd like to disable the execution on the leading edge, pass
 // `{leading: false}`. To disable execution on the trailing edge, ditto.
 _.throttle = function(func, wait, options) {
-var context, args, result;
+var timeout, context, args, result;
-var timeout = null;
 var previous = 0;
 if (!options) options = {};
 var later = function() {
 previous = options.leading === false ? 0 : _.now();
 timeout = null;
 result = func.apply(context, args);
 if (!timeout) context = args = null;
 };
-return function() {
+var throttled = function() {
 var now = _.now();
 if (!previous && options.leading === false) previous = now;
 var remaining = wait - (now - previous);
 context = this;
 args = arguments;
 } else if (!timeout && options.trailing !== false) {
 timeout = setTimeout(later, remaining);
 }
 return result;
 };
+throttled.cancel = function() {
+clearTimeout(timeout);
+previous = 0;
+timeout = context = args = null;
+};
+return throttled;
 };
 // Returns a function, that, as long as it continues to be invoked, will not
 // be triggered. The function will be called after it stops being called for
 // N milliseconds. If `immediate` is passed, trigger the function on the
 // leading edge, instead of the trailing.
 _.debounce = function(func, wait, immediate) {
-var timeout, args, context, timestamp, result;
+var timeout, result;
-var later = function() {
+var later = function(context, args) {
-var last = _.now() - timestamp;
+timeout = null;
+if (args) result = func.apply(context, args);
-if (last < wait && last >= 0) {
+};
-timeout = setTimeout(later, wait - last);
+var debounced = restArguments(function(args) {
+if (timeout) clearTimeout(timeout);
+if (immediate) {
+var callNow = !timeout;
+timeout = setTimeout(later, wait);
+if (callNow) result = func.apply(this, args);
 } else {
-timeout = null;
+timeout = _.delay(later, wait, this, args);
-if (!immediate) {
-result = func.apply(context, args);
-if (!timeout) context = args = null;
-}
-}
-};
-return function() {
-context = this;
-args = arguments;
-timestamp = _.now();
-var callNow = immediate && !timeout;
-if (!timeout) timeout = setTimeout(later, wait);
-if (callNow) {
-result = func.apply(context, args);
-context = args = null;
 }
 return result;
-};
+});
+debounced.cancel = function() {
+clearTimeout(timeout);
+timeout = null;
+};
+return debounced;
 };
 // Returns the first function passed as an argument to the second,
 // allowing you to adjust arguments, run code before and after, and
 // conditionally execute the original function.
 // Returns a function that will be executed at most one time, no matter how
 // often you call it. Useful for lazy initialization.
 _.once = _.partial(_.before, 2);
+_.restArguments = restArguments;
 // Object Functions
 // ----------------
 // Keys in IE < 9 that won't be iterated by `for key in ...` and thus missed.
 var hasEnumBug = !{toString: null}.propertyIsEnumerable('toString');
 var nonEnumerableProps = ['valueOf', 'isPrototypeOf', 'toString',
 'propertyIsEnumerable', 'hasOwnProperty', 'toLocaleString'];
-function collectNonEnumProps(obj, keys) {
+var collectNonEnumProps = function(obj, keys) {
 var nonEnumIdx = nonEnumerableProps.length;
 var constructor = obj.constructor;
-var proto = (_.isFunction(constructor) && constructor.prototype) || ObjProto;
+var proto = _.isFunction(constructor) && constructor.prototype || ObjProto;
 // Constructor is a special case.
 var prop = 'constructor';
-if (_.has(obj, prop) && !_.contains(keys, prop)) keys.push(prop);
+if (has(obj, prop) && !_.contains(keys, prop)) keys.push(prop);
 while (nonEnumIdx--) {
 prop = nonEnumerableProps[nonEnumIdx];
 if (prop in obj && obj[prop] !== proto[prop] && !_.contains(keys, prop)) {
 keys.push(prop);
 }
 }
-}
+};
 // Retrieve the names of an object's own properties.
-// Delegates to **ECMAScript 5**'s native `Object.keys`
+// Delegates to **ECMAScript 5**'s native `Object.keys`.
 _.keys = function(obj) {
 if (!_.isObject(obj)) return [];
 if (nativeKeys) return nativeKeys(obj);
 var keys = [];
-for (var key in obj) if (_.has(obj, key)) keys.push(key);
+for (var key in obj) if (has(obj, key)) keys.push(key);
 // Ahem, IE < 9.
 if (hasEnumBug) collectNonEnumProps(obj, keys);
 return keys;
 };
 values[i] = obj[keys[i]];
 }
 return values;
 };
-// Returns the results of applying the iteratee to each element of the object
+// Returns the results of applying the iteratee to each element of the object.
-// In contrast to _.map it returns an object
+// In contrast to _.map it returns an object.
 _.mapObject = function(obj, iteratee, context) {
 iteratee = cb(iteratee, context);
-var keys =  _.keys(obj),
+var keys = _.keys(obj),
 length = keys.length,
-results = {},
+results = {};
-currentKey;
+for (var index = 0; index < length; index++) {
-for (var index = 0; index < length; index++) {
+var currentKey = keys[index];
-currentKey = keys[index];
+results[currentKey] = iteratee(obj[currentKey], currentKey, obj);
-results[currentKey] = iteratee(obj[currentKey], currentKey, obj);
+}
-}
+return results;
-return results;
 };
 // Convert an object into a list of `[key, value]` pairs.
+// The opposite of _.object.
 _.pairs = function(obj) {
 var keys = _.keys(obj);
 var length = keys.length;
 var pairs = Array(length);
 for (var i = 0; i < length; i++) {
 }
 return result;
 };
 // Return a sorted list of the function names available on the object.
-// Aliased as `methods`
+// Aliased as `methods`.
 _.functions = _.methods = function(obj) {
 var names = [];
 for (var key in obj) {
 if (_.isFunction(obj[key])) names.push(key);
 }
 return names.sort();
 };
+// An internal function for creating assigner functions.
+var createAssigner = function(keysFunc, defaults) {
+return function(obj) {
+var length = arguments.length;
+if (defaults) obj = Object(obj);
+if (length < 2 || obj == null) return obj;
+for (var index = 1; index < length; index++) {
+var source = arguments[index],
+keys = keysFunc(source),
+l = keys.length;
+for (var i = 0; i < l; i++) {
+var key = keys[i];
+if (!defaults || obj[key] === void 0) obj[key] = source[key];
+}
+}
+return obj;
+};
+};
 // Extend a given object with all the properties in passed-in object(s).
 _.extend = createAssigner(_.allKeys);
-// Assigns a given object with all the own properties in the passed-in object(s)
+// Assigns a given object with all the own properties in the passed-in object(s).
 // (https://developer.mozilla.org/docs/Web/JavaScript/Reference/Global_Objects/Object/assign)
 _.extendOwn = _.assign = createAssigner(_.keys);
-// Returns the first key on an object that passes a predicate test
+// Returns the first key on an object that passes a predicate test.
 _.findKey = function(obj, predicate, context) {
 predicate = cb(predicate, context);
 var keys = _.keys(obj), key;
 for (var i = 0, length = keys.length; i < length; i++) {
 key = keys[i];
 if (predicate(obj[key], key, obj)) return key;
 }
 };
+// Internal pick helper function to determine if `obj` has key `key`.
+var keyInObj = function(value, key, obj) {
+return key in obj;
+};
 // Return a copy of the object only containing the whitelisted properties.
-_.pick = function(object, oiteratee, context) {
+_.pick = restArguments(function(obj, keys) {
-var result = {}, obj = object, iteratee, keys;
+var result = {}, iteratee = keys[0];
 if (obj == null) return result;
-if (_.isFunction(oiteratee)) {
+if (_.isFunction(iteratee)) {
+if (keys.length > 1) iteratee = optimizeCb(iteratee, keys[1]);
 keys = _.allKeys(obj);
-iteratee = optimizeCb(oiteratee, context);
 } else {
-keys = flatten(arguments, false, false, 1);
+iteratee = keyInObj;
-iteratee = function(value, key, obj) { return key in obj; };
+keys = flatten(keys, false, false);
 obj = Object(obj);
 }
 for (var i = 0, length = keys.length; i < length; i++) {
 var key = keys[i];
 var value = obj[key];
 if (iteratee(value, key, obj)) result[key] = value;
 }
 return result;
-};
+});
 // Return a copy of the object without the blacklisted properties.
-_.omit = function(obj, iteratee, context) {
+_.omit = restArguments(function(obj, keys) {
+var iteratee = keys[0], context;
 if (_.isFunction(iteratee)) {
 iteratee = _.negate(iteratee);
+if (keys.length > 1) context = keys[1];
 } else {
-var keys = _.map(flatten(arguments, false, false, 1), String);
+keys = _.map(flatten(keys, false, false), String);
 iteratee = function(value, key) {
 return !_.contains(keys, key);
 };
 }
 return _.pick(obj, iteratee, context);
-};
+});
 // Fill in a given object with default properties.
 _.defaults = createAssigner(_.allKeys, true);
 // Creates an object that inherits from the given prototype object.
 return true;
 };
 // Internal recursive comparison function for `isEqual`.
-var eq = function(a, b, aStack, bStack) {
+var eq, deepEq;
+eq = function(a, b, aStack, bStack) {
 // Identical objects are equal. `0 === -0`, but they aren't identical.
 // See the [Harmony `egal` proposal](http://wiki.ecmascript.org/doku.php?id=harmony:egal).
 if (a === b) return a !== 0 || 1 / a === 1 / b;
-// A strict comparison is necessary because `null == undefined`.
+// `null` or `undefined` only equal to itself (strict comparison).
-if (a == null || b == null) return a === b;
+if (a == null || b == null) return false;
+// `NaN`s are equivalent, but non-reflexive.
+if (a !== a) return b !== b;
+// Exhaust primitive checks
+var type = typeof a;
+if (type !== 'function' && type !== 'object' && typeof b != 'object') return false;
+return deepEq(a, b, aStack, bStack);
+};
+// Internal recursive comparison function for `isEqual`.
+deepEq = function(a, b, aStack, bStack) {
 // Unwrap any wrapped objects.
 if (a instanceof _) a = a._wrapped;
 if (b instanceof _) b = b._wrapped;
 // Compare `[[Class]]` names.
 var className = toString.call(a);
 // Primitives and their corresponding object wrappers are equivalent; thus, `"5"` is
 // equivalent to `new String("5")`.
 return '' + a === '' + b;
 case '[object Number]':
 // `NaN`s are equivalent, but non-reflexive.
-// Object(NaN) is equivalent to NaN
+// Object(NaN) is equivalent to NaN.
 if (+a !== +a) return +b !== +b;
 // An `egal` comparison is performed for other numeric values.
 return +a === 0 ? 1 / +a === 1 / b : +a === +b;
 case '[object Date]':
 case '[object Boolean]':
 // Coerce dates and booleans to numeric primitive values. Dates are compared by their
 // millisecond representations. Note that invalid dates with millisecond representations
 // of `NaN` are not equivalent.
 return +a === +b;
+case '[object Symbol]':
+return SymbolProto.valueOf.call(a) === SymbolProto.valueOf.call(b);
 }
 var areArrays = className === '[object Array]';
 if (!areArrays) {
 if (typeof a != 'object' || typeof b != 'object') return false;
 // Ensure that both objects contain the same number of properties before comparing deep equality.
 if (_.keys(b).length !== length) return false;
 while (length--) {
 // Deep compare each member
 key = keys[length];
-if (!(_.has(b, key) && eq(a[key], b[key], aStack, bStack))) return false;
+if (!(has(b, key) && eq(a[key], b[key], aStack, bStack))) return false;
 }
 }
 // Remove the first object from the stack of traversed objects.
 aStack.pop();
 bStack.pop();
 _.isObject = function(obj) {
 var type = typeof obj;
 return type === 'function' || type === 'object' && !!obj;
 };
-// Add some isType methods: isArguments, isFunction, isString, isNumber, isDate, isRegExp, isError.
+// Add some isType methods: isArguments, isFunction, isString, isNumber, isDate, isRegExp, isError, isMap, isWeakMap, isSet, isWeakSet.
-_.each(['Arguments', 'Function', 'String', 'Number', 'Date', 'RegExp', 'Error'], function(name) {
+_.each(['Arguments', 'Function', 'String', 'Number', 'Date', 'RegExp', 'Error', 'Symbol', 'Map', 'WeakMap', 'Set', 'WeakSet'], function(name) {
 _['is' + name] = function(obj) {
 return toString.call(obj) === '[object ' + name + ']';
 };
 });
 // Define a fallback version of the method in browsers (ahem, IE < 9), where
 // there isn't any inspectable "Arguments" type.
 if (!_.isArguments(arguments)) {
 _.isArguments = function(obj) {
-return _.has(obj, 'callee');
+return has(obj, 'callee');
 };
 }
 // Optimize `isFunction` if appropriate. Work around some typeof bugs in old v8,
-// IE 11 (#1621), and in Safari 8 (#1929).
+// IE 11 (#1621), Safari 8 (#1929), and PhantomJS (#2236).
-if (typeof /./ != 'function' && typeof Int8Array != 'object') {
+var nodelist = root.document && root.document.childNodes;
+if (typeof /./ != 'function' && typeof Int8Array != 'object' && typeof nodelist != 'function') {
 _.isFunction = function(obj) {
 return typeof obj == 'function' || false;
 };
 }
 // Is a given object a finite number?
 _.isFinite = function(obj) {
-return isFinite(obj) && !isNaN(parseFloat(obj));
+return !_.isSymbol(obj) && isFinite(obj) && !isNaN(parseFloat(obj));
 };
-// Is the given value `NaN`? (NaN is the only number which does not equal itself).
+// Is the given value `NaN`?
 _.isNaN = function(obj) {
-return _.isNumber(obj) && obj !== +obj;
+return _.isNumber(obj) && isNaN(obj);
 };
 // Is a given value a boolean?
 _.isBoolean = function(obj) {
 return obj === true || obj === false || toString.call(obj) === '[object Boolean]';
 return obj === void 0;
 };
 // Shortcut function for checking if an object has a given property directly
 // on itself (in other words, not on a prototype).
-_.has = function(obj, key) {
+_.has = function(obj, path) {
-return obj != null && hasOwnProperty.call(obj, key);
+if (!_.isArray(path)) {
+return has(obj, path);
+}
+var length = path.length;
+for (var i = 0; i < length; i++) {
+var key = path[i];
+if (obj == null || !hasOwnProperty.call(obj, key)) {
+return false;
+}
+obj = obj[key];
+}
+return !!length;
 };
 // Utility Functions
 // -----------------
 };
 };
 _.noop = function(){};
-_.property = property;
+// Creates a function that, when passed an object, will traverse that object’s
+// properties down the given `path`, specified as an array of keys or indexes.
+_.property = function(path) {
+if (!_.isArray(path)) {
+return shallowProperty(path);
+}
+return function(obj) {
+return deepGet(obj, path);
+};
+};
 // Generates a function for a given object that returns a given property.
 _.propertyOf = function(obj) {
-return obj == null ? function(){} : function(key) {
+if (obj == null) {
-return obj[key];
+return function(){};
+}
+return function(path) {
+return !_.isArray(path) ? obj[path] : deepGet(obj, path);
 };
 };
 // Returns a predicate for checking whether an object has a given set of
 // `key:value` pairs.
 // A (possibly faster) way to get the current timestamp as an integer.
 _.now = Date.now || function() {
 return new Date().getTime();
 };
 // List of HTML entities for escaping.
 var escapeMap = {
 '&': '&amp;',
 '<': '&lt;',
 '>': '&gt;',
 '"': '&quot;',
 // Functions for escaping and unescaping strings to/from HTML interpolation.
 var createEscaper = function(map) {
 var escaper = function(match) {
 return map[match];
 };
-// Regexes for identifying a key that needs to be escaped
+// Regexes for identifying a key that needs to be escaped.
 var source = '(?:' + _.keys(map).join('|') + ')';
 var testRegexp = RegExp(source);
 var replaceRegexp = RegExp(source, 'g');
 return function(string) {
 string = string == null ? '' : '' + string;
 };
 };
 _.escape = createEscaper(escapeMap);
 _.unescape = createEscaper(unescapeMap);
-// If the value of the named `property` is a function then invoke it with the
+// Traverses the children of `obj` along `path`. If a child is a function, it
-// `object` as context; otherwise, return it.
+// is invoked with its parent as context. Returns the value of the final
-_.result = function(object, property, fallback) {
+// child, or `fallback` if any child is undefined.
-var value = object == null ? void 0 : object[property];
+_.result = function(obj, path, fallback) {
-if (value === void 0) {
+if (!_.isArray(path)) path = [path];
-value = fallback;
+var length = path.length;
-}
+if (!length) {
-return _.isFunction(value) ? value.call(object) : value;
+return _.isFunction(fallback) ? fallback.call(obj) : fallback;
+}
+for (var i = 0; i < length; i++) {
+var prop = obj == null ? void 0 : obj[path[i]];
+if (prop === void 0) {
+prop = fallback;
+i = length; // Ensure we don't continue iterating.
+}
+obj = _.isFunction(prop) ? prop.call(obj) : prop;
+}
+return obj;
 };
 // Generate a unique integer id (unique within the entire client session).
 // Useful for temporary DOM ids.
 var idCounter = 0;
 };
 // By default, Underscore uses ERB-style template delimiters, change the
 // following template settings to use alternative delimiters.
 _.templateSettings = {
-evaluate    : /<%([\s\S]+?)%>/g,
+evaluate: /<%([\s\S]+?)%>/g,
-interpolate : /<%=([\s\S]+?)%>/g,
+interpolate: /<%=([\s\S]+?)%>/g,
-escape      : /<%-([\s\S]+?)%>/g
+escape: /<%-([\s\S]+?)%>/g
 };
 // When customizing `templateSettings`, if you don't want to define an
 // interpolation, evaluation or escaping regex, we need one that is
 // guaranteed not to match.
 var noMatch = /(.)^/;
 // Certain characters need to be escaped so that they can be put into a
 // string literal.
 var escapes = {
-"'":      "'",
+"'": "'",
-'\\':     '\\',
+'\\': '\\',
-'\r':     'r',
+'\r': 'r',
-'\n':     'n',
+'\n': 'n',
 '\u2028': 'u2028',
 '\u2029': 'u2029'
 };
-var escaper = /\\|'|\r|\n|\u2028|\u2029/g;
+var escapeRegExp = /\\|'|\r|\n|\u2028|\u2029/g;
 var escapeChar = function(match) {
 return '\\' + escapes[match];
 };
 // Compile the template source, escaping string literals appropriately.
 var index = 0;
 var source = "__p+='";
 text.replace(matcher, function(match, escape, interpolate, evaluate, offset) {
-source += text.slice(index, offset).replace(escaper, escapeChar);
+source += text.slice(index, offset).replace(escapeRegExp, escapeChar);
 index = offset + match.length;
 if (escape) {
 source += "'+\n((__t=(" + escape + "))==null?'':_.escape(__t))+\n'";
 } else if (interpolate) {
 source += "'+\n((__t=(" + interpolate + "))==null?'':__t)+\n'";
 } else if (evaluate) {
 source += "';\n" + evaluate + "\n__p+='";
 }
-// Adobe VMs need the match returned to produce the correct offest.
+// Adobe VMs need the match returned to produce the correct offset.
 return match;
 });
 source += "';\n";
 // If a variable is not specified, place data values in local scope.
 source = "var __t,__p='',__j=Array.prototype.join," +
 "print=function(){__p+=__j.call(arguments,'');};\n" +
 source + 'return __p;\n';
+var render;
 try {
-var render = new Function(settings.variable || 'obj', '_', source);
+render = new Function(settings.variable || 'obj', '_', source);
 } catch (e) {
 e.source = source;
 throw e;
 }
 // If Underscore is called as a function, it returns a wrapped object that
 // can be used OO-style. This wrapper holds altered versions of all the
 // underscore functions. Wrapped objects may be chained.
 // Helper function to continue chaining intermediate results.
-var result = function(instance, obj) {
+var chainResult = function(instance, obj) {
 return instance._chain ? _(obj).chain() : obj;
 };
 // Add your own custom functions to the Underscore object.
 _.mixin = function(obj) {
 _.each(_.functions(obj), function(name) {
 var func = _[name] = obj[name];
 _.prototype[name] = function() {
 var args = [this._wrapped];
 push.apply(args, arguments);
-return result(this, func.apply(_, args));
+return chainResult(this, func.apply(_, args));
 };
 });
+return _;
 };
 // Add all of the Underscore functions to the wrapper object.
 _.mixin(_);
 var method = ArrayProto[name];
 _.prototype[name] = function() {
 var obj = this._wrapped;
 method.apply(obj, arguments);
 if ((name === 'shift' || name === 'splice') && obj.length === 0) delete obj[0];
-return result(this, obj);
+return chainResult(this, obj);
 };
 });
 // Add all accessor Array functions to the wrapper.
 _.each(['concat', 'join', 'slice'], function(name) {
 var method = ArrayProto[name];
 _.prototype[name] = function() {
-return result(this, method.apply(this._wrapped, arguments));
+return chainResult(this, method.apply(this._wrapped, arguments));
 };
 });
 // Extracts the result from a wrapped and chained object.
 _.prototype.value = function() {
 // Provide unwrapping proxy for some methods used in engine operations
 // such as arithmetic and JSON stringification.
 _.prototype.valueOf = _.prototype.toJSON = _.prototype.value;
 _.prototype.toString = function() {
-return '' + this._wrapped;
+return String(this._wrapped);
 };
 // AMD registration happens at the end for compatibility with AMD loaders
 // that may not enforce next-turn semantics on modules. Even though general
 // practice for AMD registration is to be anonymous, underscore registers
 // as a named module because, like jQuery, it is a base library that is
 // popular enough to be bundled in a third party lib, but not be part of
 // an AMD load request. Those cases could generate an error when an
 // anonymous define() is called outside of a loader request.
-if (typeof define === 'function' && define.amd) {
+if (typeof define == 'function' && define.amd) {
 define('underscore', [], function() {
 return _;
 });
 }
-}.call(this));
+}());

tweet_live