| 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 80 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 91 PassRefPtrWillBeRawPtr<DocumentFragment> createContextualFragment(const Stri
ng& html, ExceptionState&); | 91 PassRefPtrWillBeRawPtr<DocumentFragment> createContextualFragment(const Stri
ng& html, ExceptionState&); |
| 92 | 92 |
| 93 void detach(); | 93 void detach(); |
| 94 PassRefPtrWillBeRawPtr<Range> cloneRange() const; | 94 PassRefPtrWillBeRawPtr<Range> cloneRange() const; |
| 95 | 95 |
| 96 void setStartAfter(Node*, ExceptionState& = ASSERT_NO_EXCEPTION); | 96 void setStartAfter(Node*, ExceptionState& = ASSERT_NO_EXCEPTION); |
| 97 void setEndBefore(Node*, ExceptionState& = ASSERT_NO_EXCEPTION); | 97 void setEndBefore(Node*, ExceptionState& = ASSERT_NO_EXCEPTION); |
| 98 void setEndAfter(Node*, ExceptionState& = ASSERT_NO_EXCEPTION); | 98 void setEndAfter(Node*, ExceptionState& = ASSERT_NO_EXCEPTION); |
| 99 void selectNode(Node*, ExceptionState& = ASSERT_NO_EXCEPTION); | 99 void selectNode(Node*, ExceptionState& = ASSERT_NO_EXCEPTION); |
| 100 void selectNodeContents(Node*, ExceptionState&); | 100 void selectNodeContents(Node*, ExceptionState&); |
| 101 static bool selectNodeContents(Node*, Position&, Position&); |
| 101 void surroundContents(PassRefPtrWillBeRawPtr<Node>, ExceptionState&); | 102 void surroundContents(PassRefPtrWillBeRawPtr<Node>, ExceptionState&); |
| 102 void setStartBefore(Node*, ExceptionState& = ASSERT_NO_EXCEPTION); | 103 void setStartBefore(Node*, ExceptionState& = ASSERT_NO_EXCEPTION); |
| 103 | 104 |
| 104 const Position startPosition() const { return m_start.toPosition(); } | 105 const Position startPosition() const { return m_start.toPosition(); } |
| 105 const Position endPosition() const { return m_end.toPosition(); } | 106 const Position endPosition() const { return m_end.toPosition(); } |
| 106 void setStart(const Position&, ExceptionState& = ASSERT_NO_EXCEPTION); | 107 void setStart(const Position&, ExceptionState& = ASSERT_NO_EXCEPTION); |
| 107 void setEnd(const Position&, ExceptionState& = ASSERT_NO_EXCEPTION); | 108 void setEnd(const Position&, ExceptionState& = ASSERT_NO_EXCEPTION); |
| 108 | 109 |
| 109 Node* firstNode() const; | 110 Node* firstNode() const; |
| 110 Node* pastLastNode() const; | 111 Node* pastLastNode() const; |
| (...skipping 66 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 177 bool areRangesEqual(const Range*, const Range*); | 178 bool areRangesEqual(const Range*, const Range*); |
| 178 | 179 |
| 179 } // namespace blink | 180 } // namespace blink |
| 180 | 181 |
| 181 #ifndef NDEBUG | 182 #ifndef NDEBUG |
| 182 // Outside the WebCore namespace for ease of invocation from gdb. | 183 // Outside the WebCore namespace for ease of invocation from gdb. |
| 183 void showTree(const blink::Range*); | 184 void showTree(const blink::Range*); |
| 184 #endif | 185 #endif |
| 185 | 186 |
| 186 #endif // Range_h | 187 #endif // Range_h |
| OLD | NEW |