| Index: chrome/browser/history/select_favicon_frames.cc
|
| diff --git a/chrome/browser/history/select_favicon_frames.cc b/chrome/browser/history/select_favicon_frames.cc
|
| index 36a9b13a5d4529f6bc1d24d7713cff319c91e50c..5ce365a98f490e2ef547eda92933b4474ed90f74 100644
|
| --- a/chrome/browser/history/select_favicon_frames.cc
|
| +++ b/chrome/browser/history/select_favicon_frames.cc
|
| @@ -122,7 +122,7 @@ size_t GetCandidateIndexWithBestScore(
|
|
|
| // 2. Integer multiples are built using nearest neighbor sampling.
|
| // 3. Else, use Lancosz scaling:
|
| - // b) If available, from the next bigger variant.
|
| + // a) If available, from the next bigger variant.
|
| int candidate_index = -1;
|
| int min_area = INT_MAX;
|
| for (size_t i = 0; i < candidate_sizes.size(); ++i) {
|
| @@ -135,7 +135,7 @@ size_t GetCandidateIndexWithBestScore(
|
| }
|
| }
|
| *score = 0.1f;
|
| - // c) Else, from the biggest smaller variant.
|
| + // b) Else, from the biggest smaller variant.
|
| if (candidate_index == -1) {
|
| *score = 0;
|
| candidate_index = BiggestCandidate(candidate_sizes);
|
|
|