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. | 3 * Copyright (C) 2006, 2009 Apple Inc. |
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 75 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
86 Kind m_kind; | 86 Kind m_kind; |
87 AtomicString m_data; | 87 AtomicString m_data; |
88 AtomicString m_namespaceURI; | 88 AtomicString m_namespaceURI; |
89 | 89 |
90 // When possible, we merge some or all predicates with node test for bet
ter performance. | 90 // When possible, we merge some or all predicates with node test for bet
ter performance. |
91 HeapVector<Member<Predicate>> m_mergedPredicates; | 91 HeapVector<Member<Predicate>> m_mergedPredicates; |
92 }; | 92 }; |
93 | 93 |
94 Step(Axis, const NodeTest&); | 94 Step(Axis, const NodeTest&); |
95 Step(Axis, const NodeTest&, HeapVector<Member<Predicate>>&); | 95 Step(Axis, const NodeTest&, HeapVector<Member<Predicate>>&); |
96 virtual ~Step(); | 96 ~Step() override; |
97 DECLARE_VIRTUAL_TRACE(); | 97 DECLARE_VIRTUAL_TRACE(); |
98 | 98 |
99 void optimize(); | 99 void optimize(); |
100 | 100 |
101 void evaluate(EvaluationContext&, Node* context, NodeSet&) const; | 101 void evaluate(EvaluationContext&, Node* context, NodeSet&) const; |
102 | 102 |
103 Axis axis() const { return m_axis; } | 103 Axis axis() const { return m_axis; } |
104 const NodeTest& nodeTest() const { return *m_nodeTest; } | 104 const NodeTest& nodeTest() const { return *m_nodeTest; } |
105 | 105 |
106 private: | 106 private: |
(...skipping 10 matching lines...) Expand all Loading... |
117 HeapVector<Member<Predicate>> m_predicates; | 117 HeapVector<Member<Predicate>> m_predicates; |
118 }; | 118 }; |
119 | 119 |
120 bool optimizeStepPair(Step*, Step*); | 120 bool optimizeStepPair(Step*, Step*); |
121 | 121 |
122 } // namespace XPath | 122 } // namespace XPath |
123 | 123 |
124 } // namespace blink | 124 } // namespace blink |
125 | 125 |
126 #endif // XPathStep_h | 126 #endif // XPathStep_h |
OLD | NEW |