Stop history search going on beyond the start of history....

chrome/browser/history/history_types.cc

 // Copyright (c) 2006-2008 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 <limits>
 
 #include "chrome/browser/history/history_types.h"
 
 using base::Time;
 
@@ skipping 74 matching lines @@
 
 void URLResult::Swap(URLResult* other) {
   URLRow::Swap(other);
   std::swap(visit_time_, other->visit_time_);
   snippet_.Swap(&other->snippet_);
   title_match_positions_.swap(other->title_match_positions_);
 }
 
 // QueryResults ----------------------------------------------------------------
 
-QueryResults::QueryResults() {
+QueryResults::QueryResults() : reached_beginning_(false) {
 }
 
 QueryResults::~QueryResults() {
   // Free all the URL objects.
   STLDeleteContainerPointers(results_.begin(), results_.end());
 }
 
 const size_t* QueryResults::MatchesForURL(const GURL& url,
                                           size_t* num_matches) const {
   URLToResultIndices::const_iterator found = url_to_results_.find(url);
   if (found == url_to_results_.end()) {
     if (num_matches)
       *num_matches = 0;
     return NULL;
   }
 
   // All entries in the map should have at least one index, otherwise it
   // shouldn't be in the map.
   DCHECK(found->second->size() > 0);
   if (num_matches)
     *num_matches = found->second->size();
   return &found->second->front();
 }
 
 void QueryResults::Swap(QueryResults* other) {
   std::swap(first_time_searched_, other->first_time_searched_);
+  std::swap(reached_beginning_, other->reached_beginning_);
   results_.swap(other->results_);
   url_to_results_.swap(other->url_to_results_);
 }
 
 void QueryResults::AppendURLBySwapping(URLResult* result) {
   URLResult* new_result = new URLResult;
   new_result->Swap(result);
 
   results_.push_back(new_result);
   AddURLUsageAtIndex(new_result->url(), results_.size() - 1);
 }
 
 void QueryResults::AppendResultsBySwapping(QueryResults* other,
                                            bool remove_dupes) {
   if (remove_dupes) {
     // Delete all entries in the other array that are already in this one.
     for (size_t i = 0; i < results_.size(); i++)
       other->DeleteURL(results_[i]->url());
   }
 
   if (first_time_searched_ > other->first_time_searched_)
     std::swap(first_time_searched_, other->first_time_searched_);
 
+  if (reached_beginning_ != other->reached_beginning_)
+    std::swap(reached_beginning_, other->reached_beginning_);
+
   for (size_t i = 0; i < other->results_.size(); i++) {
     // Just transfer pointer ownership.
     results_.push_back(other->results_[i]);
     AddURLUsageAtIndex(results_.back()->url(), results_.size() - 1);
   }
 
   // We just took ownership of all the results in the input vector.
   other->results_.clear();
   other->url_to_results_.clear();
 }
@@ skipping 71 matching lines @@
     for (size_t match = 0; match < i->second->size(); match++) {
       size_t match_index = i->second[match];
       if (match_index >= begin && match_index <= end)
         i->second[match] += delta;
     }
   }
 }
 
 }  // namespace history