Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

Fixed bug in _.sortedIndex that put undefined at the start (FIX: #1834) #2042

Closed
wants to merge 2 commits into from
Closed

Fixed bug in _.sortedIndex that put undefined at the start (FIX: #1834) #2042

Show file tree
Hide file tree
Changes from 1 commit
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
9559d6e
Fixed bug in _.sortedIndex that would put undefined at the start (FIX…
arianf Feb 9, 2015
80942ef
updated Number.MAX_VALUE to be a really big number
arianf Feb 9, 2015
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
27 changes: 27 additions & 0 deletions test/arrays.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -137,6 +137,33 @@
equal(_.sortedIndex(array, 2147483648), 2147483648, 'should work with large indexes');
});

test('sortedIndex conforms to sortBy for undefined (#1834)', function() {
var sorted = _.sortBy([undefined, 1, undefined, 2]);
equal(_.sortedIndex(sorted, undefined, _.identity), 2);

var edgeCaseNumbers = [-Infinity, -Infinity, 0, Number.MAX_VALUE, Infinity, Infinity, undefined, undefined, NaN];
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Number.MAX_VALUE won't exist in all environments. Other than that we'll have to discuss the implications. May be worth while to consider #1882 at the same time

Copy link
Contributor

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Number.MAX_VALUE is like ES3 or smth it should be supported everywhere.

Copy link
Contributor Author

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I updated Number.MAX_VALUE to be just a really big number. What do you think of the rest of it?


var indexForUndefined = _.sortedIndex(edgeCaseNumbers, undefined);
equal(indexForUndefined, 6, 'undefined should be inserted at index 6');

var indexForNegInfinity = _.sortedIndex(edgeCaseNumbers, -Infinity);
equal(indexForNegInfinity, 0, 'negative infinity should be inserted at index 0');

var indexForInfinity = _.sortedIndex(edgeCaseNumbers, Infinity);
equal(indexForInfinity, 4, 'infinity should be inserted at index 4');

var indexForZero = _.sortedIndex(edgeCaseNumbers, 0);
equal(indexForZero, 2, '0 should be inserted at index 2');

var indexForNaN = _.sortedIndex(edgeCaseNumbers, NaN);
equal(indexForNaN, 8, 'NaN should be inserted at index 8');

var numbers = [10, 20, 30, 40, 50];

var indexForUndefinedSimple = _.sortedIndex(numbers, undefined);
equal(indexForUndefinedSimple, 5, 'undefined should be inserted at index 5');
});

test('uniq', function() {
var list = [1, 2, 1, 3, 1, 4];
deepEqual(_.uniq(list), [1, 2, 3, 4], 'can find the unique values of an unsorted array');
Expand Down
3 changes: 2 additions & 1 deletion underscore.js
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -685,7 +685,8 @@
var low = 0, high = array.length;
while (low < high) {
var mid = Math.floor((low + high) / 2);
if (iteratee(array[mid]) < value) low = mid + 1; else high = mid;
var cur = iteratee(array[mid]);
if ( cur < value || (value === void 0 && cur <= Infinity) || (_.isNaN(value) && (cur <= Infinity || cur === void 0))) low = mid + 1; else high = mid;
Copy link
Collaborator

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

I've been pretty busy the past couple weeks (exam time) but I'm playing with this logic now. I've almost got it passing (1 failing test) with this

if ( cur < value || (cur <= Infinity && !(value <= value)) ) low = mid + 1;
else high = mid;

}
return low;
};
Expand Down