Remove unused method - previousSkippingChildrenPostOrder - from NodeTraversal.h

Source/core/dom/NodeTraversal.h

 /*
  * Copyright (C) 1999 Lars Knoll (knoll@kde.org)
  *           (C) 1999 Antti Koivisto (koivisto@kde.org)
  *           (C) 2001 Dirk Mueller (mueller@kde.org)
  * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012 Apple Inc. All rights reserved.
  * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. (http://www.torchmobile.com/)
  *
  * This library is free software; you can redistribute it and/or
  * modify it under the terms of the GNU Library General Public
  * License as published by the Free Software Foundation; either
@@ skipping 37 matching lines @@
 
 // Does a reverse pre-order traversal to find the node that comes before the current one in document order
 Node* previous(const Node&, const Node* stayWithin = 0);
 
 // Like previous, but skips children and starts with the next sibling.
 Node* previousSkippingChildren(const Node&, const Node* stayWithin = 0);
 
 // Like next, but visits parents after their children.
 Node* nextPostOrder(const Node&, const Node* stayWithin = 0);
 
-// Like previous/previousSkippingChildren, but visits parents before their children.
+// Like previous, but visits parents before their children.
 Node* previousPostOrder(const Node&, const Node* stayWithin = 0);
-Node* previousSkippingChildrenPostOrder(const Node&, const Node* stayWithin = 0);
 
 // Pre-order traversal including the pseudo-elements.
 Node* previousIncludingPseudo(const Node&, const Node* stayWithin = 0);
 Node* nextIncludingPseudo(const Node&, const Node* stayWithin = 0);
 Node* nextIncludingPseudoSkippingChildren(const Node&, const Node* stayWithin = 0);
 
 Node* nextAncestorSibling(const Node&);
 Node* nextAncestorSibling(const Node&, const Node* stayWithin);
 
 template <class NodeType>
@@ skipping 42 matching lines @@
     return nextAncestorSibling(current, stayWithin);
 }
 inline Node* nextSkippingChildren(const Node& current, const Node* stayWithin) { return traverseNextSkippingChildrenTemplate(current, stayWithin); }
 inline Node* nextSkippingChildren(const ContainerNode& current, const Node* stayWithin) { return traverseNextSkippingChildrenTemplate(current, stayWithin); }
 
 }
 
 }
 
 #endif