Chromium Code Reviews| Index: Source/core/dom/shadow/InsertionPoint.cpp |
| diff --git a/Source/core/dom/shadow/InsertionPoint.cpp b/Source/core/dom/shadow/InsertionPoint.cpp |
| index c26fef579fb1bbdc9d6988a81bc9f62e7102c55d..c89d3f39e22974164699e5a4cd03c331de8354ab 100644 |
| --- a/Source/core/dom/shadow/InsertionPoint.cpp |
| +++ b/Source/core/dom/shadow/InsertionPoint.cpp |
| @@ -152,7 +152,7 @@ bool InsertionPoint::isActive() const |
| return true; |
| // Slow path only when there are more than one shadow elements in a shadow tree. That should be a rare case. |
| - const Vector<RefPtr<InsertionPoint> >& insertionPoints = shadowRoot->descendantInsertionPoints(); |
| + const WillBeHeapVector<RefPtrWillBeMember<InsertionPoint> >& insertionPoints = shadowRoot->descendantInsertionPoints(); |
| for (size_t i = 0; i < insertionPoints.size(); ++i) { |
| InsertionPoint* point = insertionPoints[i].get(); |
| if (isHTMLShadowElement(*point)) |
| @@ -245,6 +245,12 @@ void InsertionPoint::removedFrom(ContainerNode* insertionPoint) |
| HTMLElement::removedFrom(insertionPoint); |
| } |
| +void InsertionPoint::trace(Visitor* visitor) |
| +{ |
| + m_distribution.trace(visitor); |
|
haraken
2014/05/12 13:38:35
visitor->trace(m_distribution);
should work.
sof
2014/05/12 21:57:19
Cute, wasn't aware of that overload.
|
| + HTMLElement::trace(visitor); |
| +} |
| + |
| const InsertionPoint* resolveReprojection(const Node* projectedNode) |
| { |
| ASSERT(projectedNode); |
| @@ -266,7 +272,7 @@ const InsertionPoint* resolveReprojection(const Node* projectedNode) |
| return insertionPoint; |
| } |
| -void collectDestinationInsertionPoints(const Node& node, Vector<InsertionPoint*, 8>& results) |
| +void collectDestinationInsertionPoints(const Node& node, WillBeHeapVector<RawPtrWillBeMember<InsertionPoint>, 8>& results) |
| { |
| const Node* current = &node; |
| ElementShadow* lastElementShadow = 0; |