Source/core/dom/NodeIterator.h - Issue 256013002: Make NodeIterator.detach() a no-op

Side by Side Diff

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

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

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

Issue 256013002: Make NodeIterator.detach() a no-op (Closed) Base URL: svn://svn.chromium.org/blink/trunk

Patch Set: Created 6 years, 7 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 | Annotate | Revision Log

« no previous file with comments | « LayoutTests/fast/dom/node-iterator-with-doctype-root-expected.txt ('k') | Source/core/dom/NodeIterator.cpp » ('j') | Source/core/dom/NodeIterator.cpp » ('J')

OLD	NEW
1 /*	1 /*

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

3 * Copyright (C) 2000 Frederik Holljen (frederik.holljen@hig.no)	3 * Copyright (C) 2000 Frederik Holljen (frederik.holljen@hig.no)

4 * Copyright (C) 2001 Peter Kelly (pmk@post.com)	4 * Copyright (C) 2001 Peter Kelly (pmk@post.com)

5 * Copyright (C) 2006 Samuel Weinig (sam.weinig@gmail.com)	5 * Copyright (C) 2006 Samuel Weinig (sam.weinig@gmail.com)

6 * Copyright (C) 2004, 2008 Apple Inc. All rights reserved.	6 * Copyright (C) 2004, 2008 Apple Inc. All rights reserved.

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 52 matching lines...) Expand 10 before \| Expand all \| Expand 10 after Loading...
63 NodePointer(PassRefPtr<Node>, bool);	63 NodePointer(PassRefPtr<Node>, bool);

64 void clear();	64 void clear();

65 bool moveToNext(Node* root);	65 bool moveToNext(Node* root);

66 bool moveToPrevious(Node* root);	66 bool moveToPrevious(Node* root);

67 };	67 };

68	68

69 void updateForNodeRemoval(Node& nodeToBeRemoved, NodePointer&) const;	69 void updateForNodeRemoval(Node& nodeToBeRemoved, NodePointer&) const;

70	70

71 NodePointer m_referenceNode;	71 NodePointer m_referenceNode;

72 NodePointer m_candidateNode;	72 NodePointer m_candidateNode;

73 bool m_detached;

74 };	73 };

75	74

76 } // namespace WebCore	75 } // namespace WebCore

77	76

78 #endif // NodeIterator_h	77 #endif // NodeIterator_h

OLD	NEW