Chromium Code Reviews
chromiumcodereview-hr@appspot.gserviceaccount.com (chromiumcodereview-hr) | Please choose your nickname with Settings | Help | Chromium Project | Gerrit Changes | Sign out
(185)

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

Issue 673403002: Remove compiler feature detection for = delete (Closed) Base URL: https://github.com/domokit/mojo.git@master
Patch Set: Don't remove #define for FINAL 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:
View unified diff | Download patch
« no previous file with comments | « sky/engine/core/dom/CharacterData.h ('k') | sky/engine/core/dom/Document.h » ('j') | no next file with comments »
Toggle Intra-line Diffs ('i') | Expand Comments ('e') | Collapse Comments ('c') | Show Comments Hide Comments ('s')
OLDNEW
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
135 ContainerNode(TreeScope*, ConstructionType = CreateContainer); 135 ContainerNode(TreeScope*, ConstructionType = CreateContainer);
136 136
137 #if !ENABLE(OILPAN) 137 #if !ENABLE(OILPAN)
138 void removeDetachedChildren(); 138 void removeDetachedChildren();
139 #endif 139 #endif
140 140
141 void setFirstChild(Node* child) { m_firstChild = child; } 141 void setFirstChild(Node* child) { m_firstChild = child; }
142 void setLastChild(Node* child) { m_lastChild = child; } 142 void setLastChild(Node* child) { m_lastChild = child; }
143 143
144 private: 144 private:
145 bool isContainerNode() const WTF_DELETED_FUNCTION; // This will catch anyone doing an unnecessary check. 145 bool isContainerNode() const = delete; // This will catch anyone doing an un necessary check.
146 bool isTextNode() const WTF_DELETED_FUNCTION; // This will catch anyone doin g an unnecessary check. 146 bool isTextNode() const = delete; // This will catch anyone doing an unneces sary check.
147 147
148 void removeBetween(Node* previousChild, Node* nextChild, Node& oldChild); 148 void removeBetween(Node* previousChild, Node* nextChild, Node& oldChild);
149 void insertBeforeCommon(Node& nextChild, Node& oldChild); 149 void insertBeforeCommon(Node& nextChild, Node& oldChild);
150 void appendChildCommon(Node& child); 150 void appendChildCommon(Node& child);
151 void updateTreeAfterInsertion(Node& child); 151 void updateTreeAfterInsertion(Node& child);
152 void willRemoveChildren(); 152 void willRemoveChildren();
153 void willRemoveChild(Node& child); 153 void willRemoveChild(Node& child);
154 void removeDetachedChildrenInContainer(ContainerNode&); 154 void removeDetachedChildrenInContainer(ContainerNode&);
155 void addChildNodesToDeletionQueue(Node*&, Node*&, ContainerNode&); 155 void addChildNodesToDeletionQueue(Node*&, Node*&, ContainerNode&);
156 156
(...skipping 101 matching lines...) Expand 10 before | Expand all | Expand 10 after
258 inline void getChildNodes(ContainerNode& node, NodeVector& nodes) 258 inline void getChildNodes(ContainerNode& node, NodeVector& nodes)
259 { 259 {
260 ASSERT(!nodes.size()); 260 ASSERT(!nodes.size());
261 for (Node* child = node.firstChild(); child; child = child->nextSibling()) 261 for (Node* child = node.firstChild(); child; child = child->nextSibling())
262 nodes.append(child); 262 nodes.append(child);
263 } 263 }
264 264
265 } // namespace blink 265 } // namespace blink
266 266
267 #endif // ContainerNode_h 267 #endif // ContainerNode_h
OLDNEW
« no previous file with comments | « sky/engine/core/dom/CharacterData.h ('k') | sky/engine/core/dom/Document.h » ('j') | no next file with comments »

Powered by Google App Engine
This is Rietveld 408576698