| Index: third_party/WebKit/Source/core/xml/XPathNodeSet.h
|
| diff --git a/third_party/WebKit/Source/core/xml/XPathNodeSet.h b/third_party/WebKit/Source/core/xml/XPathNodeSet.h
|
| index c6ffede9ae9d79aa938ebf487dc3bbd2c8395234..7ffce04ca2be55d5c1552a268effe937a3ac0b9d 100644
|
| --- a/third_party/WebKit/Source/core/xml/XPathNodeSet.h
|
| +++ b/third_party/WebKit/Source/core/xml/XPathNodeSet.h
|
| @@ -49,7 +49,7 @@ public:
|
| void swap(NodeSet& other) { std::swap(m_isSorted, other.m_isSorted); std::swap(m_subtreesAreDisjoint, other.m_subtreesAreDisjoint); m_nodes.swap(other.m_nodes); }
|
|
|
| // NodeSet itself does not verify that nodes in it are unique.
|
| - void append(PassRefPtrWillBeRawPtr<Node> node) { m_nodes.append(node); }
|
| + void append(RawPtr<Node> node) { m_nodes.append(node); }
|
| void append(const NodeSet& nodeSet) { m_nodes.appendVector(nodeSet.m_nodes); }
|
|
|
| // Returns the set's first node in document order, or 0 if the set is empty.
|
| @@ -78,7 +78,7 @@ private:
|
|
|
| bool m_isSorted;
|
| bool m_subtreesAreDisjoint;
|
| - WillBeHeapVector<RefPtrWillBeMember<Node>> m_nodes;
|
| + HeapVector<Member<Node>> m_nodes;
|
| };
|
|
|
| } // namespace XPath
|
|
|