Index: Source/core/dom/Node.h |
diff --git a/Source/core/dom/Node.h b/Source/core/dom/Node.h |
index e8124911044aa7d0ab540e315d376cb95429ceb1..d56e4864fd9a88125e26987e9901de476cb1990b 100644 |
--- a/Source/core/dom/Node.h |
+++ b/Source/core/dom/Node.h |
@@ -187,10 +187,10 @@ public: |
// These should all actually return a node, but this is only important for language bindings, |
// which will already know and hold a ref on the right node to return. |
- void insertBefore(PassRefPtr<Node> newChild, Node* refChild, ExceptionState& = ASSERT_NO_EXCEPTION); |
- void replaceChild(PassRefPtr<Node> newChild, Node* oldChild, ExceptionState& = ASSERT_NO_EXCEPTION); |
+ void insertBefore(PassRefPtrWillBeRawPtr<Node> newChild, Node* refChild, ExceptionState& = ASSERT_NO_EXCEPTION); |
+ void replaceChild(PassRefPtrWillBeRawPtr<Node> newChild, Node* oldChild, ExceptionState& = ASSERT_NO_EXCEPTION); |
void removeChild(Node* child, ExceptionState&); |
- void appendChild(PassRefPtr<Node> newChild, ExceptionState& = ASSERT_NO_EXCEPTION); |
+ void appendChild(PassRefPtrWillBeRawPtr<Node> newChild, ExceptionState& = ASSERT_NO_EXCEPTION); |
bool hasChildren() const { return firstChild(); } |
virtual PassRefPtrWillBeRawPtr<Node> cloneNode(bool deep = false) = 0; |
@@ -885,6 +885,7 @@ inline bool isTreeScopeRoot(const Node& node) |
// Allow equality comparisons of Nodes by reference or pointer, interchangeably. |
DEFINE_COMPARISON_OPERATORS_WITH_REFERENCES_REFCOUNTED(Node) |
+DEFINE_COMPARISON_OPERATORS_WITH_REFERENCES_RAWPTR(Node) |
#define DEFINE_NODE_TYPE_CASTS(thisType, predicate) \ |