Source/core/dom/NodeTraversal.h - Issue 126123004: Remove no longer used methods nextAncestorSibling() from NodeTraversal.h

Side by Side Diff: Source/core/dom/NodeTraversal.h

Issue 126123004: Remove no longer used methods nextAncestorSibling() from NodeTraversal.h (Closed) Base URL: https://chromium.googlesource.com/chromium/blink.git@master

Patch Set: Created 6 years, 11 months ago

Use n/p to move between diff chunks; N/P to move between comments. Draft comments are only viewable by you.

Jump to:

View unified diff | Download patch

« no previous file with comments | « no previous file | Source/core/dom/NodeTraversal.cpp » ('j') | no next file with comments »

OLD	NEW
1 /*	1 /*

2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org)	2 * Copyright (C) 1999 Lars Knoll (knoll@kde.org)

3 * (C) 1999 Antti Koivisto (koivisto@kde.org)	3 * (C) 1999 Antti Koivisto (koivisto@kde.org)

4 * (C) 2001 Dirk Mueller (mueller@kde.org)	4 * (C) 2001 Dirk Mueller (mueller@kde.org)

5 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012 Apple Inc. All rights reserved.	5 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009, 2010, 2011, 2012 Apple Inc. All rights reserved.

6 * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. (http://www.t orchmobile.com/)	6 * Copyright (C) 2008, 2009 Torch Mobile Inc. All rights reserved. (http://www.t orchmobile.com/)

7 *	7 *

8 * This library is free software; you can redistribute it and/or	8 * This library is free software; you can redistribute it and/or

9 * modify it under the terms of the GNU Library General Public	9 * modify it under the terms of the GNU Library General Public

10 * License as published by the Free Software Foundation; either	10 * License as published by the Free Software Foundation; either

(...skipping 47 matching lines...) Expand 10 before \| Expand all \| Expand 10 after Loading...
58	58

59 // Like previous/previousSkippingChildren, but visits parents before their child ren.	59 // Like previous/previousSkippingChildren, but visits parents before their child ren.

60 Node* previousPostOrder(const Node&, const Node* stayWithin = 0);	60 Node* previousPostOrder(const Node&, const Node* stayWithin = 0);

61 Node* previousSkippingChildrenPostOrder(const Node&, const Node* stayWithin = 0) ;	61 Node* previousSkippingChildrenPostOrder(const Node&, const Node* stayWithin = 0) ;

62	62

63 // Pre-order traversal including the pseudo-elements.	63 // Pre-order traversal including the pseudo-elements.

64 Node* previousIncludingPseudo(const Node&, const Node* stayWithin = 0);	64 Node* previousIncludingPseudo(const Node&, const Node* stayWithin = 0);

65 Node* nextIncludingPseudo(const Node&, const Node* stayWithin = 0);	65 Node* nextIncludingPseudo(const Node&, const Node* stayWithin = 0);

66 Node* nextIncludingPseudoSkippingChildren(const Node&, const Node* stayWithin = 0);	66 Node* nextIncludingPseudoSkippingChildren(const Node&, const Node* stayWithin = 0);

67	67

68 Node* nextAncestorSibling(const Node&);

69 Node* nextAncestorSibling(const Node&, const Node* stayWithin);

70

71 inline Node* next(const Node& current) { return traverseNext(current); }	68 inline Node* next(const Node& current) { return traverseNext(current); }

72 inline Node* next(const ContainerNode& current) { return traverseNext<Node>(curr ent); }	69 inline Node* next(const ContainerNode& current) { return traverseNext<Node>(curr ent); }

73	70

74 inline Node* next(const Node& current, const Node* stayWithin) { return traverse Next(current, stayWithin); }	71 inline Node* next(const Node& current, const Node* stayWithin) { return traverse Next(current, stayWithin); }

75 inline Node* next(const ContainerNode& current, const Node* stayWithin) { return traverseNext<Node>(current, stayWithin); }	72 inline Node* next(const ContainerNode& current, const Node* stayWithin) { return traverseNext<Node>(current, stayWithin); }

76	73

77 inline Node* nextSkippingChildren(const Node& current) { return traverseNextSkip pingChildren(current); }	74 inline Node* nextSkippingChildren(const Node& current) { return traverseNextSkip pingChildren(current); }

78 inline Node* nextSkippingChildren(const ContainerNode& current) { return travers eNextSkippingChildren<Node>(current); }	75 inline Node* nextSkippingChildren(const ContainerNode& current) { return travers eNextSkippingChildren<Node>(current); }

79	76

80 inline Node* nextSkippingChildren(const Node& current, const Node* stayWithin) { return traverseNextSkippingChildren(current, stayWithin); }	77 inline Node* nextSkippingChildren(const Node& current, const Node* stayWithin) { return traverseNextSkippingChildren(current, stayWithin); }

81 inline Node* nextSkippingChildren(const ContainerNode& current, const Node* stay Within) { return traverseNextSkippingChildren<Node>(current, stayWithin); }	78 inline Node* nextSkippingChildren(const ContainerNode& current, const Node* stay Within) { return traverseNextSkippingChildren<Node>(current, stayWithin); }

82	79

83 }	80 }

84	81

85 }	82 }

86	83

87 #endif	84 #endif

OLD	NEW