Remove Range.compareNode() as it is not in the spec

Source/core/dom/Range.h

Index: Source/core/dom/Range.h
diff --git a/Source/core/dom/Range.h b/Source/core/dom/Range.h
index 4530f52e6006462f9530906fbdb6ff83397d87f4..17797c735d22ac8391f4af8f99f354813010ea91 100644
--- a/Source/core/dom/Range.h
+++ b/Source/core/dom/Range.h
@@ -78,10 +78,10 @@ public:
     void setStart(PassRefPtrWillBeRawPtr<Node> container, int offset, ExceptionState& = ASSERT_NO_EXCEPTION);
     void setEnd(PassRefPtrWillBeRawPtr<Node> container, int offset, ExceptionState& = ASSERT_NO_EXCEPTION);
     void collapse(bool toStart);
-    bool isPointInRange(Node* refNode, int offset, ExceptionState&);
+    bool isNodeFullyContained(Node&) const;
+    bool isPointInRange(Node* refNode, int offset, ExceptionState&) const;
     short comparePoint(Node* refNode, int offset, ExceptionState&) const;
     enum CompareResults { NODE_BEFORE, NODE_AFTER, NODE_BEFORE_AND_AFTER, NODE_INSIDE };
-    CompareResults compareNode(Node* refNode, ExceptionState&) const;
     enum CompareHow { START_TO_START, START_TO_END, END_TO_END, END_TO_START };
     short compareBoundaryPoints(unsigned how, const Range* sourceRange, ExceptionState&) const;
     static short compareBoundaryPoints(Node* containerA, int offsetA, Node* containerB, int offsetB, ExceptionState&);