Part 2 of repairing regressions to my old clang check plugins so Nico can

chrome/browser/bookmarks/bookmark_utils.h

-// Copyright (c) 2010 The Chromium Authors. All rights reserved.
+// Copyright (c) 2011 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.
 
 #ifndef CHROME_BROWSER_BOOKMARKS_BOOKMARK_UTILS_H_
 #define CHROME_BROWSER_BOOKMARKS_BOOKMARK_UTILS_H_
 #pragma once
 
 #include <string>
 #include <vector>
 
@@ skipping 112 matching lines @@
 
 // Returns the most recently added bookmarks. This does not return groups,
 // only nodes of type url.
 void GetMostRecentlyAddedEntries(BookmarkModel* model,
                                  size_t count,
                                  std::vector<const BookmarkNode*>* nodes);
 
 // Used by GetBookmarksMatchingText to return a matching node and the location
 // of the match in the title.
 struct TitleMatch {
+  TitleMatch();
+  ~TitleMatch();
+
   const BookmarkNode* node;
 
   // Location of the matching words in the title of the node.
   Snippet::MatchPositions match_positions;
 };
 
 // Returns true if |n1| was added more recently than |n2|.
 bool MoreRecentlyAdded(const BookmarkNode* n1, const BookmarkNode* n2);
 
 // Returns up to |max_count| bookmarks from |model| whose url or title contains
@@ skipping 66 matching lines @@
 // Number of bookmarks we'll open before prompting the user to see if they
 // really want to open all.
 //
 // NOTE: treat this as a const. It is not const as various tests change the
 // value.
 extern int num_urls_before_prompting;
 
 }  // namespace bookmark_utils
 
 #endif  // CHROME_BROWSER_BOOKMARKS_BOOKMARK_UTILS_H_