replace OVERRIDE and FINAL with override and final in ui/

ui/gfx/geometry/r_tree_base.h

 // 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.
 
 // Provides an implementation the parts of the RTree data structure that don't
 // require knowledge of the generic key type. Don't use these objects directly,
 // rather specialize the RTree<> object in r_tree.h. This file defines the
 // internal objects of an RTree, namely Nodes (internal nodes of the tree) and
 // Records, which hold (key, rectangle) pairs.
 
@@ skipping 78 matching lines @@
 
     DISALLOW_COPY_AND_ASSIGN(NodeBase);
   };
 
   class GFX_EXPORT RecordBase : public NodeBase {
    public:
     explicit RecordBase(const Rect& rect);
     virtual ~RecordBase();
 
     virtual void AppendIntersectingRecords(const Rect& query_rect,
-                                           Records* records_out) const OVERRIDE;
-    virtual void AppendAllRecords(Records* records_out) const OVERRIDE;
-    virtual scoped_ptr<NodeBase> RemoveAndReturnLastChild() OVERRIDE;
-    virtual int Level() const OVERRIDE;
+                                           Records* records_out) const override;
+    virtual void AppendAllRecords(Records* records_out) const override;
+    virtual scoped_ptr<NodeBase> RemoveAndReturnLastChild() override;
+    virtual int Level() const override;
 
    private:
     friend class RTreeTest;
     friend class RTreeNodeTest;
 
     DISALLOW_COPY_AND_ASSIGN(RecordBase);
   };
 
   class GFX_EXPORT Node : public NodeBase {
    public:
     // Constructs an empty Node with |level_| of 0.
     Node();
     virtual ~Node();
 
     virtual void AppendIntersectingRecords(const Rect& query_rect,
-                                           Records* records_out) const OVERRIDE;
-    virtual scoped_ptr<NodeBase> RemoveAndReturnLastChild() OVERRIDE;
-    virtual int Level() const OVERRIDE;
-    virtual void AppendAllRecords(Records* matches_out) const OVERRIDE;
+                                           Records* records_out) const override;
+    virtual scoped_ptr<NodeBase> RemoveAndReturnLastChild() override;
+    virtual int Level() const override;
+    virtual void AppendAllRecords(Records* matches_out) const override;
 
     // Constructs a new Node that is the parent of this Node and already has
     // this Node as its sole child. Valid to call only on root Nodes, meaning
     // Nodes with |parent_| NULL. Note that ownership of this Node is
     // transferred to the parent returned by this function.
     scoped_ptr<Node> ConstructParent();
 
     // Removes |number_to_remove| children from this Node, and appends them to
     // the supplied list. Does not repair bounds upon completion. Nodes are
     // selected in the manner suggested in the Beckmann et al. paper, which
@@ skipping 80 matching lines @@
 
     // Given two vectors of Nodes sorted by vertical or horizontal bounds,
     // populates two vectors of Rectangles in which the ith element is the
     // union of all bounding rectangles [i, count()) in the associated sorted
     // array of Nodes.
     static void BuildHighBounds(const std::vector<NodeBase*>& vertical_sort,
                                 const std::vector<NodeBase*>& horizontal_sort,
                                 Rects* vertical_bounds,
                                 Rects* horizontal_bounds);
 
-    virtual void RecomputeLocalBounds() OVERRIDE;
+    virtual void RecomputeLocalBounds() override;
 
     // Returns the increase in overlap value, as defined in Beckmann et al. as
     // the sum of the areas of the intersection of all child rectangles
     // (excepting the candidate child) with the argument rectangle. Here the
     // |candidate_node| is one of our |children_|, and |expanded_rect| is the
     // already-computed union of the candidate's rect and |rect|.
     int OverlapIncreaseToAdd(const Rect& rect,
                              const NodeBase* candidate_node,
                              const Rect& expanded_rect) const;
 
@@ skipping 67 matching lines @@
   // The parameters used to define the shape of the RTree.
   const size_t min_children_;
   const size_t max_children_;
 
   DISALLOW_COPY_AND_ASSIGN(RTreeBase);
 };
 
 }  // namespace gfx
 
 #endif  // UI_GFX_GEOMETRY_R_TREE_BASE_H_