1/* 2 * Copyright (C) 2005 Frerich Raabe <raabe@kde.org> 3 * Copyright (C) 2006, 2009 Apple Inc. 4 * 5 * Redistribution and use in source and binary forms, with or without 6 * modification, are permitted provided that the following conditions 7 * are met: 8 * 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. 14 * 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. 25 */ 26 27#ifndef XPathPath_h 28#define XPathPath_h 29 30#include "core/xml/XPathExpressionNode.h" 31#include "core/xml/XPathNodeSet.h" 32 33namespace blink { 34 35namespace XPath { 36 37class Predicate; 38class Step; 39 40class Filter FINAL : public Expression { 41public: 42 Filter(PassOwnPtrWillBeRawPtr<Expression>, WillBeHeapVector<OwnPtrWillBeMember<Predicate> >&); 43 virtual ~Filter(); 44 virtual void trace(Visitor*) OVERRIDE; 45 46 virtual Value evaluate(EvaluationContext&) const OVERRIDE; 47 48private: 49 virtual Value::Type resultType() const OVERRIDE { return Value::NodeSetValue; } 50 51 OwnPtrWillBeMember<Expression> m_expr; 52 WillBeHeapVector<OwnPtrWillBeMember<Predicate> > m_predicates; 53}; 54 55class LocationPath FINAL : public Expression { 56public: 57 LocationPath(); 58 virtual ~LocationPath(); 59 virtual void trace(Visitor*) OVERRIDE; 60 61 virtual Value evaluate(EvaluationContext&) const OVERRIDE; 62 void setAbsolute(bool value) { m_absolute = value; setIsContextNodeSensitive(!m_absolute); } 63 void evaluate(EvaluationContext&, NodeSet&) const; // nodes is an input/output parameter 64 void appendStep(Step*); 65 void insertFirstStep(Step*); 66 67private: 68 virtual Value::Type resultType() const OVERRIDE { return Value::NodeSetValue; } 69 70 WillBeHeapVector<RawPtrWillBeMember<Step> > m_steps; 71 bool m_absolute; 72}; 73 74class Path FINAL : public Expression { 75public: 76 Path(Expression*, LocationPath*); 77 virtual ~Path(); 78 virtual void trace(Visitor*) OVERRIDE; 79 80 virtual Value evaluate(EvaluationContext&) const OVERRIDE; 81 82private: 83 virtual Value::Type resultType() const OVERRIDE { return Value::NodeSetValue; } 84 85 OwnPtrWillBeMember<Expression> m_filter; 86 OwnPtrWillBeMember<LocationPath> m_path; 87}; 88 89} 90 91} 92#endif // XPathPath_h 93