Fix comment numbering

chrome/browser/history/select_favicon_frames.cc

 // Copyright (c) 2012 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "chrome/browser/history/select_favicon_frames.h"
 
 #include <set>
 
 #include "skia/ext/image_operations.h"
 #include "third_party/skia/include/core/SkCanvas.h"
@@ skipping 104 matching lines @@
           candidate_sizes[i].height() * scale == source_size) {
         *score = 0.15f;
         *resize_method = PAD_WITH_BORDER;
         return i;
       }
     }
   }
 
   // 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) {
     int area = candidate_sizes[i].GetArea();
     if (candidate_sizes[i].width() > desired_size &&
         candidate_sizes[i].height() > desired_size &&
         (candidate_index == -1 || area < min_area)) {
       candidate_index = i;
       min_area = area;
     }
   }
   *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);
   }
 
   const gfx::Size& candidate_size = candidate_sizes[candidate_index];
   if (candidate_size.IsEmpty()) {
     *resize_method = NONE;
   } else if (desired_size % candidate_size.width() == 0 &&
              desired_size % candidate_size.height() == 0) {
@@ skipping 126 matching lines @@
     // GetCandidateIndicesWithBestScores() will return duplicate indices if the
     // bitmap data with |frame_pixel_sizes[index]| should be used for multiple
     // scale factors. Remove duplicates here such that |best_indices| contains
     // no duplicates.
     if (already_added.find(index) == already_added.end()) {
       already_added.insert(index);
       best_indices->push_back(index);
     }
   }
 }