| 1 | /* |
| 2 | * Copyright (C) 2005 Frerich Raabe <raabe@kde.org> |
| 3 | * Copyright (C) 2006, 2009, 2013 Apple Inc. All rights reserved. |
| 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 | #pragma once |
| 28 | |
| 29 | #include "XPathExpressionNode.h" |
| 30 | |
| 31 | namespace WebCore { |
| 32 | namespace XPath { |
| 33 | |
| 34 | class Step; |
| 35 | |
| 36 | class Filter final : public Expression { |
| 37 | public: |
| 38 | Filter(std::unique_ptr<Expression>, Vector<std::unique_ptr<Expression>> predicates); |
| 39 | |
| 40 | private: |
| 41 | Value evaluate() const override; |
| 42 | Value::Type resultType() const override { return Value::NodeSetValue; } |
| 43 | |
| 44 | std::unique_ptr<Expression> m_expression; |
| 45 | Vector<std::unique_ptr<Expression>> m_predicates; |
| 46 | }; |
| 47 | |
| 48 | class LocationPath final : public Expression { |
| 49 | public: |
| 50 | LocationPath(); |
| 51 | |
| 52 | void setAbsolute() { m_isAbsolute = true; setIsContextNodeSensitive(false); } |
| 53 | |
| 54 | void evaluate(NodeSet& nodes) const; // nodes is an input/output parameter |
| 55 | |
| 56 | void appendStep(std::unique_ptr<Step>); |
| 57 | void prependStep(std::unique_ptr<Step>); |
| 58 | |
| 59 | private: |
| 60 | Value evaluate() const override; |
| 61 | Value::Type resultType() const override { return Value::NodeSetValue; } |
| 62 | |
| 63 | Vector<std::unique_ptr<Step>> m_steps; |
| 64 | bool m_isAbsolute; |
| 65 | }; |
| 66 | |
| 67 | class Path final : public Expression { |
| 68 | public: |
| 69 | Path(std::unique_ptr<Expression> filter, std::unique_ptr<LocationPath>); |
| 70 | |
| 71 | private: |
| 72 | Value evaluate() const override; |
| 73 | Value::Type resultType() const override { return Value::NodeSetValue; } |
| 74 | |
| 75 | std::unique_ptr<Expression> m_filter; |
| 76 | std::unique_ptr<LocationPath> m_path; |
| 77 | }; |
| 78 | |
| 79 | } // namespace XPath |
| 80 | } // namespace WebCore |
| 81 | |