Remove UnusedParam.h

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 13 matching lines @@
  * along with this library; see the file COPYING.LIB.  If not, write to
  * the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
  * Boston, MA 02110-1301, USA.
  */
 
 #ifndef SiblingTraversalStrategies_h
 #define SiblingTraversalStrategies_h
 
 #include "core/dom/Element.h"
 #include "core/rendering/style/RenderStyle.h"
-#include "wtf/UnusedParam.h"
 
 namespace WebCore {
 
 struct DOMSiblingTraversalStrategy {
     bool isFirstChild(Element*) const;
     bool isLastChild(Element*) const;
     bool isFirstOfType(Element*, const QualifiedName&) const;
     bool isLastOfType(Element*, const QualifiedName&) const;
 
     int countElementsBefore(Element*) const;
@@ skipping 87 matching lines @@
     int countElementsOfTypeBefore(Element*, const QualifiedName&) const;
     int countElementsOfTypeAfter(Element*, const QualifiedName&) const;
 
 private:
     const Vector<Node*, 32>& m_siblings;
     int m_nth;
 };
 
 inline bool ShadowDOMSiblingTraversalStrategy::isFirstChild(Element* element) const
 {
-    UNUSED_PARAM(element);
-
     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
 {
-    UNUSED_PARAM(element);
-
     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
 {
-    UNUSED_PARAM(element);
-
     ASSERT(element == toElement(m_siblings[m_nth]));
 
     for (int i = m_nth - 1; i >= 0; --i) {
         if (m_siblings[i]->hasTagName(type))
             return false;
     }
 
     return true;
 }
 
 inline bool ShadowDOMSiblingTraversalStrategy::isLastOfType(Element* element, const QualifiedName& type) const
 {
-    UNUSED_PARAM(element);
-
     ASSERT(element == toElement(m_siblings[m_nth]));
 
     for (size_t i = m_nth + 1; i < m_siblings.size(); ++i) {
         if (m_siblings[i]->hasTagName(type))
             return false;
     }
 
     return true;
 }
 
 inline int ShadowDOMSiblingTraversalStrategy::countElementsBefore(Element* element) const
 {
-    UNUSED_PARAM(element);
-
     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
 {
-    UNUSED_PARAM(element);
-
     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
 {
-    UNUSED_PARAM(element);
-
     ASSERT(element == toElement(m_siblings[m_nth]));
 
     int count = 0;
     for (int i = m_nth - 1; i >= 0; --i) {
         if (m_siblings[i]->hasTagName(type))
             ++count;
     }
 
     return count;
 }
 
 inline int ShadowDOMSiblingTraversalStrategy::countElementsOfTypeAfter(Element* element, const QualifiedName& type) const
 {
-    UNUSED_PARAM(element);
-
     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]->hasTagName(type))
             return ++count;
     }
 
     return count;
 }
 
 }
 
 #endif