| 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 void setEndBefore(Node*, ExceptionCode&); | 91 void setEndBefore(Node*, ExceptionCode&); |
| 92 void setEndAfter(Node*, ExceptionCode&); | 92 void setEndAfter(Node*, ExceptionCode&); |
| 93 void selectNode(Node*, ExceptionCode&); | 93 void selectNode(Node*, ExceptionCode&); |
| 94 void selectNodeContents(Node*, ExceptionCode&); | 94 void selectNodeContents(Node*, ExceptionCode&); |
| 95 void surroundContents(PassRefPtr<Node>, ExceptionCode&); | 95 void surroundContents(PassRefPtr<Node>, ExceptionCode&); |
| 96 void setStartBefore(Node*, ExceptionCode&); | 96 void setStartBefore(Node*, ExceptionCode&); |
| 97 | 97 |
| 98 const Position startPosition() const { return m_start.toPosition(); } | 98 const Position startPosition() const { return m_start.toPosition(); } |
| 99 const Position endPosition() const { return m_end.toPosition(); } | 99 const Position endPosition() const { return m_end.toPosition(); } |
| 100 | 100 |
| 101 bool getLocationAndLength(unsigned& location, unsigned& length); |
| 102 |
| 101 Node* firstNode() const; | 103 Node* firstNode() const; |
| 102 Node* pastLastNode() const; | 104 Node* pastLastNode() const; |
| 103 | 105 |
| 104 Position editingStartPosition() const; | 106 Position editingStartPosition() const; |
| 105 | 107 |
| 106 Node* shadowTreeRootNode() const; | 108 Node* shadowTreeRootNode() const; |
| 107 | 109 |
| 108 IntRect boundingBox(); | 110 IntRect boundingBox(); |
| 109 // Not transform-friendly | 111 // Not transform-friendly |
| 110 void textRects(Vector<IntRect>&, bool useSelectionHeight = false); | 112 void textRects(Vector<IntRect>&, bool useSelectionHeight = false); |
| (...skipping 53 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
| 164 bool areRangesEqual(const Range*, const Range*); | 166 bool areRangesEqual(const Range*, const Range*); |
| 165 | 167 |
| 166 } // namespace | 168 } // namespace |
| 167 | 169 |
| 168 #ifndef NDEBUG | 170 #ifndef NDEBUG |
| 169 // Outside the WebCore namespace for ease of invocation from gdb. | 171 // Outside the WebCore namespace for ease of invocation from gdb. |
| 170 void showTree(const WebCore::Range*); | 172 void showTree(const WebCore::Range*); |
| 171 #endif | 173 #endif |
| 172 | 174 |
| 173 #endif | 175 #endif |
| OLD | NEW |