1 : /* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 4 -*- */
2 : /* ***** BEGIN LICENSE BLOCK *****
3 : * Version: MPL 1.1/GPL 2.0/LGPL 2.1
4 : *
5 : * The contents of this file are subject to the Mozilla Public License Version
6 : * 1.1 (the "License"); you may not use this file except in compliance with
7 : * the License. You may obtain a copy of the License at
8 : * http://www.mozilla.org/MPL/
9 : *
10 : * Software distributed under the License is distributed on an "AS IS" basis,
11 : * WITHOUT WARRANTY OF ANY KIND, either express or implied. See the License
12 : * for the specific language governing rights and limitations under the
13 : * License.
14 : *
15 : * The Original Code is TransforMiiX XSLT processor code.
16 : *
17 : * The Initial Developer of the Original Code is
18 : * The MITRE Corporation.
19 : * Portions created by the Initial Developer are Copyright (C) 1999
20 : * the Initial Developer. All Rights Reserved.
21 : *
22 : * Contributor(s):
23 : * Keith Visco <kvisco@ziplink.net> (Original Author)
24 : *
25 : * Alternatively, the contents of this file may be used under the terms of
26 : * either the GNU General Public License Version 2 or later (the "GPL"), or
27 : * the GNU Lesser General Public License Version 2.1 or later (the "LGPL"),
28 : * in which case the provisions of the GPL or the LGPL are applicable instead
29 : * of those above. If you wish to allow use of your version of this file only
30 : * under the terms of either the GPL or the LGPL, and not to allow others to
31 : * use your version of this file under the terms of the MPL, indicate your
32 : * decision by deleting the provisions above and replace them with the notice
33 : * and other provisions required by the GPL or the LGPL. If you do not delete
34 : * the provisions above, a recipient may use your version of this file under
35 : * the terms of any one of the MPL, the GPL or the LGPL.
36 : *
37 : * ***** END LICENSE BLOCK ***** */
38 :
39 : #include "txExpr.h"
40 : #include "txNodeSet.h"
41 : #include "txNodeSetContext.h"
42 :
43 : /*
44 : * Represents an ordered list of Predicates,
45 : * for use with Step and Filter Expressions
46 : */
47 :
48 : nsresult
49 0 : PredicateList::evaluatePredicates(txNodeSet* nodes,
50 : txIMatchContext* aContext)
51 : {
52 0 : NS_ASSERTION(nodes, "called evaluatePredicates with NULL NodeSet");
53 0 : nsresult rv = NS_OK;
54 :
55 0 : PRUint32 i, len = mPredicates.Length();
56 0 : for (i = 0; i < len && !nodes->isEmpty(); ++i) {
57 0 : txNodeSetContext predContext(nodes, aContext);
58 : /*
59 : * add nodes to newNodes that match the expression
60 : * or, if the result is a number, add the node with the right
61 : * position
62 : */
63 0 : PRInt32 index = 0;
64 0 : while (predContext.hasNext()) {
65 0 : predContext.next();
66 0 : nsRefPtr<txAExprResult> exprResult;
67 0 : rv = mPredicates[i]->evaluate(&predContext,
68 0 : getter_AddRefs(exprResult));
69 0 : NS_ENSURE_SUCCESS(rv, rv);
70 :
71 : // handle default, [position() == numberValue()]
72 0 : if (exprResult->getResultType() == txAExprResult::NUMBER) {
73 0 : if ((double)predContext.position() == exprResult->numberValue()) {
74 0 : nodes->mark(index);
75 : }
76 : }
77 0 : else if (exprResult->booleanValue()) {
78 0 : nodes->mark(index);
79 : }
80 0 : ++index;
81 : }
82 : // sweep the non-marked nodes
83 0 : nodes->sweep();
84 : }
85 :
86 0 : return NS_OK;
87 : }
88 :
89 : bool
90 0 : PredicateList::isSensitiveTo(Expr::ContextSensitivity aContext)
91 : {
92 : // We're creating a new node/nodeset so we can ignore those bits.
93 : Expr::ContextSensitivity context =
94 0 : aContext & ~(Expr::NODE_CONTEXT | Expr::NODESET_CONTEXT);
95 0 : if (context == Expr::NO_CONTEXT) {
96 0 : return false;
97 : }
98 :
99 0 : PRUint32 i, len = mPredicates.Length();
100 0 : for (i = 0; i < len; ++i) {
101 0 : if (mPredicates[i]->isSensitiveTo(context)) {
102 0 : return true;
103 : }
104 : }
105 :
106 0 : return false;
107 : }
108 :
109 : #ifdef TX_TO_STRING
110 0 : void PredicateList::toString(nsAString& dest)
111 : {
112 0 : for (PRUint32 i = 0; i < mPredicates.Length(); ++i) {
113 0 : dest.Append(PRUnichar('['));
114 0 : mPredicates[i]->toString(dest);
115 0 : dest.Append(PRUnichar(']'));
116 : }
117 0 : }
118 : #endif
|