replace OVERRIDE and FINAL with override and final in components/

components/query_parser/query_parser.cc

 // Copyright 2014 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 "components/query_parser/query_parser.h"
 
 #include <algorithm>
 
 #include "base/compiler_specific.h"
 #include "base/i18n/break_iterator.h"
@@ skipping 56 matching lines @@
 class QueryNodeWord : public QueryNode {
  public:
   explicit QueryNodeWord(const base::string16& word);
   virtual ~QueryNodeWord();
 
   const base::string16& word() const { return word_; }
 
   void set_literal(bool literal) { literal_ = literal; }
 
   // QueryNode:
-  virtual int AppendToSQLiteQuery(base::string16* query) const OVERRIDE;
-  virtual bool IsWord() const OVERRIDE;
-  virtual bool Matches(const base::string16& word, bool exact) const OVERRIDE;
+  virtual int AppendToSQLiteQuery(base::string16* query) const override;
+  virtual bool IsWord() const override;
+  virtual bool Matches(const base::string16& word, bool exact) const override;
   virtual bool HasMatchIn(
       const QueryWordVector& words,
-      Snippet::MatchPositions* match_positions) const OVERRIDE;
+      Snippet::MatchPositions* match_positions) const override;
   virtual bool HasMatchIn(
-      const QueryWordVector& words) const OVERRIDE;
-  virtual void AppendWords(std::vector<base::string16>* words) const OVERRIDE;
+      const QueryWordVector& words) const override;
+  virtual void AppendWords(std::vector<base::string16>* words) const override;
 
  private:
   base::string16 word_;
   bool literal_;
 
   DISALLOW_COPY_AND_ASSIGN(QueryNodeWord);
 };
 
 QueryNodeWord::QueryNodeWord(const base::string16& word)
     : word_(word),
@@ skipping 55 matching lines @@
   virtual ~QueryNodeList();
 
   QueryNodeStarVector* children() { return &children_; }
 
   void AddChild(QueryNode* node);
 
   // Remove empty subnodes left over from other parsing.
   void RemoveEmptySubnodes();
 
   // QueryNode:
-  virtual int AppendToSQLiteQuery(base::string16* query) const OVERRIDE;
-  virtual bool IsWord() const OVERRIDE;
-  virtual bool Matches(const base::string16& word, bool exact) const OVERRIDE;
+  virtual int AppendToSQLiteQuery(base::string16* query) const override;
+  virtual bool IsWord() const override;
+  virtual bool Matches(const base::string16& word, bool exact) const override;
   virtual bool HasMatchIn(
       const QueryWordVector& words,
-      Snippet::MatchPositions* match_positions) const OVERRIDE;
-  virtual bool HasMatchIn(const QueryWordVector& words) const OVERRIDE;
-  virtual void AppendWords(std::vector<base::string16>* words) const OVERRIDE;
+      Snippet::MatchPositions* match_positions) const override;
+  virtual bool HasMatchIn(const QueryWordVector& words) const override;
+  virtual void AppendWords(std::vector<base::string16>* words) const override;
 
  protected:
   int AppendChildrenToString(base::string16* query) const;
 
   QueryNodeStarVector children_;
 
  private:
   DISALLOW_COPY_AND_ASSIGN(QueryNodeList);
 };
 
@@ skipping 62 matching lines @@
   return num_words;
 }
 
 // A QueryNodePhrase is a phrase query ("quoted").
 class QueryNodePhrase : public QueryNodeList {
  public:
   QueryNodePhrase();
   virtual ~QueryNodePhrase();
 
   // QueryNodeList:
-  virtual int AppendToSQLiteQuery(base::string16* query) const OVERRIDE;
+  virtual int AppendToSQLiteQuery(base::string16* query) const override;
   virtual bool HasMatchIn(
       const QueryWordVector& words,
-      Snippet::MatchPositions* match_positions) const OVERRIDE;
-  virtual bool HasMatchIn(const QueryWordVector& words) const OVERRIDE;
+      Snippet::MatchPositions* match_positions) const override;
+  virtual bool HasMatchIn(const QueryWordVector& words) const override;
 
  private:
   bool MatchesAll(const QueryWordVector& words,
                   const QueryWord** first_word,
                   const QueryWord** last_word) const;
   DISALLOW_COPY_AND_ASSIGN(QueryNodePhrase);
 };
 
 QueryNodePhrase::QueryNodePhrase() {}
 
@@ skipping 197 matching lines @@
 void QueryParser::SortAndCoalesceMatchPositions(
     Snippet::MatchPositions* matches) {
   std::sort(matches->begin(), matches->end(), &CompareMatchPosition);
   // WARNING: we don't use iterator here as CoalesceMatchesFrom may remove
   // from matches.
   for (size_t i = 0; i < matches->size(); ++i)
     CoalesceMatchesFrom(i, matches);
 }
 
 }  // namespace query_parser