Replace gfx::Rect with gfx::RectF in ui::AXNodeData

content/renderer/accessibility/render_accessibility_impl.cc

 // Copyright (c) 2012 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 "content/renderer/accessibility/render_accessibility_impl.h"
 
 #include <stddef.h>
 #include <stdint.h>
 
 #include <queue>
@@ skipping 344 matching lines @@
 
 void RenderAccessibilityImpl::SendLocationChanges() {
   std::vector<AccessibilityHostMsg_LocationChangeParams> messages;
 
   // Update layout on the root of the tree.
   WebAXObject root = tree_source_.GetRoot();
   if (!root.updateLayoutAndCheckValidity())
     return;
 
   // Do a breadth-first explore of the whole blink AX tree.
-  base::hash_map<int, gfx::Rect> new_locations;
+  base::hash_map<int, gfx::RectF> new_locations;
   std::queue<WebAXObject> objs_to_explore;
   objs_to_explore.push(root);
   while (objs_to_explore.size()) {
     WebAXObject obj = objs_to_explore.front();
     objs_to_explore.pop();
 
     // See if we had a previous location. If not, this whole subtree must
     // be new, so don't continue to explore this branch.
     int id = obj.axID();
-    base::hash_map<int, gfx::Rect>::iterator iter = locations_.find(id);
+    base::hash_map<int, gfx::RectF>::iterator iter = locations_.find(id);
     if (iter == locations_.end())
       continue;
 
     // If the location has changed, append it to the IPC message.
-    gfx::Rect new_location = obj.boundingBoxRect();
+    gfx::RectF new_location = gfx::RectF(obj.boundingBoxRect());
     if (iter != locations_.end() && iter->second != new_location) {
       AccessibilityHostMsg_LocationChangeParams message;
       message.id = id;
       message.new_location = new_location;
       messages.push_back(message);
     }
 
     // Save the new location.
     new_locations[id] = new_location;
 
@@ skipping 281 matching lines @@
       size_t new_count = pdf_update.nodes.size();
       update->nodes.resize(old_count + new_count);
       for (size_t i = 0; i < new_count; ++i)
         update->nodes[old_count + i] = pdf_update.nodes[i];
       break;
     }
   }
 }
 
 }  // namespace content