Coverity: Remove dead code.

chrome/browser/history/scored_history_match.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/scored_history_match.h"
 
 #include <algorithm>
 #include <functional>
 #include <iterator>
 #include <numeric>
@@ skipping 374 matching lines @@
     if (term_score < 10) {
       // If the term scores less than 10 points (no full-credit hit, or
       // no combination of hits that score that well), then the topicality
       // score is linear in the term score.
       topicality_score = 0.1 * term_score;
     } else {
       // For term scores of at least ten points, pass them through a log
       // function so a score of 10 points gets a 1.0 (to meet up exactly
       // with the linear component) and increases logarithmically until
       // maxing out at 30 points, with computes to a score around 2.1.
-      topicality_score = (1.0 + 2.25 * log10(0.1 *
-          ((term_score <= 30) ? term_score : 30)));
+      topicality_score = (1.0 + 2.25 * log10(0.1 * term_score));
     }
     raw_term_score_to_topicality_score[term_score] = topicality_score;
   }
 }
 
 // static
 float* ScoredHistoryMatch::days_ago_to_recency_score = NULL;
 
 // static
 float ScoredHistoryMatch::GetRecencyScore(int last_visit_days_ago) {
@@ skipping 56 matching lines @@
 
 // static
 float ScoredHistoryMatch::GetPopularityScore(int typed_count,
                                              int visit_count) {
   // The max()s are to guard against database corruption.
   return (std::max(typed_count, 0) * 5.0 + std::max(visit_count, 0) * 3.0) /
       (5.0 + 3.0);
 }
 
 }  // namespace history