Switch to standard integer types in components/, part 4 of 4.

components/url_matcher/substring_set_matcher.h

 // Copyright 2013 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 COMPONENTS_URL_MATCHER_SUBSTRING_SET_MATCHER_H_
 #define COMPONENTS_URL_MATCHER_SUBSTRING_SET_MATCHER_H_
 
+#include <stdint.h>
+
 #include <limits>
 #include <map>
 #include <set>
 #include <string>
 #include <vector>
 
-#include "base/basictypes.h"
+#include "base/macros.h"
 #include "components/url_matcher/string_pattern.h"
 #include "components/url_matcher/url_matcher_export.h"
 
 namespace url_matcher {
 
 // Class that store a set of string patterns and can find for a string S,
 // which string patterns occur in S.
 class URL_MATCHER_EXPORT SubstringSetMatcher {
  public:
   SubstringSetMatcher();
@@ skipping 50 matching lines @@
   // text[i + k] at depth k + 1, we follow a failure edge. This edge
   // corresponds to the longest proper suffix of text[i, ..., i + k - 1] that
   // is a prefix of any registered pattern.
   //
   // If your brain thinks "Forget it, let's go shopping.", don't worry.
   // Take a nap and read an introductory text on the Aho Corasick algorithm.
   // It will make sense. Eventually.
   class AhoCorasickNode {
    public:
     // Key: label of the edge, value: node index in |tree_| of parent class.
-    typedef std::map<char, uint32> Edges;
+    typedef std::map<char, uint32_t> Edges;
     typedef std::set<StringPattern::ID> Matches;
 
-    static const uint32 kNoSuchEdge;  // Represents an invalid node index.
+    static const uint32_t kNoSuchEdge;  // Represents an invalid node index.
 
     AhoCorasickNode();
     ~AhoCorasickNode();
     AhoCorasickNode(const AhoCorasickNode& other);
     AhoCorasickNode& operator=(const AhoCorasickNode& other);
 
-    uint32 GetEdge(char c) const;
-    void SetEdge(char c, uint32 node);
+    uint32_t GetEdge(char c) const;
+    void SetEdge(char c, uint32_t node);
     const Edges& edges() const { return edges_; }
 
-    uint32 failure() const { return failure_; }
-    void set_failure(uint32 failure) { failure_ = failure; }
+    uint32_t failure() const { return failure_; }
+    void set_failure(uint32_t failure) { failure_ = failure; }
 
     void AddMatch(StringPattern::ID id);
     void AddMatches(const Matches& matches);
     const Matches& matches() const { return matches_; }
 
    private:
     // Outgoing edges of current node.
     Edges edges_;
 
     // Node index that failure edge leads to.
-    uint32 failure_;
+    uint32_t failure_;
 
     // Identifiers of matches.
     Matches matches_;
   };
 
   typedef std::map<StringPattern::ID, const StringPattern*> SubstringPatternMap;
   typedef std::vector<const StringPattern*> SubstringPatternVector;
 
   // |sorted_patterns| is a copy of |patterns_| sorted by the pattern string.
   void RebuildAhoCorasickTree(const SubstringPatternVector& sorted_patterns);
@@ skipping 10 matching lines @@
 
   // The nodes of a Aho-Corasick tree.
   std::vector<AhoCorasickNode> tree_;
 
   DISALLOW_COPY_AND_ASSIGN(SubstringSetMatcher);
 };
 
 }  // namespace url_matcher
 
 #endif  // COMPONENTS_URL_MATCHER_SUBSTRING_SET_MATCHER_H_