| Index: third_party/WebKit/Source/core/editing/commands/SimplifyMarkupCommand.cpp
|
| diff --git a/third_party/WebKit/Source/core/editing/commands/SimplifyMarkupCommand.cpp b/third_party/WebKit/Source/core/editing/commands/SimplifyMarkupCommand.cpp
|
| index f201ad3d22be367917ccefed78c05c53535b3abb..bb7e88790a8581a16bc3db486369baa8b264f2c5 100644
|
| --- a/third_party/WebKit/Source/core/editing/commands/SimplifyMarkupCommand.cpp
|
| +++ b/third_party/WebKit/Source/core/editing/commands/SimplifyMarkupCommand.cpp
|
| @@ -41,7 +41,7 @@ SimplifyMarkupCommand::SimplifyMarkupCommand(Document& document, Node* firstNode
|
| void SimplifyMarkupCommand::doApply()
|
| {
|
| ContainerNode* rootNode = m_firstNode->parentNode();
|
| - WillBeHeapVector<RefPtrWillBeMember<ContainerNode>> nodesToRemove;
|
| + HeapVector<Member<ContainerNode>> nodesToRemove;
|
|
|
| // Walk through the inserted nodes, to see if there are elements that could be removed
|
| // without affecting the style. The goal is to produce leaner markup even when starting
|
| @@ -96,7 +96,7 @@ void SimplifyMarkupCommand::doApply()
|
| }
|
| }
|
|
|
| -int SimplifyMarkupCommand::pruneSubsequentAncestorsToRemove(WillBeHeapVector<RefPtrWillBeMember<ContainerNode>>& nodesToRemove, size_t startNodeIndex)
|
| +int SimplifyMarkupCommand::pruneSubsequentAncestorsToRemove(HeapVector<Member<ContainerNode>>& nodesToRemove, size_t startNodeIndex)
|
| {
|
| size_t pastLastNodeToRemove = startNodeIndex + 1;
|
| for (; pastLastNodeToRemove < nodesToRemove.size(); ++pastLastNodeToRemove) {
|
| @@ -106,7 +106,7 @@ int SimplifyMarkupCommand::pruneSubsequentAncestorsToRemove(WillBeHeapVector<Ref
|
| }
|
|
|
| ContainerNode* highestAncestorToRemove = nodesToRemove[pastLastNodeToRemove - 1].get();
|
| - RefPtrWillBeRawPtr<ContainerNode> parent = highestAncestorToRemove->parentNode();
|
| + RawPtr<ContainerNode> parent = highestAncestorToRemove->parentNode();
|
| if (!parent) // Parent has already been removed.
|
| return -1;
|
|
|
|
|