Source/core/dom/NodeRenderingTraversal.h - Issue 622253004: Use a composed tree based traversal in computing quads in LinkHighlight::computeQuads().

Keyboard Shortcuts

	File
u :	up to issue
j / k :	jump to file after / before current file
J / K :	jump to next file with a comment after / before current file
	Side-by-side diff
i :	toggle intra-line diffs
e :	expand all comments
c :	collapse all comments
s :	toggle showing all comments
n / p :	next / previous diff chunk or comment
N / P :	next / previous comment
<Up> / <Down> :	next / previous line

	Issue
u :	up to list of issues
j / k :	jump to patch after / before current patch
o / <Enter> :	open current patch in side-by-side view
i :	open current patch in unified diff view

	Issue List
j / k :	jump to issue after / before current issue
o / <Enter> :	open current issue

Unified Diff: Source/core/dom/NodeRenderingTraversal.h

Issue 622253004: Use a composed tree based traversal in computing quads in LinkHighlight::computeQuads(). (Closed) Base URL: svn://svn.chromium.org/blink/trunk

Patch Set: no pixel test Created 6 years, 2 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 side-by-side diff with in-line comments

Download patch

« no previous file with comments | « LayoutTests/compositing/gestures/gesture-tapHighlight-inline-block-crash-expected.txt ('k') | Source/core/dom/NodeRenderingTraversal.cpp » ('j') | no next file with comments »
Expand Comments ('e') | Collapse Comments ('c') | Hide Comments ('s')

Index: Source/core/dom/NodeRenderingTraversal.h

diff --git a/Source/core/dom/NodeRenderingTraversal.h b/Source/core/dom/NodeRenderingTraversal.h

index d4dc7eb89382d085562329926ad9929d300b9da6..d6ef1aa1d42946bcfabdd7a45d3ce8aadb45118d 100644

--- a/Source/core/dom/NodeRenderingTraversal.h

+++ b/Source/core/dom/NodeRenderingTraversal.h

@@ -57,6 +57,7 @@ private:

ContainerNode* parent(const Node*, ParentDetails* = 0);

bool contains(const ContainerNode*, const Node*);

+Node* firstChild(const Node*);

Node* nextSibling(const Node*);

Node* previousSibling(const Node*);

Node* previous(const Node*, const Node* stayWithin);