Rename attach and detach to createRenderTree/destroyRenderTree

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 36 matching lines @@
     void clearDistribution() { m_distribution.clear(); }
     bool isActive() const;
 
     PassRefPtr<NodeList> getDistributedNodes();
 
     virtual bool canAffectSelector() const { return false; }
 
     bool resetStyleInheritance() const;
     void setResetStyleInheritance(bool);
 
-    virtual void attach(const AttachContext& = AttachContext()) OVERRIDE;
-    virtual void detach(const AttachContext& = AttachContext()) OVERRIDE;
+    virtual void createRenderTree(const AttachContext& = AttachContext()) OVERRIDE;
+    virtual void destroyRenderTree(const AttachContext& = AttachContext()) OVERRIDE;
 
     bool shouldUseFallbackElements() const;
 
     size_t size() const { return m_distribution.size(); }
     Node* at(size_t index)  const { return m_distribution.at(index).get(); }
     Node* first() const { return m_distribution.isEmpty() ? 0 : m_distribution.first().get(); }
     Node* last() const { return m_distribution.isEmpty() ? 0 : m_distribution.last().get(); }
     Node* nextTo(const Node* node) const { return m_distribution.nextTo(node); }
     Node* previousTo(const Node* node) const { return m_distribution.previousTo(node); }
 
@@ skipping 61 matching lines @@
     return 0;
 }
 
 InsertionPoint* resolveReprojection(const Node*);
 
 void collectInsertionPointsWhereNodeIsDistributed(const Node*, Vector<InsertionPoint*, 8>& results);
 
 } // namespace WebCore
 
 #endif // InsertionPoint_h