2 * Copyright (C) 2005 Frerich Raabe <raabe@kde.org>
3 * Copyright (C) 2006, 2009 Apple Inc.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
11 * 2. Redistributions in binary form must reproduce the above copyright
12 * notice, this list of conditions and the following disclaimer in the
13 * documentation and/or other materials provided with the distribution.
15 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
16 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
17 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
18 * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
19 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
20 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
21 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
22 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
23 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
24 * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
33 #include "XPathExpressionNode.h"
34 #include "XPathNodeSet.h"
42 class Step : public ParseNode {
43 WTF_MAKE_NONCOPYABLE(Step); WTF_MAKE_FAST_ALLOCATED;
46 AncestorAxis, AncestorOrSelfAxis, AttributeAxis,
47 ChildAxis, DescendantAxis, DescendantOrSelfAxis,
48 FollowingAxis, FollowingSiblingAxis, NamespaceAxis,
49 ParentAxis, PrecedingAxis, PrecedingSiblingAxis,
54 WTF_MAKE_FAST_ALLOCATED;
57 TextNodeTest, CommentNodeTest, ProcessingInstructionNodeTest, AnyNodeTest, NameTest
60 NodeTest(Kind kind) : m_kind(kind) {}
61 NodeTest(Kind kind, const String& data) : m_kind(kind), m_data(data) {}
62 NodeTest(Kind kind, const String& data, const String& namespaceURI) : m_kind(kind), m_data(data), m_namespaceURI(namespaceURI) {}
64 Kind kind() const { return m_kind; }
65 const AtomicString& data() const { return m_data; }
66 const AtomicString& namespaceURI() const { return m_namespaceURI; }
67 Vector<Predicate*>& mergedPredicates() { return m_mergedPredicates; }
68 const Vector<Predicate*>& mergedPredicates() const { return m_mergedPredicates; }
73 AtomicString m_namespaceURI;
75 // When possible, we merge some or all predicates with node test for better performance.
76 Vector<Predicate*> m_mergedPredicates;
79 Step(Axis, const NodeTest& nodeTest, const Vector<Predicate*>& predicates = Vector<Predicate*>());
84 void evaluate(Node* context, NodeSet&) const;
86 Axis axis() const { return m_axis; }
87 const NodeTest& nodeTest() const { return m_nodeTest; }
90 friend void optimizeStepPair(Step*, Step*, bool&);
91 bool predicatesAreContextListInsensitive() const;
93 void parseNodeTest(const String&);
94 void nodesInAxis(Node* context, NodeSet&) const;
95 String namespaceFromNodetest(const String& nodeTest) const;
99 Vector<Predicate*> m_predicates;
102 void optimizeStepPair(Step*, Step*, bool& dropSecondStep);
107 #endif // ENABLE(XPATH)
109 #endif // XPathStep_h