More style nits.

chrome/browser/history/query_parser.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 <algorithm>
 
 #include "chrome/browser/history/query_parser.h"
 
 #include "app/l10n_util.h"
 #include "base/i18n/word_iterator.h"
@@ skipping 48 matching lines @@
 } // namespace
 
 // Inheritance structure:
 // Queries are represented as trees of QueryNodes.
 // QueryNodes are either a collection of subnodes (a QueryNodeList)
 // or a single word (a QueryNodeWord).
 
 // A QueryNodeWord is a single word in the query.
 class QueryNodeWord : public QueryNode {
  public:
-  QueryNodeWord(const std::wstring& word) : word_(word), literal_(false) {}
+  explicit QueryNodeWord(const std::wstring& word)
+      : word_(word), literal_(false) {}
   virtual ~QueryNodeWord() {}
   virtual int AppendToSQLiteQuery(std::wstring* query) const;
   virtual bool IsWord() const { return true; }
 
   const std::wstring& word() const { return word_; }
   void set_literal(bool literal) { literal_ = literal; }
 
   virtual bool HasMatchIn(const std::vector<QueryWord>& words,
                           Snippet::MatchPositions* match_positions) const;
 
@@ skipping 295 matching lines @@
     if (iter.IsWord()) {
       std::wstring word = iter.GetWord();
       if (!word.empty()) {
         words->push_back(QueryWord());
         words->back().word = word;
         words->back().position = iter.prev();
       }
     }
   }
 }