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

Cleanup lodash.js.

Browse Source 
Former-commit-id: 7a2443719a96b36ae53b2f7d0fe2a1867d650f02
This commit is contained in:
John-David Dalton
2012-10-04 00:25:32 -07:00
parent 21217dfda3
commit a0cb8ec124
1 changed files with 12 additions and 17 deletions
Download Patch File Download Diff File Expand all files Collapse all files

29
lodash.js
View File

@@ -2548,13 +2548,11 @@
var index = -1,
length = array ? array.length : 0;
if (fromIndex) {
if (typeof fromIndex == 'number') {
index = (fromIndex < 0 ? nativeMax(0, length + fromIndex) : fromIndex) - 1;
} else {
index = sortedIndex(array, value);
return array[index] === value ? index : -1;
}
if (typeof fromIndex == 'number') {
index = (fromIndex < 0 ? nativeMax(0, length + fromIndex) : fromIndex || 0) - 1;
} else if (fromIndex) {
index = sortedIndex(array, value);
return array[index] === value ? index : -1;
}
while (++index < length) {
if (array[index] === value) {
@@ -2669,7 +2667,7 @@
*/
function lastIndexOf(array, value, fromIndex) {
var index = array ? array.length : 0;
if (fromIndex && typeof fromIndex == 'number') {
if (typeof fromIndex == 'number') {
index = (fromIndex < 0 ? nativeMax(0, index + fromIndex) : nativeMin(fromIndex, index - 1)) + 1;
}
while (index--) {
@@ -2879,13 +2877,12 @@
* // => [4, 1, 6, 3, 5, 2]
*/
function shuffle(array) {
var rand,
index = -1,
var index = -1,
length = array ? array.length : 0,
result = Array(length);
while (++index < length) {
rand = nativeFloor(nativeRandom() * (index + 1));
var rand = nativeFloor(nativeRandom() * (index + 1));
result[index] = result[rand];
result[rand] = array[index];
}
@@ -2933,14 +2930,13 @@
* // => 2
*/
function sortedIndex(array, value, callback, thisArg) {
var mid,
low = 0,
var low = 0,
high = array ? array.length : low;
callback = createCallback(callback, thisArg);
value = callback(value);
while (low < high) {
mid = (low + high) >>> 1;
var mid = (low + high) >>> 1;
callback(array[mid]) < value ? low = mid + 1 : high = mid;
}
return low;
@@ -3006,8 +3002,7 @@
* // => [1, 2, 3]
*/
function uniq(array, isSorted, callback, thisArg) {
var computed,
index = -1,
var index = -1,
length = array ? array.length : 0,
result = [],
seen = [];
@@ -3020,7 +3015,7 @@
}
callback = createCallback(callback, thisArg);
while (++index < length) {
computed = callback(array[index], index, array);
var computed = callback(array[index], index, array);
if (isSorted
? !index || seen[seen.length - 1] !== computed
: indexOf(seen, computed) < 0