OLD | NEW |
1 /* | 1 /* |
2 * Copyright (C) 2005 Frerich Raabe <raabe@kde.org> | 2 * Copyright (C) 2005 Frerich Raabe <raabe@kde.org> |
3 * Copyright (C) 2006, 2009 Apple Inc. All rights reserved. | 3 * Copyright (C) 2006, 2009 Apple Inc. All rights reserved. |
4 * | 4 * |
5 * Redistribution and use in source and binary forms, with or without | 5 * Redistribution and use in source and binary forms, with or without |
6 * modification, are permitted provided that the following conditions | 6 * modification, are permitted provided that the following conditions |
7 * are met: | 7 * are met: |
8 * | 8 * |
9 * 1. Redistributions of source code must retain the above copyright | 9 * 1. Redistributions of source code must retain the above copyright |
10 * notice, this list of conditions and the following disclaimer. | 10 * notice, this list of conditions and the following disclaimer. |
(...skipping 57 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
68 void convertTo(unsigned short type, ExceptionState&); | 68 void convertTo(unsigned short type, ExceptionState&); |
69 | 69 |
70 unsigned short resultType() const; | 70 unsigned short resultType() const; |
71 | 71 |
72 double numberValue(ExceptionState&) const; | 72 double numberValue(ExceptionState&) const; |
73 String stringValue(ExceptionState&) const; | 73 String stringValue(ExceptionState&) const; |
74 bool booleanValue(ExceptionState&) const; | 74 bool booleanValue(ExceptionState&) const; |
75 Node* singleNodeValue(ExceptionState&) const; | 75 Node* singleNodeValue(ExceptionState&) const; |
76 | 76 |
77 bool invalidIteratorState() const; | 77 bool invalidIteratorState() const; |
78 unsigned long snapshotLength(ExceptionState&) const; | 78 unsigned snapshotLength(ExceptionState&) const; |
79 Node* iterateNext(ExceptionState&); | 79 Node* iterateNext(ExceptionState&); |
80 Node* snapshotItem(unsigned long index, ExceptionState&); | 80 Node* snapshotItem(unsigned index, ExceptionState&); |
81 | 81 |
82 const XPath::Value& value() const { return m_value; } | 82 const XPath::Value& value() const { return m_value; } |
83 | 83 |
84 void trace(Visitor*); | 84 void trace(Visitor*); |
85 | 85 |
86 private: | 86 private: |
87 XPathResult(XPath::EvaluationContext&, const XPath::Value&); | 87 XPathResult(XPath::EvaluationContext&, const XPath::Value&); |
88 XPath::NodeSet& nodeSet() { return *m_nodeSet; } | 88 XPath::NodeSet& nodeSet() { return *m_nodeSet; } |
89 | 89 |
90 XPath::Value m_value; | 90 XPath::Value m_value; |
91 unsigned m_nodeSetPosition; | 91 unsigned m_nodeSetPosition; |
92 OwnPtrWillBeMember<XPath::NodeSet> m_nodeSet; // FIXME: why duplicate the no
de set stored in m_value? | 92 OwnPtrWillBeMember<XPath::NodeSet> m_nodeSet; // FIXME: why duplicate the no
de set stored in m_value? |
93 unsigned short m_resultType; | 93 unsigned short m_resultType; |
94 RefPtrWillBeMember<Document> m_document; | 94 RefPtrWillBeMember<Document> m_document; |
95 uint64_t m_domTreeVersion; | 95 uint64_t m_domTreeVersion; |
96 }; | 96 }; |
97 | 97 |
98 } // namespace blink | 98 } // namespace blink |
99 | 99 |
100 #endif // XPathResult_h | 100 #endif // XPathResult_h |
OLD | NEW |