Mirrors/lodash
1
0
Fork 0
mirror of https://github.com/whoisclebs/lodash.git synced 2026-02-09 10:27:49 +00:00
Code Issues Packages Projects Releases Wiki Activity

Merge branch 'master' of github.com:documentcloud/underscore

Browse Source
This commit is contained in:
Jeremy Ashkenas
2011-04-15 16:09:54 -04:00
parent 5e051fb0ed 1fc7d4b049
commit b6c39fec74
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

8
underscore.js
View File

@@ -168,7 +168,7 @@
// Delegates to **ECMAScript 5**'s native `every` if available. // Delegates to **ECMAScript 5**'s native `every` if available.
// Aliased as `all`. // Aliased as `all`.
_.every = _.all = function(obj, iterator, context) { _.every = _.all = function(obj, iterator, context) {
iterator = iterator || _.identity; iterator || (iterator = _.identity);
var result = true; var result = true;
if (obj == null) return result; if (obj == null) return result;
if (nativeEvery && obj.every === nativeEvery) return obj.every(iterator, context); if (nativeEvery && obj.every === nativeEvery) return obj.every(iterator, context);
@@ -182,7 +182,7 @@
// Delegates to **ECMAScript 5**'s native `some` if available. // Delegates to **ECMAScript 5**'s native `some` if available.
// Aliased as `any`. // Aliased as `any`.
var any = _.some = _.any = function(obj, iterator, context) { var any = _.some = _.any = function(obj, iterator, context) {
iterator = iterator || _.identity; iterator || (iterator = _.identity);
var result = false; var result = false;
if (obj == null) return result; if (obj == null) return result;
if (nativeSome && obj.some === nativeSome) return obj.some(iterator, context); if (nativeSome && obj.some === nativeSome) return obj.some(iterator, context);
@@ -255,7 +255,7 @@
// Use a comparator function to figure out at what index an object should // Use a comparator function to figure out at what index an object should
// be inserted so as to maintain order. Uses binary search. // be inserted so as to maintain order. Uses binary search.
_.sortedIndex = function(array, obj, iterator) { _.sortedIndex = function(array, obj, iterator) {
iterator = iterator || _.identity; iterator || (iterator = _.identity);
var low = 0, high = array.length; var low = 0, high = array.length;
while (low < high) { while (low < high) {
var mid = (low + high) >> 1; var mid = (low + high) >> 1;
@@ -429,7 +429,7 @@
// Memoize an expensive function by storing its results. // Memoize an expensive function by storing its results.
_.memoize = function(func, hasher) { _.memoize = function(func, hasher) {
var memo = {}; var memo = {};
hasher = hasher || _.identity; hasher || (hasher = _.identity);
return function() { return function() {
var key = hasher.apply(this, arguments); var key = hasher.apply(this, arguments);
return hasOwnProperty.call(memo, key) ? memo[key] : (memo[key] = func.apply(this, arguments)); return hasOwnProperty.call(memo, key) ? memo[key] : (memo[key] = func.apply(this, arguments));