Update platform classes to use OVERRIDE / FINAL when needed

Source/platform/PODIntervalTree.h

 /*
  * Copyright (C) 2010 Google Inc. All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions
  * are met:
  *
  * 1.  Redistributions of source code must retain the above copyright
  *     notice, this list of conditions and the following disclaimer.
  * 2.  Redistributions in binary form must reproduce the above copyright
@@ skipping 52 matching lines @@
 private:
     Vector<IntervalType>& m_result;
     T m_lowValue;
     T m_highValue;
 };
 
 // An interval tree, which is a form of augmented red-black tree. It
 // supports efficient (O(lg n)) insertion, removal and querying of
 // intervals in the tree.
 template<class T, class UserData = void*>
-class PODIntervalTree : public PODRedBlackTree<PODInterval<T, UserData> > {
+class PODIntervalTree FINAL : public PODRedBlackTree<PODInterval<T, UserData> > {
     WTF_MAKE_NONCOPYABLE(PODIntervalTree);
 public:
     // Typedef to reduce typing when declaring intervals to be stored in
     // this tree.
     typedef PODInterval<T, UserData> IntervalType;
     typedef PODIntervalSearchAdapter<T, UserData> IntervalSearchAdapterType;
 
     PODIntervalTree(UninitializedTreeEnum unitializedTree)
         : PODRedBlackTree<IntervalType>(unitializedTree)
     {
@@ skipping 40 matching lines @@
         // inheritance rules in template classes.
         searchForOverlapsFrom<AdapterType>(this->root(), adapter);
     }
 
     // Helper to create interval objects.
     static IntervalType createInterval(const T& low, const T& high, const UserData data = 0)
     {
         return IntervalType(low, high, data);
     }
 
-    virtual bool checkInvariants() const
+    virtual bool checkInvariants() const OVERRIDE
     {
         if (!PODRedBlackTree<IntervalType>::checkInvariants())
             return false;
         if (!this->root())
             return true;
         return checkInvariantsFromNode(this->root(), 0);
     }
 
 private:
     typedef typename PODRedBlackTree<IntervalType>::Node IntervalNode;
@@ skipping 29 matching lines @@
         // Check for overlap with current node.
         adapter.collectIfNeeded(node->data());
 
         // See whether we need to traverse the right subtree.
         // This is phrased this way to avoid the need for operator <=
         // on type T.
         if (!(adapter.highValue() < node->data().low()))
             searchForOverlapsFrom<AdapterType>(node->right(), adapter);
     }
 
-    virtual bool updateNode(IntervalNode* node)
+    virtual bool updateNode(IntervalNode* node) OVERRIDE
     {
         // Would use const T&, but need to reassign this reference in this
         // function.
         const T* curMax = &node->data().high();
         IntervalNode* left = node->left();
         if (left) {
             if (*curMax < left->data().maxHigh())
                 curMax = &left->data().maxHigh();
         }
         IntervalNode* right = node->right();
@@ skipping 63 matching lines @@
     static String string(const PODInterval<T, UserData>& interval)
     {
         return interval.toString();
     }
 };
 #endif
 
 } // namespace WebCore
 
 #endif // PODIntervalTree_h