Ensure that VisitedLink listener Add event only fires when new fingerprint is...

chrome/browser/visitedlink_master.h

 // 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.
 
 #ifndef CHROME_BROWSER_VISITEDLINK_MASTER_H__
 #define CHROME_BROWSER_VISITEDLINK_MASTER_H__
 
 #if defined(OS_WIN)
 #include <windows.h>
 #endif
@@ skipping 202 matching lines @@
   // wrap around at 0 and this function will handle it.
   void WriteHashRangeToFile(Hash first_hash, Hash last_hash);
 
   // Synchronous read from the file. Assumes there are no pending asynchronous
   // I/O functions. Returns true if the entire buffer was successfully filled.
   bool ReadFromFile(FILE* hfile, off_t offset, void* data, size_t data_size);
 
   // General table handling
   // ----------------------
 
-  // Called to add a fingerprint to the table. Returns the index of the
-  // inserted fingerprint or null_hash_ if there was a duplicate and this item
-  // was skippped.
-  Hash AddFingerprint(Fingerprint fingerprint);
+  // Called to add a fingerprint to the table. If |send_notifications| is true
+  // and the item is added successfully, Listener::Add will be invoked.
+  // Returns the index of the inserted fingerprint or null_hash_ if there was a
+  // duplicate and this item was skippped.
+  Hash AddFingerprint(Fingerprint fingerprint, bool send_notifications);
 
   // Deletes all fingerprints from the given vector from the current hash table
   // and syncs it to disk if there are changes. This does not update the
   // deleted_since_rebuild_ list, the caller must update this itself if there
   // is an update pending.
   void DeleteFingerprintsFromCurrentTable(
       const std::set<Fingerprint>& fingerprints);
 
   // Removes the indicated fingerprint from the table. If the update_file flag
   // is set, the changes will also be written to disk. Returns true if the
@@ skipping 162 matching lines @@
   int32 used_count = 0;
   for (int32 i = 0; i < table_length_; i++) {
     if (hash_table_[i])
       used_count++;
   }
   DCHECK_EQ(used_count, used_items_);
 }
 #endif
 
 #endif // CHROME_BROWSER_VISITEDLINK_MASTER_H__