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 50 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
61 unsigned end_offset); | 61 unsigned end_offset); |
62 static Range* Create(Document&, const Position&, const Position&); | 62 static Range* Create(Document&, const Position&, const Position&); |
63 static Range* CreateAdjustedToTreeScope(const TreeScope&, const Position&); | 63 static Range* CreateAdjustedToTreeScope(const TreeScope&, const Position&); |
64 | 64 |
65 void Dispose(); | 65 void Dispose(); |
66 | 66 |
67 Document& OwnerDocument() const { | 67 Document& OwnerDocument() const { |
68 DCHECK(owner_document_); | 68 DCHECK(owner_document_); |
69 return *owner_document_.Get(); | 69 return *owner_document_.Get(); |
70 } | 70 } |
71 Node* startContainer() const { return start_.Container(); } | 71 Node* startContainer() const { return &start_.Container(); } |
72 unsigned startOffset() const { return start_.Offset(); } | 72 unsigned startOffset() const { return start_.Offset(); } |
73 Node* endContainer() const { return end_.Container(); } | 73 Node* endContainer() const { return &end_.Container(); } |
74 unsigned endOffset() const { return end_.Offset(); } | 74 unsigned endOffset() const { return end_.Offset(); } |
75 | 75 |
76 bool collapsed() const { return start_ == end_; } | 76 bool collapsed() const { return start_ == end_; } |
77 bool IsConnected() const; | 77 bool IsConnected() const; |
78 | 78 |
79 Node* commonAncestorContainer() const; | 79 Node* commonAncestorContainer() const; |
80 static Node* commonAncestorContainer(const Node* container_a, | 80 static Node* commonAncestorContainer(const Node* container_a, |
81 const Node* container_b); | 81 const Node* container_b); |
82 void setStart(Node* container, | 82 void setStart(Node* container, |
83 unsigned offset, | 83 unsigned offset, |
(...skipping 137 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
221 using RangeVector = HeapVector<Member<Range>>; | 221 using RangeVector = HeapVector<Member<Range>>; |
222 | 222 |
223 } // namespace blink | 223 } // namespace blink |
224 | 224 |
225 #ifndef NDEBUG | 225 #ifndef NDEBUG |
226 // Outside the WebCore namespace for ease of invocation from gdb. | 226 // Outside the WebCore namespace for ease of invocation from gdb. |
227 void showTree(const blink::Range*); | 227 void showTree(const blink::Range*); |
228 #endif | 228 #endif |
229 | 229 |
230 #endif // Range_h | 230 #endif // Range_h |
OLD | NEW |