blob: b544c5a0f7df418e5659b4bb3830ce5872bedf9a [file] [log] [blame]
<HTML>
<BODY BGCOLOR="white">
<PRE>
<FONT color="green">001</FONT> /*<a name="line.1"></a>
<FONT color="green">002</FONT> * Licensed to the Apache Software Foundation (ASF) under one<a name="line.2"></a>
<FONT color="green">003</FONT> * or more contributor license agreements. See the NOTICE file<a name="line.3"></a>
<FONT color="green">004</FONT> * distributed with this work for additional information<a name="line.4"></a>
<FONT color="green">005</FONT> * regarding copyright ownership. The ASF licenses this file<a name="line.5"></a>
<FONT color="green">006</FONT> * to you under the Apache License, Version 2.0 (the "License");<a name="line.6"></a>
<FONT color="green">007</FONT> * you may not use this file except in compliance with the License.<a name="line.7"></a>
<FONT color="green">008</FONT> * You may obtain a copy of the License at<a name="line.8"></a>
<FONT color="green">009</FONT> *<a name="line.9"></a>
<FONT color="green">010</FONT> * http://www.apache.org/licenses/LICENSE-2.0<a name="line.10"></a>
<FONT color="green">011</FONT> *<a name="line.11"></a>
<FONT color="green">012</FONT> * Unless required by applicable law or agreed to in writing, software<a name="line.12"></a>
<FONT color="green">013</FONT> * distributed under the License is distributed on an "AS IS" BASIS,<a name="line.13"></a>
<FONT color="green">014</FONT> * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.<a name="line.14"></a>
<FONT color="green">015</FONT> * See the License for the specific language governing permissions and<a name="line.15"></a>
<FONT color="green">016</FONT> * limitations under the License.<a name="line.16"></a>
<FONT color="green">017</FONT> */<a name="line.17"></a>
<FONT color="green">018</FONT> /*<a name="line.18"></a>
<FONT color="green">019</FONT> * $Id: MatchPatternIterator.java 469314 2006-10-30 23:31:59Z minchau $<a name="line.19"></a>
<FONT color="green">020</FONT> */<a name="line.20"></a>
<FONT color="green">021</FONT> package org.apache.xpath.axes;<a name="line.21"></a>
<FONT color="green">022</FONT> <a name="line.22"></a>
<FONT color="green">023</FONT> import org.apache.xml.dtm.Axis;<a name="line.23"></a>
<FONT color="green">024</FONT> import org.apache.xml.dtm.DTM;<a name="line.24"></a>
<FONT color="green">025</FONT> import org.apache.xml.dtm.DTMAxisTraverser;<a name="line.25"></a>
<FONT color="green">026</FONT> import org.apache.xml.dtm.DTMIterator;<a name="line.26"></a>
<FONT color="green">027</FONT> import org.apache.xpath.XPathContext;<a name="line.27"></a>
<FONT color="green">028</FONT> import org.apache.xpath.compiler.Compiler;<a name="line.28"></a>
<FONT color="green">029</FONT> import org.apache.xpath.compiler.OpMap;<a name="line.29"></a>
<FONT color="green">030</FONT> import org.apache.xpath.objects.XObject;<a name="line.30"></a>
<FONT color="green">031</FONT> import org.apache.xpath.patterns.NodeTest;<a name="line.31"></a>
<FONT color="green">032</FONT> import org.apache.xpath.patterns.StepPattern;<a name="line.32"></a>
<FONT color="green">033</FONT> <a name="line.33"></a>
<FONT color="green">034</FONT> /**<a name="line.34"></a>
<FONT color="green">035</FONT> * This class treats a <a name="line.35"></a>
<FONT color="green">036</FONT> * &lt;a href="http://www.w3.org/TR/xpath#location-paths"&gt;LocationPath&lt;/a&gt; as a <a name="line.36"></a>
<FONT color="green">037</FONT> * filtered iteration over the tree, evaluating each node in a super axis <a name="line.37"></a>
<FONT color="green">038</FONT> * traversal against the LocationPath interpreted as a match pattern. This <a name="line.38"></a>
<FONT color="green">039</FONT> * class is useful to find nodes in document order that are complex paths <a name="line.39"></a>
<FONT color="green">040</FONT> * whose steps probably criss-cross each other.<a name="line.40"></a>
<FONT color="green">041</FONT> */<a name="line.41"></a>
<FONT color="green">042</FONT> public class MatchPatternIterator extends LocPathIterator<a name="line.42"></a>
<FONT color="green">043</FONT> {<a name="line.43"></a>
<FONT color="green">044</FONT> static final long serialVersionUID = -5201153767396296474L;<a name="line.44"></a>
<FONT color="green">045</FONT> <a name="line.45"></a>
<FONT color="green">046</FONT> /** This is the select pattern, translated into a match pattern. */<a name="line.46"></a>
<FONT color="green">047</FONT> protected StepPattern m_pattern;<a name="line.47"></a>
<FONT color="green">048</FONT> <a name="line.48"></a>
<FONT color="green">049</FONT> /** The traversal axis from where the nodes will be filtered. */<a name="line.49"></a>
<FONT color="green">050</FONT> protected int m_superAxis = -1;<a name="line.50"></a>
<FONT color="green">051</FONT> <a name="line.51"></a>
<FONT color="green">052</FONT> /** The DTM inner traversal class, that corresponds to the super axis. */<a name="line.52"></a>
<FONT color="green">053</FONT> protected DTMAxisTraverser m_traverser;<a name="line.53"></a>
<FONT color="green">054</FONT> <a name="line.54"></a>
<FONT color="green">055</FONT> /** DEBUG flag for diagnostic dumps. */<a name="line.55"></a>
<FONT color="green">056</FONT> private static final boolean DEBUG = false;<a name="line.56"></a>
<FONT color="green">057</FONT> <a name="line.57"></a>
<FONT color="green">058</FONT> // protected int m_nsElemBase = DTM.NULL;<a name="line.58"></a>
<FONT color="green">059</FONT> <a name="line.59"></a>
<FONT color="green">060</FONT> /**<a name="line.60"></a>
<FONT color="green">061</FONT> * Create a LocPathIterator object, including creation<a name="line.61"></a>
<FONT color="green">062</FONT> * of step walkers from the opcode list, and call back<a name="line.62"></a>
<FONT color="green">063</FONT> * into the Compiler to create predicate expressions.<a name="line.63"></a>
<FONT color="green">064</FONT> *<a name="line.64"></a>
<FONT color="green">065</FONT> * @param compiler The Compiler which is creating<a name="line.65"></a>
<FONT color="green">066</FONT> * this expression.<a name="line.66"></a>
<FONT color="green">067</FONT> * @param opPos The position of this iterator in the<a name="line.67"></a>
<FONT color="green">068</FONT> * opcode list from the compiler.<a name="line.68"></a>
<FONT color="green">069</FONT> * @param analysis Analysis bits that give general information about the <a name="line.69"></a>
<FONT color="green">070</FONT> * LocationPath.<a name="line.70"></a>
<FONT color="green">071</FONT> *<a name="line.71"></a>
<FONT color="green">072</FONT> * @throws javax.xml.transform.TransformerException<a name="line.72"></a>
<FONT color="green">073</FONT> */<a name="line.73"></a>
<FONT color="green">074</FONT> MatchPatternIterator(Compiler compiler, int opPos, int analysis)<a name="line.74"></a>
<FONT color="green">075</FONT> throws javax.xml.transform.TransformerException<a name="line.75"></a>
<FONT color="green">076</FONT> {<a name="line.76"></a>
<FONT color="green">077</FONT> <a name="line.77"></a>
<FONT color="green">078</FONT> super(compiler, opPos, analysis, false);<a name="line.78"></a>
<FONT color="green">079</FONT> <a name="line.79"></a>
<FONT color="green">080</FONT> int firstStepPos = OpMap.getFirstChildPos(opPos);<a name="line.80"></a>
<FONT color="green">081</FONT> <a name="line.81"></a>
<FONT color="green">082</FONT> m_pattern = WalkerFactory.loadSteps(this, compiler, firstStepPos, 0); <a name="line.82"></a>
<FONT color="green">083</FONT> <a name="line.83"></a>
<FONT color="green">084</FONT> boolean fromRoot = false;<a name="line.84"></a>
<FONT color="green">085</FONT> boolean walkBack = false;<a name="line.85"></a>
<FONT color="green">086</FONT> boolean walkDescendants = false;<a name="line.86"></a>
<FONT color="green">087</FONT> boolean walkAttributes = false;<a name="line.87"></a>
<FONT color="green">088</FONT> <a name="line.88"></a>
<FONT color="green">089</FONT> if (0 != (analysis &amp; (WalkerFactory.BIT_ROOT | <a name="line.89"></a>
<FONT color="green">090</FONT> WalkerFactory.BIT_ANY_DESCENDANT_FROM_ROOT)))<a name="line.90"></a>
<FONT color="green">091</FONT> fromRoot = true;<a name="line.91"></a>
<FONT color="green">092</FONT> <a name="line.92"></a>
<FONT color="green">093</FONT> if (0 != (analysis<a name="line.93"></a>
<FONT color="green">094</FONT> &amp; (WalkerFactory.BIT_ANCESTOR<a name="line.94"></a>
<FONT color="green">095</FONT> | WalkerFactory.BIT_ANCESTOR_OR_SELF<a name="line.95"></a>
<FONT color="green">096</FONT> | WalkerFactory.BIT_PRECEDING<a name="line.96"></a>
<FONT color="green">097</FONT> | WalkerFactory.BIT_PRECEDING_SIBLING <a name="line.97"></a>
<FONT color="green">098</FONT> | WalkerFactory.BIT_FOLLOWING<a name="line.98"></a>
<FONT color="green">099</FONT> | WalkerFactory.BIT_FOLLOWING_SIBLING<a name="line.99"></a>
<FONT color="green">100</FONT> | WalkerFactory.BIT_PARENT | WalkerFactory.BIT_FILTER)))<a name="line.100"></a>
<FONT color="green">101</FONT> walkBack = true;<a name="line.101"></a>
<FONT color="green">102</FONT> <a name="line.102"></a>
<FONT color="green">103</FONT> if (0 != (analysis<a name="line.103"></a>
<FONT color="green">104</FONT> &amp; (WalkerFactory.BIT_DESCENDANT_OR_SELF<a name="line.104"></a>
<FONT color="green">105</FONT> | WalkerFactory.BIT_DESCENDANT<a name="line.105"></a>
<FONT color="green">106</FONT> | WalkerFactory.BIT_CHILD)))<a name="line.106"></a>
<FONT color="green">107</FONT> walkDescendants = true;<a name="line.107"></a>
<FONT color="green">108</FONT> <a name="line.108"></a>
<FONT color="green">109</FONT> if (0 != (analysis<a name="line.109"></a>
<FONT color="green">110</FONT> &amp; (WalkerFactory.BIT_ATTRIBUTE | WalkerFactory.BIT_NAMESPACE)))<a name="line.110"></a>
<FONT color="green">111</FONT> walkAttributes = true;<a name="line.111"></a>
<FONT color="green">112</FONT> <a name="line.112"></a>
<FONT color="green">113</FONT> if(false || DEBUG)<a name="line.113"></a>
<FONT color="green">114</FONT> {<a name="line.114"></a>
<FONT color="green">115</FONT> System.out.print("analysis: "+Integer.toBinaryString(analysis));<a name="line.115"></a>
<FONT color="green">116</FONT> System.out.println(", "+WalkerFactory.getAnalysisString(analysis));<a name="line.116"></a>
<FONT color="green">117</FONT> }<a name="line.117"></a>
<FONT color="green">118</FONT> <a name="line.118"></a>
<FONT color="green">119</FONT> if(fromRoot || walkBack)<a name="line.119"></a>
<FONT color="green">120</FONT> {<a name="line.120"></a>
<FONT color="green">121</FONT> if(walkAttributes)<a name="line.121"></a>
<FONT color="green">122</FONT> {<a name="line.122"></a>
<FONT color="green">123</FONT> m_superAxis = Axis.ALL;<a name="line.123"></a>
<FONT color="green">124</FONT> }<a name="line.124"></a>
<FONT color="green">125</FONT> else<a name="line.125"></a>
<FONT color="green">126</FONT> {<a name="line.126"></a>
<FONT color="green">127</FONT> m_superAxis = Axis.DESCENDANTSFROMROOT;<a name="line.127"></a>
<FONT color="green">128</FONT> }<a name="line.128"></a>
<FONT color="green">129</FONT> }<a name="line.129"></a>
<FONT color="green">130</FONT> else if(walkDescendants)<a name="line.130"></a>
<FONT color="green">131</FONT> {<a name="line.131"></a>
<FONT color="green">132</FONT> if(walkAttributes)<a name="line.132"></a>
<FONT color="green">133</FONT> {<a name="line.133"></a>
<FONT color="green">134</FONT> m_superAxis = Axis.ALLFROMNODE;<a name="line.134"></a>
<FONT color="green">135</FONT> }<a name="line.135"></a>
<FONT color="green">136</FONT> else<a name="line.136"></a>
<FONT color="green">137</FONT> {<a name="line.137"></a>
<FONT color="green">138</FONT> m_superAxis = Axis.DESCENDANTORSELF;<a name="line.138"></a>
<FONT color="green">139</FONT> }<a name="line.139"></a>
<FONT color="green">140</FONT> }<a name="line.140"></a>
<FONT color="green">141</FONT> else<a name="line.141"></a>
<FONT color="green">142</FONT> {<a name="line.142"></a>
<FONT color="green">143</FONT> m_superAxis = Axis.ALL;<a name="line.143"></a>
<FONT color="green">144</FONT> }<a name="line.144"></a>
<FONT color="green">145</FONT> if(false || DEBUG)<a name="line.145"></a>
<FONT color="green">146</FONT> {<a name="line.146"></a>
<FONT color="green">147</FONT> System.out.println("axis: "+Axis.getNames(m_superAxis));<a name="line.147"></a>
<FONT color="green">148</FONT> }<a name="line.148"></a>
<FONT color="green">149</FONT> <a name="line.149"></a>
<FONT color="green">150</FONT> }<a name="line.150"></a>
<FONT color="green">151</FONT> <a name="line.151"></a>
<FONT color="green">152</FONT> <a name="line.152"></a>
<FONT color="green">153</FONT> /**<a name="line.153"></a>
<FONT color="green">154</FONT> * Initialize the context values for this expression<a name="line.154"></a>
<FONT color="green">155</FONT> * after it is cloned.<a name="line.155"></a>
<FONT color="green">156</FONT> *<a name="line.156"></a>
<FONT color="green">157</FONT> * @param context The XPath runtime context for this<a name="line.157"></a>
<FONT color="green">158</FONT> * transformation.<a name="line.158"></a>
<FONT color="green">159</FONT> */<a name="line.159"></a>
<FONT color="green">160</FONT> public void setRoot(int context, Object environment)<a name="line.160"></a>
<FONT color="green">161</FONT> {<a name="line.161"></a>
<FONT color="green">162</FONT> super.setRoot(context, environment);<a name="line.162"></a>
<FONT color="green">163</FONT> m_traverser = m_cdtm.getAxisTraverser(m_superAxis);<a name="line.163"></a>
<FONT color="green">164</FONT> }<a name="line.164"></a>
<FONT color="green">165</FONT> <a name="line.165"></a>
<FONT color="green">166</FONT> /**<a name="line.166"></a>
<FONT color="green">167</FONT> * Detaches the iterator from the set which it iterated over, releasing<a name="line.167"></a>
<FONT color="green">168</FONT> * any computational resources and placing the iterator in the INVALID<a name="line.168"></a>
<FONT color="green">169</FONT> * state. After&lt;code&gt;detach&lt;/code&gt; has been invoked, calls to<a name="line.169"></a>
<FONT color="green">170</FONT> * &lt;code&gt;nextNode&lt;/code&gt; or&lt;code&gt;previousNode&lt;/code&gt; will raise the<a name="line.170"></a>
<FONT color="green">171</FONT> * exception INVALID_STATE_ERR.<a name="line.171"></a>
<FONT color="green">172</FONT> */<a name="line.172"></a>
<FONT color="green">173</FONT> public void detach()<a name="line.173"></a>
<FONT color="green">174</FONT> { <a name="line.174"></a>
<FONT color="green">175</FONT> if(m_allowDetach)<a name="line.175"></a>
<FONT color="green">176</FONT> {<a name="line.176"></a>
<FONT color="green">177</FONT> m_traverser = null;<a name="line.177"></a>
<FONT color="green">178</FONT> <a name="line.178"></a>
<FONT color="green">179</FONT> // Always call the superclass detach last!<a name="line.179"></a>
<FONT color="green">180</FONT> super.detach();<a name="line.180"></a>
<FONT color="green">181</FONT> }<a name="line.181"></a>
<FONT color="green">182</FONT> }<a name="line.182"></a>
<FONT color="green">183</FONT> <a name="line.183"></a>
<FONT color="green">184</FONT> /**<a name="line.184"></a>
<FONT color="green">185</FONT> * Get the next node via getNextXXX. Bottlenecked for derived class override.<a name="line.185"></a>
<FONT color="green">186</FONT> * @return The next node on the axis, or DTM.NULL.<a name="line.186"></a>
<FONT color="green">187</FONT> */<a name="line.187"></a>
<FONT color="green">188</FONT> protected int getNextNode()<a name="line.188"></a>
<FONT color="green">189</FONT> {<a name="line.189"></a>
<FONT color="green">190</FONT> m_lastFetched = (DTM.NULL == m_lastFetched)<a name="line.190"></a>
<FONT color="green">191</FONT> ? m_traverser.first(m_context)<a name="line.191"></a>
<FONT color="green">192</FONT> : m_traverser.next(m_context, m_lastFetched);<a name="line.192"></a>
<FONT color="green">193</FONT> return m_lastFetched;<a name="line.193"></a>
<FONT color="green">194</FONT> }<a name="line.194"></a>
<FONT color="green">195</FONT> <a name="line.195"></a>
<FONT color="green">196</FONT> /**<a name="line.196"></a>
<FONT color="green">197</FONT> * Returns the next node in the set and advances the position of the<a name="line.197"></a>
<FONT color="green">198</FONT> * iterator in the set. After a NodeIterator is created, the first call<a name="line.198"></a>
<FONT color="green">199</FONT> * to nextNode() returns the first node in the set.<a name="line.199"></a>
<FONT color="green">200</FONT> * @return The next &lt;code&gt;Node&lt;/code&gt; in the set being iterated over, or<a name="line.200"></a>
<FONT color="green">201</FONT> * &lt;code&gt;null&lt;/code&gt; if there are no more members in that set.<a name="line.201"></a>
<FONT color="green">202</FONT> */<a name="line.202"></a>
<FONT color="green">203</FONT> public int nextNode()<a name="line.203"></a>
<FONT color="green">204</FONT> { <a name="line.204"></a>
<FONT color="green">205</FONT> if(m_foundLast)<a name="line.205"></a>
<FONT color="green">206</FONT> return DTM.NULL;<a name="line.206"></a>
<FONT color="green">207</FONT> <a name="line.207"></a>
<FONT color="green">208</FONT> int next;<a name="line.208"></a>
<FONT color="green">209</FONT> <a name="line.209"></a>
<FONT color="green">210</FONT> org.apache.xpath.VariableStack vars;<a name="line.210"></a>
<FONT color="green">211</FONT> int savedStart;<a name="line.211"></a>
<FONT color="green">212</FONT> if (-1 != m_stackFrame)<a name="line.212"></a>
<FONT color="green">213</FONT> {<a name="line.213"></a>
<FONT color="green">214</FONT> vars = m_execContext.getVarStack();<a name="line.214"></a>
<FONT color="green">215</FONT> <a name="line.215"></a>
<FONT color="green">216</FONT> // These three statements need to be combined into one operation.<a name="line.216"></a>
<FONT color="green">217</FONT> savedStart = vars.getStackFrame();<a name="line.217"></a>
<FONT color="green">218</FONT> <a name="line.218"></a>
<FONT color="green">219</FONT> vars.setStackFrame(m_stackFrame);<a name="line.219"></a>
<FONT color="green">220</FONT> }<a name="line.220"></a>
<FONT color="green">221</FONT> else<a name="line.221"></a>
<FONT color="green">222</FONT> {<a name="line.222"></a>
<FONT color="green">223</FONT> // Yuck. Just to shut up the compiler!<a name="line.223"></a>
<FONT color="green">224</FONT> vars = null;<a name="line.224"></a>
<FONT color="green">225</FONT> savedStart = 0;<a name="line.225"></a>
<FONT color="green">226</FONT> }<a name="line.226"></a>
<FONT color="green">227</FONT> <a name="line.227"></a>
<FONT color="green">228</FONT> try<a name="line.228"></a>
<FONT color="green">229</FONT> {<a name="line.229"></a>
<FONT color="green">230</FONT> if(DEBUG)<a name="line.230"></a>
<FONT color="green">231</FONT> System.out.println("m_pattern"+m_pattern.toString());<a name="line.231"></a>
<FONT color="green">232</FONT> <a name="line.232"></a>
<FONT color="green">233</FONT> do<a name="line.233"></a>
<FONT color="green">234</FONT> {<a name="line.234"></a>
<FONT color="green">235</FONT> next = getNextNode();<a name="line.235"></a>
<FONT color="green">236</FONT> <a name="line.236"></a>
<FONT color="green">237</FONT> if (DTM.NULL != next)<a name="line.237"></a>
<FONT color="green">238</FONT> {<a name="line.238"></a>
<FONT color="green">239</FONT> if(DTMIterator.FILTER_ACCEPT == acceptNode(next, m_execContext))<a name="line.239"></a>
<FONT color="green">240</FONT> break;<a name="line.240"></a>
<FONT color="green">241</FONT> else<a name="line.241"></a>
<FONT color="green">242</FONT> continue;<a name="line.242"></a>
<FONT color="green">243</FONT> }<a name="line.243"></a>
<FONT color="green">244</FONT> else<a name="line.244"></a>
<FONT color="green">245</FONT> break;<a name="line.245"></a>
<FONT color="green">246</FONT> }<a name="line.246"></a>
<FONT color="green">247</FONT> while (next != DTM.NULL);<a name="line.247"></a>
<FONT color="green">248</FONT> <a name="line.248"></a>
<FONT color="green">249</FONT> if (DTM.NULL != next)<a name="line.249"></a>
<FONT color="green">250</FONT> {<a name="line.250"></a>
<FONT color="green">251</FONT> if(DEBUG)<a name="line.251"></a>
<FONT color="green">252</FONT> {<a name="line.252"></a>
<FONT color="green">253</FONT> System.out.println("next: "+next);<a name="line.253"></a>
<FONT color="green">254</FONT> System.out.println("name: "+m_cdtm.getNodeName(next));<a name="line.254"></a>
<FONT color="green">255</FONT> }<a name="line.255"></a>
<FONT color="green">256</FONT> incrementCurrentPos();<a name="line.256"></a>
<FONT color="green">257</FONT> <a name="line.257"></a>
<FONT color="green">258</FONT> return next;<a name="line.258"></a>
<FONT color="green">259</FONT> }<a name="line.259"></a>
<FONT color="green">260</FONT> else<a name="line.260"></a>
<FONT color="green">261</FONT> {<a name="line.261"></a>
<FONT color="green">262</FONT> m_foundLast = true;<a name="line.262"></a>
<FONT color="green">263</FONT> <a name="line.263"></a>
<FONT color="green">264</FONT> return DTM.NULL;<a name="line.264"></a>
<FONT color="green">265</FONT> }<a name="line.265"></a>
<FONT color="green">266</FONT> }<a name="line.266"></a>
<FONT color="green">267</FONT> finally<a name="line.267"></a>
<FONT color="green">268</FONT> {<a name="line.268"></a>
<FONT color="green">269</FONT> if (-1 != m_stackFrame)<a name="line.269"></a>
<FONT color="green">270</FONT> {<a name="line.270"></a>
<FONT color="green">271</FONT> // These two statements need to be combined into one operation.<a name="line.271"></a>
<FONT color="green">272</FONT> vars.setStackFrame(savedStart);<a name="line.272"></a>
<FONT color="green">273</FONT> }<a name="line.273"></a>
<FONT color="green">274</FONT> }<a name="line.274"></a>
<FONT color="green">275</FONT> <a name="line.275"></a>
<FONT color="green">276</FONT> }<a name="line.276"></a>
<FONT color="green">277</FONT> <a name="line.277"></a>
<FONT color="green">278</FONT> /**<a name="line.278"></a>
<FONT color="green">279</FONT> * Test whether a specified node is visible in the logical view of a<a name="line.279"></a>
<FONT color="green">280</FONT> * TreeWalker or NodeIterator. This function will be called by the<a name="line.280"></a>
<FONT color="green">281</FONT> * implementation of TreeWalker and NodeIterator; it is not intended to<a name="line.281"></a>
<FONT color="green">282</FONT> * be called directly from user code.<a name="line.282"></a>
<FONT color="green">283</FONT> * @param n The node to check to see if it passes the filter or not.<a name="line.283"></a>
<FONT color="green">284</FONT> * @return a constant to determine whether the node is accepted,<a name="line.284"></a>
<FONT color="green">285</FONT> * rejected, or skipped, as defined above .<a name="line.285"></a>
<FONT color="green">286</FONT> */<a name="line.286"></a>
<FONT color="green">287</FONT> public short acceptNode(int n, XPathContext xctxt)<a name="line.287"></a>
<FONT color="green">288</FONT> {<a name="line.288"></a>
<FONT color="green">289</FONT> <a name="line.289"></a>
<FONT color="green">290</FONT> try<a name="line.290"></a>
<FONT color="green">291</FONT> {<a name="line.291"></a>
<FONT color="green">292</FONT> xctxt.pushCurrentNode(n);<a name="line.292"></a>
<FONT color="green">293</FONT> xctxt.pushIteratorRoot(m_context);<a name="line.293"></a>
<FONT color="green">294</FONT> if(DEBUG)<a name="line.294"></a>
<FONT color="green">295</FONT> {<a name="line.295"></a>
<FONT color="green">296</FONT> System.out.println("traverser: "+m_traverser);<a name="line.296"></a>
<FONT color="green">297</FONT> System.out.print("node: "+n);<a name="line.297"></a>
<FONT color="green">298</FONT> System.out.println(", "+m_cdtm.getNodeName(n));<a name="line.298"></a>
<FONT color="green">299</FONT> // if(m_cdtm.getNodeName(n).equals("near-east"))<a name="line.299"></a>
<FONT color="green">300</FONT> System.out.println("pattern: "+m_pattern.toString());<a name="line.300"></a>
<FONT color="green">301</FONT> m_pattern.debugWhatToShow(m_pattern.getWhatToShow());<a name="line.301"></a>
<FONT color="green">302</FONT> }<a name="line.302"></a>
<FONT color="green">303</FONT> <a name="line.303"></a>
<FONT color="green">304</FONT> XObject score = m_pattern.execute(xctxt);<a name="line.304"></a>
<FONT color="green">305</FONT> <a name="line.305"></a>
<FONT color="green">306</FONT> if(DEBUG)<a name="line.306"></a>
<FONT color="green">307</FONT> {<a name="line.307"></a>
<FONT color="green">308</FONT> // System.out.println("analysis: "+Integer.toBinaryString(m_analysis));<a name="line.308"></a>
<FONT color="green">309</FONT> System.out.println("score: "+score);<a name="line.309"></a>
<FONT color="green">310</FONT> System.out.println("skip: "+(score == NodeTest.SCORE_NONE));<a name="line.310"></a>
<FONT color="green">311</FONT> }<a name="line.311"></a>
<FONT color="green">312</FONT> <a name="line.312"></a>
<FONT color="green">313</FONT> // System.out.println("\n::acceptNode - score: "+score.num()+"::");<a name="line.313"></a>
<FONT color="green">314</FONT> return (score == NodeTest.SCORE_NONE) ? DTMIterator.FILTER_SKIP <a name="line.314"></a>
<FONT color="green">315</FONT> : DTMIterator.FILTER_ACCEPT;<a name="line.315"></a>
<FONT color="green">316</FONT> }<a name="line.316"></a>
<FONT color="green">317</FONT> catch (javax.xml.transform.TransformerException se)<a name="line.317"></a>
<FONT color="green">318</FONT> {<a name="line.318"></a>
<FONT color="green">319</FONT> <a name="line.319"></a>
<FONT color="green">320</FONT> // TODO: Fix this.<a name="line.320"></a>
<FONT color="green">321</FONT> throw new RuntimeException(se.getMessage());<a name="line.321"></a>
<FONT color="green">322</FONT> }<a name="line.322"></a>
<FONT color="green">323</FONT> finally<a name="line.323"></a>
<FONT color="green">324</FONT> {<a name="line.324"></a>
<FONT color="green">325</FONT> xctxt.popCurrentNode();<a name="line.325"></a>
<FONT color="green">326</FONT> xctxt.popIteratorRoot();<a name="line.326"></a>
<FONT color="green">327</FONT> }<a name="line.327"></a>
<FONT color="green">328</FONT> <a name="line.328"></a>
<FONT color="green">329</FONT> }<a name="line.329"></a>
<FONT color="green">330</FONT> <a name="line.330"></a>
<FONT color="green">331</FONT> }<a name="line.331"></a>
</PRE>
</BODY>
</HTML>