sky/engine/core/dom/ContainerNode.h - Issue 732203004: Clean up child checks in ContainerNode.

Side by Side Diff: sky/engine/core/dom/ContainerNode.h

Issue 732203004: Clean up child checks in ContainerNode. (Closed) Base URL: git@github.com:domokit/mojo.git@master

Patch Set: dry Created 6 years, 1 month ago

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

Jump to:

« no previous file with comments | « no previous file | sky/engine/core/dom/ContainerNode.cpp » ('j') | sky/engine/core/dom/ContainerNode.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 * (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 124 matching lines...) Expand 10 before \| Expand all \| Expand 10 after Loading...
135 void updateTreeAfterInsertion(Node& child);	135 void updateTreeAfterInsertion(Node& child);

136 void willRemoveChildren();	136 void willRemoveChildren();

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

138 void removeDetachedChildrenInContainer(ContainerNode&);	138 void removeDetachedChildrenInContainer(ContainerNode&);

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

140	140

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

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

143 void notifyNodeRemoved(Node&);	143 void notifyNodeRemoved(Node&);

144	144

145 inline bool checkAcceptChildGuaranteedNodeTypes(const Node& newChild, Except ionState&) const;	145 inline void checkAcceptChild(const Node* newChild, const Node* oldChild, Exc eptionState&) const;

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

147 inline bool containsConsideringHostElements(const Node&) const;	146 inline bool containsConsideringHostElements(const Node&) const;

148 inline bool isChildTypeAllowed(const Node& child) const;

149	147

150 void attachChildren(const AttachContext& = AttachContext());	148 void attachChildren(const AttachContext& = AttachContext());

151 void detachChildren(const AttachContext& = AttachContext());	149 void detachChildren(const AttachContext& = AttachContext());

152	150

153 bool getUpperLeftCorner(FloatPoint&) const;	151 bool getUpperLeftCorner(FloatPoint&) const;

154 bool getLowerRightCorner(FloatPoint&) const;	152 bool getLowerRightCorner(FloatPoint&) const;

155	153

156 RawPtr<Node> m_firstChild;	154 RawPtr<Node> m_firstChild;

157 RawPtr<Node> m_lastChild;	155 RawPtr<Node> m_lastChild;

158 };	156 };

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

221 {	219 {

222 ASSERT(!nodes.size());	220 ASSERT(!nodes.size());

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

224 nodes.append(child);	222 nodes.append(child);

225 }	223 }

226	224

227 } // namespace blink	225 } // namespace blink

228	226

229 #endif // ContainerNode_h	227 #endif // ContainerNode_h

OLD	NEW