Commit ac078952 authored by yangguo@chromium.org's avatar yangguo@chromium.org

Revert "Fix a potential overflow in SortedListBSearch".

This reverts r21960.

R=jochen@chromium.org

Review URL: https://codereview.chromium.org/422853005

git-svn-id: https://v8.googlecode.com/svn/branches/bleeding_edge@22636 ce2b1a6d-e550-0410-aec6-3dcde31c8c00
parent 579dbe40
......@@ -220,7 +220,7 @@ int SortedListBSearch(const List<T>& list, P cmp) {
int low = 0;
int high = list.length() - 1;
while (low <= high) {
int mid = low + (high - low) / 2;
int mid = (low + high) / 2;
T mid_elem = list[mid];
if (cmp(&mid_elem) > 0) {
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment