third_party/WebKit/Source/core/dom/ContainerNode.h - Issue 1511523002: Align HTMLImageElement relevant mutations to spec

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

Issue 1511523002: Align HTMLImageElement relevant mutations to spec (Closed) Base URL: https://chromium.googlesource.com/chromium/src.git@master

Patch Set: nit fix Created 5 years 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/imported/web-platform-tests/images/green-2x2.png ('k') | third_party/WebKit/Source/core/dom/ContainerNode.cpp » ('j') | third_party/WebKit/Source/core/dom/Element.h » ('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 229 matching lines...) Expand 10 before \| Expand all \| Expand 10 after Loading...
240 void insertBeforeCommon(Node& nextChild, Node& oldChild);	240 void insertBeforeCommon(Node& nextChild, Node& oldChild);

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

242 void updateTreeAfterInsertion(Node& child);	242 void updateTreeAfterInsertion(Node& child);

243 void willRemoveChildren();	243 void willRemoveChildren();

244 void willRemoveChild(Node& child);	244 void willRemoveChild(Node& child);

245 void removeDetachedChildrenInContainer(ContainerNode&);	245 void removeDetachedChildrenInContainer(ContainerNode&);

246 void addChildNodesToDeletionQueue(Node&, Node&, ContainerNode&);	246 void addChildNodesToDeletionQueue(Node&, Node&, ContainerNode&);

247	247

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

249 void notifyNodeInsertedInternal(Node&, NodeVector& postInsertionNotification Targets);	249 void notifyNodeInsertedInternal(Node&, NodeVector& postInsertionNotification Targets);

250 void notifyNodeRemoved(Node&);	250 void notifyNodeRemoved(Node&, Node*);
	dstockwell 2015/12/08 12:02:37 these need parameter names these need parameter names
251	251

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

253 bool hasRestyleFlags() const { return hasRareData() && hasRestyleFlagsIntern al(); }	253 bool hasRestyleFlags() const { return hasRareData() && hasRestyleFlagsIntern al(); }

254 void setRestyleFlag(DynamicRestyleFlags);	254 void setRestyleFlag(DynamicRestyleFlags);

255 bool hasRestyleFlagInternal(DynamicRestyleFlags) const;	255 bool hasRestyleFlagInternal(DynamicRestyleFlags) const;

256 bool hasRestyleFlagsInternal() const;	256 bool hasRestyleFlagsInternal() const;

257	257

258 inline bool checkAcceptChildGuaranteedNodeTypes(const Node& newChild, const Node* oldChild, ExceptionState&) const;	258 inline bool checkAcceptChildGuaranteedNodeTypes(const Node& newChild, const Node* oldChild, ExceptionState&) const;

259 inline bool checkAcceptChild(const Node* newChild, const Node* oldChild, Exc eptionState&) const;	259 inline bool checkAcceptChild(const Node* newChild, const Node* oldChild, Exc eptionState&) const;

260 inline bool checkParserAcceptChild(const Node& newChild) const;	260 inline bool checkParserAcceptChild(const Node& newChild) const;

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

366 {	366 {

367 ASSERT(!nodes.size());	367 ASSERT(!nodes.size());

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

369 nodes.append(child);	369 nodes.append(child);

370 }	370 }

371	371

372 } // namespace blink	372 } // namespace blink

373	373

374 #endif // ContainerNode_h	374 #endif // ContainerNode_h

OLD	NEW