Fix Acid3 Test 48: LINKTEST, Chromium side....

chrome/common/visitedlink_common.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_COMMON_VISITEDLINK_COMMON_H__
 #define CHROME_COMMON_VISITEDLINK_COMMON_H__
 
 #include <string>
+#include <vector>
 
 #include "base/basictypes.h"
 #include "base/logging.h"
 #include "googleurl/src/gurl.h"
 
 // number of bytes in the salt
 #define LINK_SALT_LENGTH 8
 
 // A multiprocess-safe database of the visited links for the browser. There
 // should be exactly one process that has write access (implemented by
@@ skipping 18 matching lines @@
 // URL. This URL is hashed and we see if it is in the URL hashtable. If it is,
 // we consider it visited. Otherwise, it is unvisited. Note that it is possible
 // to get collisions, which is the penalty for not storing all URL strings in
 // memory (which could get to be more than we want to have in memory). We use
 // a salt value for the links on one computer so that an attacker can not
 // manually create a link that causes a collision.
 class VisitedLinkCommon {
  public:
   // A number that identifies the URL.
   typedef uint64 Fingerprint;
+  typedef std::vector<Fingerprint> Fingerprints;
 
   // A hash value of a fingerprint
   typedef int32 Hash;
 
   // A fingerprint or hash value that does not exist
   static const Fingerprint null_fingerprint_;
   static const Hash null_hash_;
 
   VisitedLinkCommon();
   virtual ~VisitedLinkCommon();
@@ skipping 69 matching lines @@
   int32 table_length_;
 
   // salt used for each URL when computing the fingerprint
   uint8 salt_[LINK_SALT_LENGTH];
 
  private:
   DISALLOW_EVIL_CONSTRUCTORS(VisitedLinkCommon);
 };
 
 #endif // WIN_COMMON_VISITEDLINK_COMMON_H__