Remove Purify and Quantify

chrome/browser/bookmarks/recently_used_folders_combo_model_unittest.cc

 // 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.
 
 #include "chrome/browser/bookmarks/recently_used_folders_combo_model.h"
 
 #include "base/memory/scoped_ptr.h"
 #include "base/utf_string_conversions.h"
 #include "chrome/test/base/testing_profile.h"
 #include "chrome/test/testing_browser_process_test.h"
@@ skipping 23 matching lines @@
       file_thread_(BrowserThread::FILE, &message_loop_) {
 }
 
 void RecentlyUsedFoldersComboModelTest::SetUp() {
   profile_.reset(new TestingProfile());
   profile_->CreateBookmarkModel(true);
   profile_->BlockUntilBookmarkModelLoaded();
 }
 
 void RecentlyUsedFoldersComboModelTest::TearDown() {
-  // Flush the message loop to make Purify happy.
+  // Flush the message loop to make application verifiers happy.
   message_loop_.RunAllPending();
 }
 
 // Verifies there are no duplicate nodes in the model.
 TEST_F(RecentlyUsedFoldersComboModelTest, NoDups) {
   BookmarkModel* bookmark_model = profile_->GetBookmarkModel();
   const BookmarkNode* new_node = bookmark_model->AddURL(
       bookmark_model->bookmark_bar_node(), 0, ASCIIToUTF16("a"),
       GURL("http://a"));
   RecentlyUsedFoldersComboModel model(bookmark_model, new_node);
   std::set<const BookmarkNode*> nodes;
   for (int i = 0; i < model.GetItemCount(); ++i) {
     const BookmarkNode* node = model.GetNodeAt(i);
     EXPECT_EQ(0u, nodes.count(node));
     nodes.insert(node);
   }
 }