Remove support for pseudo classes in <content select>.

Source/core/css/SiblingTraversalStrategies.h

 /*
  * Copyright (C) 1999 Lars Knoll (knoll@kde.org)
  *           (C) 2004-2005 Allan Sandfeld Jensen (kde@carewolf.com)
  * Copyright (C) 2006, 2007 Nicholas Shanks (webkit@nickshanks.com)
  * Copyright (C) 2005, 2006, 2007, 2008, 2009, 2010, 2011 Apple Inc. All rights reserved.
  * Copyright (C) 2007 Alexey Proskuryakov <ap@webkit.org>
  * Copyright (C) 2007, 2008 Eric Seidel <eric@webkit.org>
  * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. (http://www.torchmobile.com/)
  * Copyright (c) 2011, Code Aurora Forum. All rights reserved.
  * Copyright (C) Research In Motion Limited 2011. All rights reserved.
@@ skipping 15 matching lines @@
  * Boston, MA 02110-1301, USA.
  */
 
 #ifndef SiblingTraversalStrategies_h
 #define SiblingTraversalStrategies_h
 
 #include "core/dom/Document.h"
 #include "core/dom/Element.h"
 #include "core/dom/ElementTraversal.h"
 #include "core/dom/NthIndexCache.h"
-#include "core/style/ComputedStyle.h"
 
 namespace blink {
 
+// TODO(esprehn): Merge this into ElementTraversal.
 class DOMSiblingTraversalStrategy {
 public:
-    bool isFirstChild(Element&) const;
-    bool isLastChild(Element&) const;
-    bool isFirstOfType(Element&, const QualifiedName&) const;
-    bool isLastOfType(Element&, const QualifiedName&) const;
+    static bool isFirstChild(Element&);
+    static bool isLastChild(Element&);
+    static bool isFirstOfType(Element&, const QualifiedName&);
+    static bool isLastOfType(Element&, const QualifiedName&);
 
-    int countElementsBefore(Element&) const;
-    int countElementsAfter(Element&) const;
-    int countElementsOfTypeBefore(Element&, const QualifiedName&) const;
-    int countElementsOfTypeAfter(Element&, const QualifiedName&) const;
+    static int countElementsBefore(Element&);
+    static int countElementsAfter(Element&);
+    static int countElementsOfTypeBefore(Element&, const QualifiedName&);
+    static int countElementsOfTypeAfter(Element&, const QualifiedName&);
 
 private:
     class HasTagName {
     public:
         explicit HasTagName(const QualifiedName& tagName) : m_tagName(tagName) { }
         bool operator() (const Element& element) const { return element.hasTagName(m_tagName); }
     private:
         const QualifiedName& m_tagName;
     };
 };
 
-inline bool DOMSiblingTraversalStrategy::isFirstChild(Element& element) const
+inline bool DOMSiblingTraversalStrategy::isFirstChild(Element& element)
 {
     return !ElementTraversal::previousSibling(element);
 }
 
-inline bool DOMSiblingTraversalStrategy::isLastChild(Element& element) const
+inline bool DOMSiblingTraversalStrategy::isLastChild(Element& element)
 {
     return !ElementTraversal::nextSibling(element);
 }
 
-inline bool DOMSiblingTraversalStrategy::isFirstOfType(Element& element, const QualifiedName& type) const
+inline bool DOMSiblingTraversalStrategy::isFirstOfType(Element& element, const QualifiedName& type)
 {
     return !ElementTraversal::previousSibling(element, HasTagName(type));
 }
 
-inline bool DOMSiblingTraversalStrategy::isLastOfType(Element& element, const QualifiedName& type) const
+inline bool DOMSiblingTraversalStrategy::isLastOfType(Element& element, const QualifiedName& type)
 {
     return !ElementTraversal::nextSibling(element, HasTagName(type));
 }
 
-inline int DOMSiblingTraversalStrategy::countElementsBefore(Element& element) const
+inline int DOMSiblingTraversalStrategy::countElementsBefore(Element& element)
 {
     if (NthIndexCache* nthIndexCache = element.document().nthIndexCache())
         return nthIndexCache->nthChildIndex(element) - 1;
 
     int count = 0;
     for (const Element* sibling = ElementTraversal::previousSibling(element); sibling; sibling = ElementTraversal::previousSibling(*sibling))
         count++;
 
     return count;
 }
 
-inline int DOMSiblingTraversalStrategy::countElementsOfTypeBefore(Element& element, const QualifiedName& type) const
+inline int DOMSiblingTraversalStrategy::countElementsOfTypeBefore(Element& element, const QualifiedName& type)
 {
     int count = 0;
     for (const Element* sibling = ElementTraversal::previousSibling(element, HasTagName(type)); sibling; sibling = ElementTraversal::previousSibling(*sibling, HasTagName(type)))
         ++count;
     return count;
 }
 
-inline int DOMSiblingTraversalStrategy::countElementsAfter(Element& element) const
+inline int DOMSiblingTraversalStrategy::countElementsAfter(Element& element)
 {
     if (NthIndexCache* nthIndexCache = element.document().nthIndexCache())
         return nthIndexCache->nthLastChildIndex(element) - 1;
 
     int count = 0;
     for (const Element* sibling = ElementTraversal::nextSibling(element); sibling; sibling = ElementTraversal::nextSibling(*sibling))
         ++count;
     return count;
 }
 
-inline int DOMSiblingTraversalStrategy::countElementsOfTypeAfter(Element& element, const QualifiedName& type) const
+inline int DOMSiblingTraversalStrategy::countElementsOfTypeAfter(Element& element, const QualifiedName& type)
 {
     int count = 0;
     for (const Element* sibling = ElementTraversal::nextSibling(element, HasTagName(type)); sibling; sibling = ElementTraversal::nextSibling(*sibling, HasTagName(type)))
         ++count;
     return count;
 }
 
-class ShadowDOMSiblingTraversalStrategy final {
-    STACK_ALLOCATED();
-public:
-    ShadowDOMSiblingTraversalStrategy(const WillBeHeapVector<RawPtrWillBeMember<Node>, 32>& siblings, int nth)
-        : m_siblings(siblings)
-        , m_nth(nth)
-    {
-    }
-
-    bool isFirstChild(Element&) const;
-    bool isLastChild(Element&) const;
-    bool isFirstOfType(Element&, const QualifiedName&) const;
-    bool isLastOfType(Element&, const QualifiedName&) const;
-
-    int countElementsBefore(Element&) const;
-    int countElementsAfter(Element&) const;
-    int countElementsOfTypeBefore(Element&, const QualifiedName&) const;
-    int countElementsOfTypeAfter(Element&, const QualifiedName&) const;
-
-private:
-    const WillBeHeapVector<RawPtrWillBeMember<Node>, 32>& m_siblings;
-    int m_nth;
-};
-
-inline bool ShadowDOMSiblingTraversalStrategy::isFirstChild(Element& element) const
-{
-    ASSERT(element == toElement(m_siblings[m_nth]));
-
-    for (int i = m_nth - 1; i >= 0; --i) {
-        if (m_siblings[i]->isElementNode())
-            return false;
-    }
-
-    return true;
-}
-
-inline bool ShadowDOMSiblingTraversalStrategy::isLastChild(Element& element) const
-{
-    ASSERT(element == toElement(m_siblings[m_nth]));
-
-    for (size_t i = m_nth + 1; i < m_siblings.size(); ++i) {
-        if (m_siblings[i]->isElementNode())
-            return false;
-    }
-
-    return true;
-}
-
-inline bool ShadowDOMSiblingTraversalStrategy::isFirstOfType(Element& element, const QualifiedName& type) const
-{
-    ASSERT(element == toElement(m_siblings[m_nth]));
-
-    for (int i = m_nth - 1; i >= 0; --i) {
-        if (m_siblings[i]->isElementNode() && toElement(m_siblings[i])->hasTagName(type))
-            return false;
-    }
-
-    return true;
-}
-
-inline bool ShadowDOMSiblingTraversalStrategy::isLastOfType(Element& element, const QualifiedName& type) const
-{
-    ASSERT(element == toElement(m_siblings[m_nth]));
-
-    for (size_t i = m_nth + 1; i < m_siblings.size(); ++i) {
-        if (m_siblings[i]->isElementNode() && toElement(m_siblings[i])->hasTagName(type))
-            return false;
-    }
-
-    return true;
-}
-
-inline int ShadowDOMSiblingTraversalStrategy::countElementsBefore(Element& element) const
-{
-    ASSERT(element == toElement(m_siblings[m_nth]));
-
-    int count = 0;
-    for (int i = m_nth - 1; i >= 0; --i) {
-        if (m_siblings[i]->isElementNode())
-            ++count;
-    }
-
-    return count;
-}
-
-inline int ShadowDOMSiblingTraversalStrategy::countElementsAfter(Element& element) const
-{
-    ASSERT(element == toElement(m_siblings[m_nth]));
-
-    int count = 0;
-    for (size_t i = m_nth + 1; i < m_siblings.size(); ++i) {
-        if (m_siblings[i]->isElementNode())
-            return ++count;
-    }
-
-    return count;
-}
-
-inline int ShadowDOMSiblingTraversalStrategy::countElementsOfTypeBefore(Element& element, const QualifiedName& type) const
-{
-    ASSERT(element == toElement(m_siblings[m_nth]));
-
-    int count = 0;
-    for (int i = m_nth - 1; i >= 0; --i) {
-        if (m_siblings[i]->isElementNode() && toElement(m_siblings[i])->hasTagName(type))
-            ++count;
-    }
-
-    return count;
-}
-
-inline int ShadowDOMSiblingTraversalStrategy::countElementsOfTypeAfter(Element& element, const QualifiedName& type) const
-{
-    ASSERT(element == toElement(m_siblings[m_nth]));
-
-    int count = 0;
-    for (size_t i = m_nth + 1; i < m_siblings.size(); ++i) {
-        if (m_siblings[i]->isElementNode() && toElement(m_siblings[i])->hasTagName(type))
-            return ++count;
-    }
-
-    return count;
-}
-
 }
 
 #endif