| 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 28 matching lines...) Expand all Loading... |
| 39 class Node; | 39 class Node; |
| 40 | 40 |
| 41 namespace XPath { | 41 namespace XPath { |
| 42 struct EvaluationContext; | 42 struct EvaluationContext; |
| 43 } | 43 } |
| 44 | 44 |
| 45 class XPathResult final : public GarbageCollected<XPathResult>, public ScriptWra
ppable { | 45 class XPathResult final : public GarbageCollected<XPathResult>, public ScriptWra
ppable { |
| 46 DEFINE_WRAPPERTYPEINFO(); | 46 DEFINE_WRAPPERTYPEINFO(); |
| 47 public: | 47 public: |
| 48 enum XPathResultType { | 48 enum XPathResultType { |
| 49 ANY_TYPE = 0, | 49 kAnyType = 0, |
| 50 NUMBER_TYPE = 1, | 50 kNumberType = 1, |
| 51 STRING_TYPE = 2, | 51 kStringType = 2, |
| 52 BOOLEAN_TYPE = 3, | 52 kBooleanType = 3, |
| 53 UNORDERED_NODE_ITERATOR_TYPE = 4, | 53 kUnorderedNodeIteratorType = 4, |
| 54 ORDERED_NODE_ITERATOR_TYPE = 5, | 54 kOrderedNodeIteratorType = 5, |
| 55 UNORDERED_NODE_SNAPSHOT_TYPE = 6, | 55 kUnorderedNodeSnapshotType = 6, |
| 56 ORDERED_NODE_SNAPSHOT_TYPE = 7, | 56 kOrderedNodeSnapshotType = 7, |
| 57 ANY_UNORDERED_NODE_TYPE = 8, | 57 kAnyUnorderedNodeType = 8, |
| 58 FIRST_ORDERED_NODE_TYPE = 9 | 58 kFirstOrderedNodeType = 9 |
| 59 }; | 59 }; |
| 60 | 60 |
| 61 static XPathResult* create(XPath::EvaluationContext& context, const XPath::V
alue& value) | 61 static XPathResult* create(XPath::EvaluationContext& context, const XPath::V
alue& value) |
| 62 { | 62 { |
| 63 return new XPathResult(context, value); | 63 return new XPathResult(context, value); |
| 64 } | 64 } |
| 65 | 65 |
| 66 void convertTo(unsigned short type, ExceptionState&); | 66 void convertTo(unsigned short type, ExceptionState&); |
| 67 | 67 |
| 68 unsigned short resultType() const; | 68 unsigned short resultType() const; |
| (...skipping 20 matching lines...) Expand all Loading... |
| 89 unsigned m_nodeSetPosition; | 89 unsigned m_nodeSetPosition; |
| 90 Member<XPath::NodeSet> m_nodeSet; // FIXME: why duplicate the node set store
d in m_value? | 90 Member<XPath::NodeSet> m_nodeSet; // FIXME: why duplicate the node set store
d in m_value? |
| 91 unsigned short m_resultType; | 91 unsigned short m_resultType; |
| 92 Member<Document> m_document; | 92 Member<Document> m_document; |
| 93 uint64_t m_domTreeVersion; | 93 uint64_t m_domTreeVersion; |
| 94 }; | 94 }; |
| 95 | 95 |
| 96 } // namespace blink | 96 } // namespace blink |
| 97 | 97 |
| 98 #endif // XPathResult_h | 98 #endif // XPathResult_h |
| OLD | NEW |