1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
|
/*
* Copyright (C) 2005 Frerich Raabe <raabe@kde.org>
* Copyright (C) 2006, 2009 Apple Inc.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef XPathPath_h
#define XPathPath_h
#include "core/xml/XPathExpressionNode.h"
#include "core/xml/XPathNodeSet.h"
namespace WebCore {
namespace XPath {
class Predicate;
class Step;
class Filter FINAL : public Expression {
public:
Filter(PassOwnPtrWillBeRawPtr<Expression>, WillBeHeapVector<OwnPtrWillBeMember<Predicate> >&);
virtual ~Filter();
virtual void trace(Visitor*) OVERRIDE;
virtual Value evaluate() const OVERRIDE;
private:
virtual Value::Type resultType() const OVERRIDE { return Value::NodeSetValue; }
OwnPtrWillBeMember<Expression> m_expr;
WillBeHeapVector<OwnPtrWillBeMember<Predicate> > m_predicates;
};
class LocationPath FINAL : public Expression {
public:
LocationPath();
virtual ~LocationPath();
virtual void trace(Visitor*) OVERRIDE;
virtual Value evaluate() const OVERRIDE;
void setAbsolute(bool value) { m_absolute = value; setIsContextNodeSensitive(!m_absolute); }
void evaluate(NodeSet&) const; // nodes is an input/output parameter
void appendStep(Step*);
void insertFirstStep(Step*);
private:
virtual Value::Type resultType() const OVERRIDE { return Value::NodeSetValue; }
WillBeHeapVector<RawPtrWillBeMember<Step> > m_steps;
bool m_absolute;
};
class Path FINAL : public Expression {
public:
Path(Expression*, LocationPath*);
virtual ~Path();
virtual void trace(Visitor*) OVERRIDE;
virtual Value evaluate() const OVERRIDE;
private:
virtual Value::Type resultType() const OVERRIDE { return Value::NodeSetValue; }
OwnPtrWillBeMember<Expression> m_filter;
OwnPtrWillBeMember<LocationPath> m_path;
};
}
}
#endif // XPathPath_h
|