Renamed Node::attach to Node::attachLayoutTree.

third_party/WebKit/Source/core/dom/shadow/InsertionPoint.h

 /*
  * Copyright (C) 2012 Google Inc. All rights reserved.
  *
  * Redistribution and use in source and binary forms, with or without
  * modification, are permitted provided that the following conditions are
  * met:
  *
  *     * Redistributions of source code must retain the above copyright
  * notice, this list of conditions and the following disclaimer.
  *     * Redistributions in binary form must reproduce the above
@@ skipping 38 matching lines @@
     bool isActive() const;
     bool canBeActive() const;
 
     bool isShadowInsertionPoint() const;
     bool isContentInsertionPoint() const;
 
     StaticNodeList* getDistributedNodes();
 
     virtual bool canAffectSelector() const { return false; }
 
-    void attach(const AttachContext& = AttachContext()) override;
+    void attachLayoutTree(const AttachContext& = AttachContext()) override;
     void detach(const AttachContext& = AttachContext()) override;
 
     size_t distributedNodesSize() const { return m_distributedNodes.size(); }
     Node* distributedNodeAt(size_t index)  const { return m_distributedNodes.at(index); }
     Node* firstDistributedNode() const { return m_distributedNodes.isEmpty() ? 0 : m_distributedNodes.first(); }
     Node* lastDistributedNode() const { return m_distributedNodes.isEmpty() ? 0 : m_distributedNodes.last(); }
     Node* distributedNodeNextTo(const Node* node) const { return m_distributedNodes.nextTo(node); }
     Node* distributedNodePreviousTo(const Node* node) const { return m_distributedNodes.previousTo(node); }
 
     DECLARE_VIRTUAL_TRACE();
@@ skipping 42 matching lines @@
     return 0;
 }
 
 const InsertionPoint* resolveReprojection(const Node*);
 
 void collectDestinationInsertionPoints(const Node&, HeapVector<Member<InsertionPoint>, 8>& results);
 
 } // namespace blink
 
 #endif // InsertionPoint_h