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 30 matching lines...) Expand all Loading... |
41 class ContainerNode; | 41 class ContainerNode; |
42 class Document; | 42 class Document; |
43 class DocumentFragment; | 43 class DocumentFragment; |
44 class ExceptionState; | 44 class ExceptionState; |
45 class FloatQuad; | 45 class FloatQuad; |
46 class Node; | 46 class Node; |
47 class NodeWithIndex; | 47 class NodeWithIndex; |
48 class Text; | 48 class Text; |
49 | 49 |
50 class Range FINAL : public RefCountedWillBeGarbageCollectedFinalized<Range>, pub
lic ScriptWrappable { | 50 class Range FINAL : public RefCountedWillBeGarbageCollectedFinalized<Range>, pub
lic ScriptWrappable { |
| 51 DEFINE_WRAPPERTYPEINFO(); |
51 public: | 52 public: |
52 static PassRefPtrWillBeRawPtr<Range> create(Document&); | 53 static PassRefPtrWillBeRawPtr<Range> create(Document&); |
53 static PassRefPtrWillBeRawPtr<Range> create(Document&, Node* startContainer,
int startOffset, Node* endContainer, int endOffset); | 54 static PassRefPtrWillBeRawPtr<Range> create(Document&, Node* startContainer,
int startOffset, Node* endContainer, int endOffset); |
54 static PassRefPtrWillBeRawPtr<Range> create(Document&, const Position&, cons
t Position&); | 55 static PassRefPtrWillBeRawPtr<Range> create(Document&, const Position&, cons
t Position&); |
55 ~Range(); | 56 ~Range(); |
56 | 57 |
57 Document& ownerDocument() const { ASSERT(m_ownerDocument); return *m_ownerDo
cument.get(); } | 58 Document& ownerDocument() const { ASSERT(m_ownerDocument); return *m_ownerDo
cument.get(); } |
58 Node* startContainer() const { return m_start.container(); } | 59 Node* startContainer() const { return m_start.container(); } |
59 int startOffset() const { return m_start.offset(); } | 60 int startOffset() const { return m_start.offset(); } |
60 Node* endContainer() const { return m_end.container(); } | 61 Node* endContainer() const { return m_end.container(); } |
(...skipping 113 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
174 | 175 |
175 bool areRangesEqual(const Range*, const Range*); | 176 bool areRangesEqual(const Range*, const Range*); |
176 | 177 |
177 } // namespace blink | 178 } // namespace blink |
178 | 179 |
179 #ifndef NDEBUG | 180 #ifndef NDEBUG |
180 // Outside the WebCore namespace for ease of invocation from gdb. | 181 // Outside the WebCore namespace for ease of invocation from gdb. |
181 void showTree(const blink::Range*); | 182 void showTree(const blink::Range*); |
182 #endif | 183 #endif |
183 | 184 |
184 #endif | 185 #endif // Range_h |
OLD | NEW |