Switch to standard integer types in ui/.

ui/accessibility/ax_tree_update.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 UI_ACCESSIBILITY_AX_TREE_UPDATE_H_
 #define UI_ACCESSIBILITY_AX_TREE_UPDATE_H_
 
+#include <stddef.h>
+#include <stdint.h>
+
 #include <string>
 #include <vector>
 
 #include "base/strings/string_number_conversions.h"
 #include "ui/accessibility/ax_node_data.h"
 #include "ui/accessibility/ax_tree_data.h"
 
 namespace ui {
 
 // An AXTreeUpdate is a serialized representation of an atomic change
@@ skipping 70 matching lines @@
   if (node_id_to_clear != 0) {
     result += "AXTreeUpdate: clear node " +
         base::IntToString(node_id_to_clear) + "\n";
   }
 
   // The challenge here is that we want to indent the nodes being updated
   // so that parent/child relationships are clear, but we don't have access
   // to the rest of the tree for context, so we have to try to show the
   // relative indentation of child nodes in this update relative to their
   // parents.
-  base::hash_map<int32, int> id_to_indentation;
+  base::hash_map<int32_t, int> id_to_indentation;
   for (size_t i = 0; i < nodes.size(); ++i) {
     int indent = id_to_indentation[nodes[i].id];
     result += std::string(2 * indent, ' ');
     result += nodes[i].ToString() + "\n";
     for (size_t j = 0; j < nodes[i].child_ids.size(); ++j)
       id_to_indentation[nodes[i].child_ids[j]] = indent + 1;
   }
 
   return result;
 }
 
 }  // namespace ui
 
 #endif  // UI_ACCESSIBILITY_AX_TREE_UPDATE_H_