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

components/html_viewer/ax_provider_impl_unittest.cc

 // Copyright 2014 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 "components/html_viewer/ax_provider_impl.h"
 
+#include <stddef.h>
+#include <stdint.h>
+
 #include "base/bind.h"
 #include "base/message_loop/message_loop.h"
 #include "components/html_viewer/blink_platform_impl.h"
 #include "components/scheduler/renderer/renderer_scheduler.h"
 #include "gin/v8_initializer.h"
 #include "testing/gtest/include/gtest/gtest.h"
 #include "third_party/WebKit/public/platform/WebData.h"
 #include "third_party/WebKit/public/platform/WebURL.h"
 #include "third_party/WebKit/public/web/WebFrameClient.h"
 #include "third_party/WebKit/public/web/WebKit.h"
@@ skipping 97 matching lines @@
       WebURL(GURL("http://someplace.net")));
   base::MessageLoop::current()->Run();
 
   mojo::AxProviderPtr service_ptr;
   html_viewer::AxProviderImpl ax_provider_impl(view,
                                                mojo::GetProxy(&service_ptr));
   NodeCatcher catcher;
   ax_provider_impl.GetTree(
       base::Bind(&NodeCatcher::OnNodes, base::Unretained(&catcher)));
 
-  std::map<uint32, AxNode*> lookup;
+  std::map<uint32_t, AxNode*> lookup;
   for (size_t i = 0; i < catcher.nodes.size(); ++i) {
     auto& node = catcher.nodes[i];
     lookup[node->id] = node.get();
   }
 
   typedef decltype(lookup)::value_type MapEntry;
   auto is_link = [](MapEntry pair) { return !pair.second->link.is_null(); };
   auto is_text = [](MapEntry pair, const char* content) {
     return !pair.second->text.is_null() &&
            pair.second->text->content.To<std::string>() == content;
@@ skipping 22 matching lines @@
                   ->Equals(*bar));
   EXPECT_TRUE(CreateNode(baz->id, baz->parent_id, 0, baz->bounds, "", "baz")
                   ->Equals(*baz));
   EXPECT_TRUE(CreateNode(link->id,
                          link->parent_id,
                          link->next_sibling_id,
                          link->bounds,
                          "http://monkey.net/",
                          "")->Equals(*link));
 
-  auto is_descendant_of = [&lookup](uint32 id, uint32 ancestor) {
+  auto is_descendant_of = [&lookup](uint32_t id, uint32_t ancestor) {
     for (; (id = lookup[id]->parent_id) != 0;) {
       if (id == ancestor)
         return true;
     }
     return false;
   };
 
   EXPECT_TRUE(is_descendant_of(bar->id, link->id));
   for (auto pair : lookup) {
     AxNode* node = pair.second;
     if (node != root)
       EXPECT_TRUE(is_descendant_of(node->id, 1u));
     if (node != link && node != foo && node != bar && node != baz) {
       EXPECT_TRUE(CreateNode(node->id,
                              node->parent_id,
                              node->next_sibling_id,
                              node->bounds,
                              "",
                              ""));
     }
   }
 
   // TODO(aa): Test bounds.
   // TODO(aa): Test sibling ordering of foo/bar/baz.
 
   view->close();
 }