[Omnibox] Changing scheme from https:// to http:// results in DCHECK (Always).

chrome/browser/autocomplete/url_index_private_data.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/autocomplete/url_index_private_data.h"
 
 #include <functional>
 #include <iterator>
 #include <limits>
 #include <numeric>
@@ skipping 1271 matching lines @@
   // Calculate offsets for each term.  For instance, the offset for
   // ".net" should be 1, indicating that the actual word-part of the term
   // starts at offset 1.
   lower_terms_to_word_starts_offsets_.resize(lower_terms_.size(), 0u);
   for (size_t i = 0; i < lower_terms_.size(); ++i) {
     base::i18n::BreakIterator iter(lower_terms_[i],
                                    base::i18n::BreakIterator::BREAK_WORD);
     // If the iterator doesn't work, assume an offset of 0.
     if (!iter.Init())
       continue;
-    // Find the first word start.
+    // Find the first word start. If the iterator didn't find a word break, set
+    // an offset of term size. For an instance, the offset for "://" should be

[Mark P, 2015/06/08 18:13:16]

nit: For an instance -> For example

[Pritam Nikam, 2015/06/09 10:03:53]

Done.

+    // 3, indicating that the word-part is missing.
     while (iter.Advance() && !iter.IsWord()) {}
-    if (iter.IsWord())
-      lower_terms_to_word_starts_offsets_[i] = iter.prev();
-    // Else: the iterator didn't find a word break.  Assume an offset of 0.
+
+    lower_terms_to_word_starts_offsets_[i] = iter.prev();
   }
 }
 
 URLIndexPrivateData::AddHistoryMatch::~AddHistoryMatch() {
 }
 
 void URLIndexPrivateData::AddHistoryMatch::operator()(
     const HistoryID history_id) {
   HistoryInfoMap::const_iterator hist_pos =
       private_data_.history_info_map_.find(history_id);
@@ skipping 38 matching lines @@
   // First cut: typed count, visit count, recency.
   // TODO(mrossetti): This is too simplistic. Consider an approach which ranks
   // recently visited (within the last 12/24 hours) as highly important. Get
   // input from mpearson.
   if (r1.typed_count() != r2.typed_count())
     return (r1.typed_count() > r2.typed_count());
   if (r1.visit_count() != r2.visit_count())
     return (r1.visit_count() > r2.visit_count());
   return (r1.last_visit() > r2.last_visit());
 }