third_party/WebKit/Source/core/dom/ContainerNode.h - Issue 2306323002: Change the timing of event dispatching and <script> execution in Node::appendChild, insertBefore,...

Side by Side Diff: third_party/WebKit/Source/core/dom/ContainerNode.h

Issue 2306323002: Change the timing of event dispatching and <script> execution in Node::appendChild, insertBefore,... (Closed)

Patch Set: Created 4 years, 3 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 | « third_party/WebKit/LayoutTests/fast/dom/mutation-event-for-fragment-insertion.html ('k') | third_party/WebKit/Source/core/dom/ContainerNode.cpp » ('j') | third_party/WebKit/Source/core/dom/ContainerNode.cpp » ('J')
Toggle Intra-line Diffs ('i') | Expand Comments ('e') | Collapse Comments ('c') | Hide Comments ('s')

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, 2009, 2010, 2011, 2013 Apple Inc. All r ights reserved.	5 * Copyright (C) 2004, 2005, 2006, 2007, 2009, 2010, 2011, 2013 Apple Inc. All r ights reserved.

6 *	6 *

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

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

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

10 * version 2 of the License, or (at your option) any later version.	10 * version 2 of the License, or (at your option) any later version.

(...skipping 231 matching lines...) Expand 10 before \| Expand all \| Expand 10 after Loading...
242	242

243 NodeListsNodeData& ensureNodeLists();	243 NodeListsNodeData& ensureNodeLists();

244 void removeBetween(Node* previousChild, Node* nextChild, Node& oldChild);	244 void removeBetween(Node* previousChild, Node* nextChild, Node& oldChild);

245 template <typename Functor> void insertNodeVector(const NodeVector&, Node* n ext, const Functor&);	245 template <typename Functor> void insertNodeVector(const NodeVector&, Node* n ext, const Functor&);

246 class AdoptAndInsertBefore;	246 class AdoptAndInsertBefore;

247 class AdoptAndAppendChild;	247 class AdoptAndAppendChild;

248 friend class AdoptAndInsertBefore;	248 friend class AdoptAndInsertBefore;

249 friend class AdoptAndAppendChild;	249 friend class AdoptAndAppendChild;

250 void insertBeforeCommon(Node& nextChild, Node& newChild);	250 void insertBeforeCommon(Node& nextChild, Node& newChild);

251 void appendChildCommon(Node& child);	251 void appendChildCommon(Node& child);

252 void updateTreeAfterInsertion(Node& child);

253 void willRemoveChildren();	252 void willRemoveChildren();

254 void willRemoveChild(Node& child);	253 void willRemoveChild(Node& child);

255 void removeDetachedChildrenInContainer(ContainerNode&);	254 void removeDetachedChildrenInContainer(ContainerNode&);

256 void addChildNodesToDeletionQueue(Node&, Node&, ContainerNode&);	255 void addChildNodesToDeletionQueue(Node&, Node&, ContainerNode&);

257	256

258 void notifyNodeInserted(Node&, ChildrenChangeSource = ChildrenChangeSourceAP I);	257 void notifyNodeInserted(Node&, ChildrenChangeSource = ChildrenChangeSourceAP I);

259 void notifyNodeInsertedInternal(Node&, NodeVector& postInsertionNotification Targets);	258 void notifyNodeInsertedInternal(Node&, NodeVector& postInsertionNotification Targets);

260 void notifyNodeRemoved(Node&);	259 void notifyNodeRemoved(Node&);

261	260

262 bool hasRestyleFlag(DynamicRestyleFlags mask) const { return hasRareData() & & hasRestyleFlagInternal(mask); }	261 bool hasRestyleFlag(DynamicRestyleFlags mask) const { return hasRareData() & & hasRestyleFlagInternal(mask); }

(...skipping 88 matching lines...) Expand 10 before \| Expand all \| Expand 10 after Loading...
351 inline void getChildNodes(ContainerNode& node, NodeVector& nodes)	350 inline void getChildNodes(ContainerNode& node, NodeVector& nodes)

352 {	351 {

353 DCHECK(!nodes.size());	352 DCHECK(!nodes.size());

354 for (Node* child = node.firstChild(); child; child = child->nextSibling())	353 for (Node* child = node.firstChild(); child; child = child->nextSibling())

355 nodes.append(child);	354 nodes.append(child);

356 }	355 }

357	356

358 } // namespace blink	357 } // namespace blink

359	358

360 #endif // ContainerNode_h	359 #endif // ContainerNode_h

OLD	NEW