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 75 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
86 static short compareBoundaryPoints(const RangeBoundaryPoint& boundaryA, cons
t RangeBoundaryPoint& boundaryB, ExceptionState&); | 86 static short compareBoundaryPoints(const RangeBoundaryPoint& boundaryA, cons
t RangeBoundaryPoint& boundaryB, ExceptionState&); |
87 bool boundaryPointsValid() const; | 87 bool boundaryPointsValid() const; |
88 bool intersectsNode(Node* refNode, ExceptionState&); | 88 bool intersectsNode(Node* refNode, ExceptionState&); |
89 static bool intersectsNode(Node* refNode, const Position& start, const Posit
ion& end, ExceptionState&); | 89 static bool intersectsNode(Node* refNode, const Position& start, const Posit
ion& end, ExceptionState&); |
90 void deleteContents(ExceptionState&); | 90 void deleteContents(ExceptionState&); |
91 PassRefPtrWillBeRawPtr<DocumentFragment> extractContents(ExceptionState&); | 91 PassRefPtrWillBeRawPtr<DocumentFragment> extractContents(ExceptionState&); |
92 PassRefPtrWillBeRawPtr<DocumentFragment> cloneContents(ExceptionState&); | 92 PassRefPtrWillBeRawPtr<DocumentFragment> cloneContents(ExceptionState&); |
93 void insertNode(PassRefPtrWillBeRawPtr<Node>, ExceptionState&); | 93 void insertNode(PassRefPtrWillBeRawPtr<Node>, ExceptionState&); |
94 String toString() const; | 94 String toString() const; |
95 | 95 |
96 String toHTML() const; | |
97 String text() const; | 96 String text() const; |
98 | 97 |
99 PassRefPtrWillBeRawPtr<DocumentFragment> createContextualFragment(const Stri
ng& html, ExceptionState&); | 98 PassRefPtrWillBeRawPtr<DocumentFragment> createContextualFragment(const Stri
ng& html, ExceptionState&); |
100 | 99 |
101 void detach(); | 100 void detach(); |
102 PassRefPtrWillBeRawPtr<Range> cloneRange() const; | 101 PassRefPtrWillBeRawPtr<Range> cloneRange() const; |
103 | 102 |
104 void setStartAfter(Node*, ExceptionState& = ASSERT_NO_EXCEPTION); | 103 void setStartAfter(Node*, ExceptionState& = ASSERT_NO_EXCEPTION); |
105 void setEndBefore(Node*, ExceptionState& = ASSERT_NO_EXCEPTION); | 104 void setEndBefore(Node*, ExceptionState& = ASSERT_NO_EXCEPTION); |
106 void setEndAfter(Node*, ExceptionState& = ASSERT_NO_EXCEPTION); | 105 void setEndAfter(Node*, ExceptionState& = ASSERT_NO_EXCEPTION); |
(...skipping 79 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
186 bool areRangesEqual(const Range*, const Range*); | 185 bool areRangesEqual(const Range*, const Range*); |
187 | 186 |
188 } // namespace blink | 187 } // namespace blink |
189 | 188 |
190 #ifndef NDEBUG | 189 #ifndef NDEBUG |
191 // Outside the WebCore namespace for ease of invocation from gdb. | 190 // Outside the WebCore namespace for ease of invocation from gdb. |
192 void showTree(const blink::Range*); | 191 void showTree(const blink::Range*); |
193 #endif | 192 #endif |
194 | 193 |
195 #endif // Range_h | 194 #endif // Range_h |
OLD | NEW |