| 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 reserv
ed. | 6 * Copyright (C) 2004, 2005, 2006, 2007, 2008, 2009 Apple Inc. All rights reserv
ed. |
| 7 * | 7 * |
| 8 * This library is free software; you can redistribute it and/or | 8 * This library is free software; you can redistribute it and/or |
| 9 * modify it under the terms of the GNU Library General Public | 9 * modify it under the terms of the GNU Library General Public |
| 10 * License as published by the Free Software Foundation; either | 10 * License as published by the Free Software Foundation; either |
| (...skipping 66 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 77 static short compareBoundaryPoints(Node* containerA, int offsetA, Node* cont
ainerB, int offsetB, ExceptionState&); | 77 static short compareBoundaryPoints(Node* containerA, int offsetA, Node* cont
ainerB, int offsetB, ExceptionState&); |
| 78 static short compareBoundaryPoints(const RangeBoundaryPoint& boundaryA, cons
t RangeBoundaryPoint& boundaryB, ExceptionState&); | 78 static short compareBoundaryPoints(const RangeBoundaryPoint& boundaryA, cons
t RangeBoundaryPoint& boundaryB, ExceptionState&); |
| 79 bool boundaryPointsValid() const; | 79 bool boundaryPointsValid() const; |
| 80 bool intersectsNode(Node* refNode, ExceptionState&); | 80 bool intersectsNode(Node* refNode, ExceptionState&); |
| 81 void deleteContents(ExceptionState&); | 81 void deleteContents(ExceptionState&); |
| 82 PassRefPtr<DocumentFragment> extractContents(ExceptionState&); | 82 PassRefPtr<DocumentFragment> extractContents(ExceptionState&); |
| 83 PassRefPtr<DocumentFragment> cloneContents(ExceptionState&); | 83 PassRefPtr<DocumentFragment> cloneContents(ExceptionState&); |
| 84 void insertNode(PassRefPtr<Node>, ExceptionState&); | 84 void insertNode(PassRefPtr<Node>, ExceptionState&); |
| 85 String toString() const; | 85 String toString() const; |
| 86 | 86 |
| 87 String toHTML() const; | |
| 88 String text() const; | 87 String text() const; |
| 89 | 88 |
| 90 void detach(); | 89 void detach(); |
| 91 PassRefPtr<Range> cloneRange() const; | 90 PassRefPtr<Range> cloneRange() const; |
| 92 | 91 |
| 93 void setStartAfter(Node*, ExceptionState& = ASSERT_NO_EXCEPTION); | 92 void setStartAfter(Node*, ExceptionState& = ASSERT_NO_EXCEPTION); |
| 94 void setEndBefore(Node*, ExceptionState& = ASSERT_NO_EXCEPTION); | 93 void setEndBefore(Node*, ExceptionState& = ASSERT_NO_EXCEPTION); |
| 95 void setEndAfter(Node*, ExceptionState& = ASSERT_NO_EXCEPTION); | 94 void setEndAfter(Node*, ExceptionState& = ASSERT_NO_EXCEPTION); |
| 96 void selectNode(Node*, ExceptionState& = ASSERT_NO_EXCEPTION); | 95 void selectNode(Node*, ExceptionState& = ASSERT_NO_EXCEPTION); |
| 97 void selectNodeContents(Node*, ExceptionState&); | 96 void selectNodeContents(Node*, ExceptionState&); |
| (...skipping 68 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 166 bool areRangesEqual(const Range*, const Range*); | 165 bool areRangesEqual(const Range*, const Range*); |
| 167 | 166 |
| 168 } // namespace blink | 167 } // namespace blink |
| 169 | 168 |
| 170 #ifndef NDEBUG | 169 #ifndef NDEBUG |
| 171 // Outside the WebCore namespace for ease of invocation from gdb. | 170 // Outside the WebCore namespace for ease of invocation from gdb. |
| 172 void showTree(const blink::Range*); | 171 void showTree(const blink::Range*); |
| 173 #endif | 172 #endif |
| 174 | 173 |
| 175 #endif // SKY_ENGINE_CORE_DOM_RANGE_H_ | 174 #endif // SKY_ENGINE_CORE_DOM_RANGE_H_ |
| OLD | NEW |