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

Cleanup baseSortedUniq and add more uniq related tests.

Browse Source
This commit is contained in:
John-David Dalton
2015-08-28 08:53:05 -07:00
parent fcbe4620cd
commit cffeec4713
2 changed files with 82 additions and 87 deletions
Download Patch File Download Diff File Expand all files Collapse all files

34
lodash.js
View File

@@ -2621,29 +2621,33 @@
* @returns {Array} Returns the new duplicate free array.
*/
function baseSortedUniq(array, iteratee) {
var index = -1,
var length = array.length;
if (!length) {
return [];
}
var index = 0,
indexOf = getIndexOf(),
isCommon = indexOf === baseIndexOf,
length = array.length,
seen = isCommon ? undefined : [],
resIndex = -1,
result = [];
value = array[0],
computed = iteratee ? iteratee(value, 0, array) : value,
seen = isCommon ? computed : [computed],
resIndex = 0,
result = [value];
while (++index < length) {
var value = array[index],
computed = iteratee ? iteratee(value, index, array) : value;
value = array[index],
computed = iteratee ? iteratee(value, index, array) : value;
if (isCommon && value === value) {
if (seen !== computed || !index) {
seen = computed
result[++resIndex] = value;
}
} else {
if (!index || indexOf(seen, computed, 0) < 0) {
seen.push(computed);
if (isCommon) {
if ((value === value ? (seen !== computed) : (indexOf(seen, computed, 0) < 0))) {
seen = computed;
result[++resIndex] = value;
}
}
else if (indexOf(seen, computed, 0) < 0) {
seen[++resIndex] = computed;
result[resIndex] = value;
}
}
return result;
}