Add missing virtual keyword for methods with OVERRIDE

Source/core/dom/SelectorQuery.cpp

 /*
  * Copyright (C) 2011 Apple 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 31 matching lines @@
 public:
     virtual ~SimpleNodeList() { }
     virtual bool isEmpty() const = 0;
     virtual Node* next() = 0;
 };
 
 class SingleNodeList FINAL : public SimpleNodeList {
 public:
     explicit SingleNodeList(Node* rootNode) : m_currentNode(rootNode) { }
 
-    bool isEmpty() const OVERRIDE { return !m_currentNode; }
+    virtual bool isEmpty() const OVERRIDE { return !m_currentNode; }
 
-    Node* next() OVERRIDE
+    virtual Node* next() OVERRIDE
     {
         Node* current = m_currentNode;
         m_currentNode = 0;
         return current;
     }
 
 private:
     Node* m_currentNode;
 };
 
 class ClassRootNodeList FINAL : public SimpleNodeList {
 public:
     ClassRootNodeList(Node& rootNode, const AtomicString& className)
         : m_className(className)
         , m_rootNode(rootNode)
         , m_currentElement(nextInternal(ElementTraversal::firstWithin(m_rootNode))) { }
 
-    bool isEmpty() const OVERRIDE { return !m_currentElement; }
+    virtual bool isEmpty() const OVERRIDE { return !m_currentElement; }
 
-    Node* next() OVERRIDE
+    virtual Node* next() OVERRIDE
     {
         Node* current = m_currentElement;
         ASSERT(current);
         m_currentElement = nextInternal(ElementTraversal::nextSkippingChildren(*m_currentElement, &m_rootNode));
         return current;
     }
 
 private:
     Element* nextInternal(Element* element)
     {
         for (; element; element = ElementTraversal::next(*element, &m_rootNode)) {
             if (element->hasClass() && element->classNames().contains(m_className))
                 return element;
         }
         return 0;
     }
 
     const AtomicString& m_className;
     Node& m_rootNode;
     Element* m_currentElement;
 };
 
 class ClassElementList FINAL : public SimpleNodeList {
 public:
     ClassElementList(Node& rootNode, const AtomicString& className)
         : m_className(className)
         , m_rootNode(rootNode)
         , m_currentElement(nextInternal(ElementTraversal::firstWithin(rootNode))) { }
 
-    bool isEmpty() const OVERRIDE { return !m_currentElement; }
+    virtual bool isEmpty() const OVERRIDE { return !m_currentElement; }
 
-    Node* next() OVERRIDE
+    virtual Node* next() OVERRIDE
     {
         Node* current = m_currentElement;
         ASSERT(current);
         m_currentElement = nextInternal(ElementTraversal::next(*m_currentElement, &m_rootNode));
         return current;
     }
 
 private:
     Element* nextInternal(Element* element)
     {
@@ skipping 442 matching lines @@
     m_entries.add(selectors, selectorQuery.release());
     return rawSelectorQuery;
 }
 
 void SelectorQueryCache::invalidate()
 {
     m_entries.clear();
 }
 
 }