| OLD | NEW |
| 1 /* | 1 /* |
| 2 * (C) 1999 Lars Knoll (knoll@kde.org) | 2 * (C) 1999 Lars Knoll (knoll@kde.org) |
| 3 * (C) 2000 Gunnstein Lye (gunnstein@netcom.no) | 3 * (C) 2000 Gunnstein Lye (gunnstein@netcom.no) |
| 4 * (C) 2000 Frederik Holljen (frederik.holljen@hig.no) | 4 * (C) 2000 Frederik Holljen (frederik.holljen@hig.no) |
| 5 * (C) 2001 Peter Kelly (pmk@post.com) | 5 * (C) 2001 Peter Kelly (pmk@post.com) |
| 6 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights | 6 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights |
| 7 * reserved. | 7 * reserved. |
| 8 * | 8 * |
| 9 * This library is free software; you can redistribute it and/or | 9 * This library is free software; you can redistribute it and/or |
| 10 * modify it under the terms of the GNU Library General Public | 10 * modify it under the terms of the GNU Library General Public |
| (...skipping 68 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 79 Node* commonAncestorContainer() const; | 79 Node* commonAncestorContainer() const; |
| 80 static Node* commonAncestorContainer(const Node* containerA, | 80 static Node* commonAncestorContainer(const Node* containerA, |
| 81 const Node* containerB); | 81 const Node* containerB); |
| 82 void setStart(Node* container, | 82 void setStart(Node* container, |
| 83 unsigned offset, | 83 unsigned offset, |
| 84 ExceptionState& = ASSERT_NO_EXCEPTION); | 84 ExceptionState& = ASSERT_NO_EXCEPTION); |
| 85 void setEnd(Node* container, | 85 void setEnd(Node* container, |
| 86 unsigned offset, | 86 unsigned offset, |
| 87 ExceptionState& = ASSERT_NO_EXCEPTION); | 87 ExceptionState& = ASSERT_NO_EXCEPTION); |
| 88 void collapse(bool toStart); | 88 void collapse(bool toStart); |
| 89 bool isNodeFullyContained(Node&) const; | |
| 90 bool isPointInRange(Node* refNode, unsigned offset, ExceptionState&) const; | 89 bool isPointInRange(Node* refNode, unsigned offset, ExceptionState&) const; |
| 91 short comparePoint(Node* refNode, unsigned offset, ExceptionState&) const; | 90 short comparePoint(Node* refNode, unsigned offset, ExceptionState&) const; |
| 92 enum CompareResults { | 91 enum CompareResults { |
| 93 NODE_BEFORE, | 92 NODE_BEFORE, |
| 94 NODE_AFTER, | 93 NODE_AFTER, |
| 95 NODE_BEFORE_AND_AFTER, | 94 NODE_BEFORE_AND_AFTER, |
| 96 NODE_INSIDE | 95 NODE_INSIDE |
| 97 }; | 96 }; |
| 98 enum CompareHow { kStartToStart, kStartToEnd, kEndToEnd, kEndToStart }; | 97 enum CompareHow { kStartToStart, kStartToEnd, kEndToEnd, kEndToStart }; |
| 99 short compareBoundaryPoints(unsigned how, | 98 short compareBoundaryPoints(unsigned how, |
| (...skipping 122 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 222 using RangeVector = HeapVector<Member<Range>>; | 221 using RangeVector = HeapVector<Member<Range>>; |
| 223 | 222 |
| 224 } // namespace blink | 223 } // namespace blink |
| 225 | 224 |
| 226 #ifndef NDEBUG | 225 #ifndef NDEBUG |
| 227 // Outside the WebCore namespace for ease of invocation from gdb. | 226 // Outside the WebCore namespace for ease of invocation from gdb. |
| 228 void showTree(const blink::Range*); | 227 void showTree(const blink::Range*); |
| 229 #endif | 228 #endif |
| 230 | 229 |
| 231 #endif // Range_h | 230 #endif // Range_h |
| OLD | NEW |