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 125 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
136 void setStart(const Position&, ExceptionState& = ASSERT_NO_EXCEPTION); | 136 void setStart(const Position&, ExceptionState& = ASSERT_NO_EXCEPTION); |
137 void setEnd(const Position&, ExceptionState& = ASSERT_NO_EXCEPTION); | 137 void setEnd(const Position&, ExceptionState& = ASSERT_NO_EXCEPTION); |
138 | 138 |
139 Node* FirstNode() const; | 139 Node* FirstNode() const; |
140 Node* PastLastNode() const; | 140 Node* PastLastNode() const; |
141 | 141 |
142 // Not transform-friendly | 142 // Not transform-friendly |
143 IntRect BoundingBox() const; | 143 IntRect BoundingBox() const; |
144 | 144 |
145 // Transform-friendly | 145 // Transform-friendly |
146 void TextQuads(Vector<FloatQuad>&) const; | |
147 void GetBorderAndTextQuads(Vector<FloatQuad>&) const; | 146 void GetBorderAndTextQuads(Vector<FloatQuad>&) const; |
148 FloatRect BoundingRect() const; | 147 FloatRect BoundingRect() const; |
149 | 148 |
150 void NodeChildrenWillBeRemoved(ContainerNode&); | 149 void NodeChildrenWillBeRemoved(ContainerNode&); |
151 void NodeWillBeRemoved(Node&); | 150 void NodeWillBeRemoved(Node&); |
152 | 151 |
153 void DidInsertText(const CharacterData&, unsigned offset, unsigned length); | 152 void DidInsertText(const CharacterData&, unsigned offset, unsigned length); |
154 void DidRemoveText(const CharacterData&, unsigned offset, unsigned length); | 153 void DidRemoveText(const CharacterData&, unsigned offset, unsigned length); |
155 void DidMergeTextNodes(const NodeWithIndex& old_node, unsigned offset); | 154 void DidMergeTextNodes(const NodeWithIndex& old_node, unsigned offset); |
156 void DidSplitTextNode(const Text& old_node); | 155 void DidSplitTextNode(const Text& old_node); |
(...skipping 63 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
220 using RangeVector = HeapVector<Member<Range>>; | 219 using RangeVector = HeapVector<Member<Range>>; |
221 | 220 |
222 } // namespace blink | 221 } // namespace blink |
223 | 222 |
224 #ifndef NDEBUG | 223 #ifndef NDEBUG |
225 // Outside the WebCore namespace for ease of invocation from gdb. | 224 // Outside the WebCore namespace for ease of invocation from gdb. |
226 void showTree(const blink::Range*); | 225 void showTree(const blink::Range*); |
227 #endif | 226 #endif |
228 | 227 |
229 #endif // Range_h | 228 #endif // Range_h |
OLD | NEW |