Move parts of core/dom to C++11

Source/core/dom/ContainerNode.h

 /*
  * Copyright (C) 1999 Lars Knoll (knoll@kde.org)
  *           (C) 1999 Antti Koivisto (koivisto@kde.org)
  *           (C) 2001 Dirk Mueller (mueller@kde.org)
  * Copyright (C) 2004, 2005, 2006, 2007, 2009, 2010, 2011, 2013 Apple Inc. All rights reserved.
  *
  * This library is free software; you can redistribute it and/or
  * modify it under the terms of the GNU Library General Public
  * License as published by the Free Software Foundation; either
  * version 2 of the License, or (at your option) any later version.
@@ skipping 19 matching lines @@
 #include "wtf/OwnPtr.h"
 #include "wtf/Vector.h"
 
 namespace blink {
 
 class ClassCollection;
 class ExceptionState;
 class FloatPoint;
 class HTMLCollection;
 template <typename NodeType> class StaticNodeTypeList;
-typedef StaticNodeTypeList<Element> StaticElementList;
+using StaticElementList = StaticNodeTypeList<Element>;
 class TagCollection;
 
 enum DynamicRestyleFlags {
     ChildrenOrSiblingsAffectedByFocus = 1 << 0,
     ChildrenOrSiblingsAffectedByHover = 1 << 1,
     ChildrenOrSiblingsAffectedByActive = 1 << 2,
     ChildrenOrSiblingsAffectedByDrag = 1 << 3,
     ChildrenAffectedByFirstChildRules = 1 << 4,
     ChildrenAffectedByLastChildRules = 1 << 5,
     ChildrenAffectedByDirectAdjacentRules = 1 << 6,
     ChildrenAffectedByIndirectAdjacentRules = 1 << 7,
     ChildrenAffectedByForwardPositionalRules = 1 << 8,
     ChildrenAffectedByBackwardPositionalRules = 1 << 9,
 
     NumberOfDynamicRestyleFlags = 10,
 };
 
 // This constant controls how much buffer is initially allocated
 // for a Node Vector that is used to store child Nodes of a given Node.
 // FIXME: Optimize the value.
 const int initialNodeVectorSize = 11;
-typedef WillBeHeapVector<RefPtrWillBeMember<Node>, initialNodeVectorSize> NodeVector;
+using NodeVector = WillBeHeapVector<RefPtrWillBeMember<Node>, initialNodeVectorSize>;
 
 class ContainerNode : public Node {
 public:
     virtual ~ContainerNode();
 
     Node* firstChild() const { return m_firstChild; }
     Node* lastChild() const { return m_lastChild; }
     bool hasChildren() const { return m_firstChild; }
 
     bool hasOneChild() const { return m_firstChild && !m_firstChild->nextSibling(); }
@@ skipping 123 matching lines @@
     // node that is of the type CDATA_SECTION_NODE, TEXT_NODE or COMMENT_NODE has changed its value.
     virtual void childrenChanged(const ChildrenChange&);
 
     void disconnectDescendantFrames();
 
     virtual void trace(Visitor*) override;
 
 protected:
     ContainerNode(TreeScope*, ConstructionType = CreateContainer);
 
-    void invalidateNodeListCachesInAncestors(const QualifiedName* attrName = 0, Element* attributeOwnerElement = 0);
+    void invalidateNodeListCachesInAncestors(const QualifiedName* attrName = nullptr, Element* attributeOwnerElement = nullptr);
 
 #if !ENABLE(OILPAN)
     void removeDetachedChildren();
 #endif
 
     void setFirstChild(Node* child) { m_firstChild = child; }
     void setLastChild(Node* child) { m_lastChild = child; }
 
     // Utility functions for NodeListsNodeData API.
     template <typename Collection> PassRefPtrWillBeRawPtr<Collection> ensureCachedCollection(CollectionType);
@@ skipping 59 matching lines @@
 inline ContainerNode::ContainerNode(TreeScope* treeScope, ConstructionType type)
     : Node(treeScope, type)
     , m_firstChild(nullptr)
     , m_lastChild(nullptr)
 {
 }
 
 inline void ContainerNode::attachChildren(const AttachContext& context)
 {
     AttachContext childrenContext(context);
-    childrenContext.resolvedStyle = 0;
+    childrenContext.resolvedStyle = nullptr;
 
     for (Node* child = firstChild(); child; child = child->nextSibling()) {
         ASSERT(child->needsAttach() || childAttachedAllowedWhenAttachingChildren(this));
         if (child->needsAttach())
             child->attach(childrenContext);
     }
 }
 
 inline void ContainerNode::detachChildren(const AttachContext& context)
 {
     AttachContext childrenContext(context);
-    childrenContext.resolvedStyle = 0;
+    childrenContext.resolvedStyle = nullptr;
 
     for (Node* child = firstChild(); child; child = child->nextSibling())
         child->detach(childrenContext);
 }
 
 inline unsigned Node::countChildren() const
 {
     if (!isContainerNode())
         return 0;
     return toContainerNode(this)->countChildren();
 }
 
 inline Node* Node::firstChild() const
 {
     if (!isContainerNode())
-        return 0;
+        return nullptr;
     return toContainerNode(this)->firstChild();
 }
 
 inline Node* Node::lastChild() const
 {
     if (!isContainerNode())
-        return 0;
+        return nullptr;
     return toContainerNode(this)->lastChild();
 }
 
 inline ContainerNode* Node::parentElementOrShadowRoot() const
 {
     ContainerNode* parent = parentNode();
-    return parent && (parent->isElementNode() || parent->isShadowRoot()) ? parent : 0;
+    return parent && (parent->isElementNode() || parent->isShadowRoot()) ? parent : nullptr;
 }
 
 inline ContainerNode* Node::parentElementOrDocumentFragment() const
 {
     ContainerNode* parent = parentNode();
-    return parent && (parent->isElementNode() || parent->isDocumentFragment()) ? parent : 0;
+    return parent && (parent->isElementNode() || parent->isDocumentFragment()) ? parent : nullptr;
 }
 
 inline bool Node::isTreeScope() const
 {
     return &treeScope().rootNode() == this;
 }
 
 inline void getChildNodes(ContainerNode& node, NodeVector& nodes)
 {
     ASSERT(!nodes.size());
     for (Node* child = node.firstChild(); child; child = child->nextSibling())
         nodes.append(child);
 }
 
 } // namespace blink
 
 #endif // ContainerNode_h