Chromium Code Reviews| Index: Source/core/dom/Range.h |
| diff --git a/Source/core/dom/Range.h b/Source/core/dom/Range.h |
| index 4530f52e6006462f9530906fbdb6ff83397d87f4..08b8015fb576b08d55d987adeacb3e2f5d797c49 100644 |
| --- a/Source/core/dom/Range.h |
| +++ b/Source/core/dom/Range.h |
| @@ -81,9 +81,9 @@ public: |
| bool isPointInRange(Node* refNode, int offset, ExceptionState&); |
| 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; |
| + bool isNodeFullySelected(Node&) const; |
|
philipj_slow
2015/06/11 08:39:14
I would still prefer the name isNodeFullyContained
deepak.s
2015/06/25 10:52:36
Done.
|
| static short compareBoundaryPoints(Node* containerA, int offsetA, Node* containerB, int offsetB, ExceptionState&); |
| static short compareBoundaryPoints(const RangeBoundaryPoint& boundaryA, const RangeBoundaryPoint& boundaryB, ExceptionState&); |
| bool boundaryPointsValid() const; |