| <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: NodeSorter.java 468645 2006-10-28 06:57:24Z minchau $<a name="line.19"></a> |
| <FONT color="green">020</FONT> */<a name="line.20"></a> |
| <FONT color="green">021</FONT> package org.apache.xalan.transformer;<a name="line.21"></a> |
| <FONT color="green">022</FONT> <a name="line.22"></a> |
| <FONT color="green">023</FONT> import java.text.CollationKey;<a name="line.23"></a> |
| <FONT color="green">024</FONT> import java.util.Vector;<a name="line.24"></a> |
| <FONT color="green">025</FONT> <a name="line.25"></a> |
| <FONT color="green">026</FONT> import javax.xml.transform.TransformerException;<a name="line.26"></a> |
| <FONT color="green">027</FONT> <a name="line.27"></a> |
| <FONT color="green">028</FONT> import org.apache.xml.dtm.DTM;<a name="line.28"></a> |
| <FONT color="green">029</FONT> import org.apache.xml.dtm.DTMIterator;<a name="line.29"></a> |
| <FONT color="green">030</FONT> import org.apache.xpath.XPathContext;<a name="line.30"></a> |
| <FONT color="green">031</FONT> import org.apache.xpath.objects.XNodeSet;<a name="line.31"></a> |
| <FONT color="green">032</FONT> import org.apache.xpath.objects.XObject;<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 can sort vectors of DOM nodes according to a select pattern.<a name="line.35"></a> |
| <FONT color="green">036</FONT> * @xsl.usage internal<a name="line.36"></a> |
| <FONT color="green">037</FONT> */<a name="line.37"></a> |
| <FONT color="green">038</FONT> public class NodeSorter<a name="line.38"></a> |
| <FONT color="green">039</FONT> {<a name="line.39"></a> |
| <FONT color="green">040</FONT> <a name="line.40"></a> |
| <FONT color="green">041</FONT> /** Current XPath context */<a name="line.41"></a> |
| <FONT color="green">042</FONT> XPathContext m_execContext;<a name="line.42"></a> |
| <FONT color="green">043</FONT> <a name="line.43"></a> |
| <FONT color="green">044</FONT> /** Vector of NodeSortKeys */<a name="line.44"></a> |
| <FONT color="green">045</FONT> Vector m_keys; // vector of NodeSortKeys<a name="line.45"></a> |
| <FONT color="green">046</FONT> <a name="line.46"></a> |
| <FONT color="green">047</FONT> // /**<a name="line.47"></a> |
| <FONT color="green">048</FONT> // * TODO: Adjust this for locale.<a name="line.48"></a> |
| <FONT color="green">049</FONT> // */<a name="line.49"></a> |
| <FONT color="green">050</FONT> // NumberFormat m_formatter = NumberFormat.getNumberInstance();<a name="line.50"></a> |
| <FONT color="green">051</FONT> <a name="line.51"></a> |
| <FONT color="green">052</FONT> /**<a name="line.52"></a> |
| <FONT color="green">053</FONT> * Construct a NodeSorter, passing in the XSL TransformerFactory<a name="line.53"></a> |
| <FONT color="green">054</FONT> * so it can know how to get the node data according to<a name="line.54"></a> |
| <FONT color="green">055</FONT> * the proper whitespace rules.<a name="line.55"></a> |
| <FONT color="green">056</FONT> *<a name="line.56"></a> |
| <FONT color="green">057</FONT> * @param p Xpath context to use<a name="line.57"></a> |
| <FONT color="green">058</FONT> */<a name="line.58"></a> |
| <FONT color="green">059</FONT> public NodeSorter(XPathContext p)<a name="line.59"></a> |
| <FONT color="green">060</FONT> {<a name="line.60"></a> |
| <FONT color="green">061</FONT> m_execContext = p;<a name="line.61"></a> |
| <FONT color="green">062</FONT> }<a name="line.62"></a> |
| <FONT color="green">063</FONT> <a name="line.63"></a> |
| <FONT color="green">064</FONT> /**<a name="line.64"></a> |
| <FONT color="green">065</FONT> * Given a vector of nodes, sort each node according to<a name="line.65"></a> |
| <FONT color="green">066</FONT> * the criteria in the keys.<a name="line.66"></a> |
| <FONT color="green">067</FONT> * @param v an vector of Nodes.<a name="line.67"></a> |
| <FONT color="green">068</FONT> * @param keys a vector of NodeSortKeys.<a name="line.68"></a> |
| <FONT color="green">069</FONT> * @param support XPath context to use<a name="line.69"></a> |
| <FONT color="green">070</FONT> *<a name="line.70"></a> |
| <FONT color="green">071</FONT> * @throws javax.xml.transform.TransformerException<a name="line.71"></a> |
| <FONT color="green">072</FONT> */<a name="line.72"></a> |
| <FONT color="green">073</FONT> public void sort(DTMIterator v, Vector keys, XPathContext support)<a name="line.73"></a> |
| <FONT color="green">074</FONT> throws javax.xml.transform.TransformerException<a name="line.74"></a> |
| <FONT color="green">075</FONT> {<a name="line.75"></a> |
| <FONT color="green">076</FONT> <a name="line.76"></a> |
| <FONT color="green">077</FONT> m_keys = keys;<a name="line.77"></a> |
| <FONT color="green">078</FONT> <a name="line.78"></a> |
| <FONT color="green">079</FONT> // QuickSort2(v, 0, v.size() - 1 );<a name="line.79"></a> |
| <FONT color="green">080</FONT> int n = v.getLength();<a name="line.80"></a> |
| <FONT color="green">081</FONT> <a name="line.81"></a> |
| <FONT color="green">082</FONT> // %OPT% Change mergesort to just take a DTMIterator?<a name="line.82"></a> |
| <FONT color="green">083</FONT> // We would also have to adapt DTMIterator to have the function <a name="line.83"></a> |
| <FONT color="green">084</FONT> // of NodeCompareElem.<a name="line.84"></a> |
| <FONT color="green">085</FONT> <a name="line.85"></a> |
| <FONT color="green">086</FONT> // Create a vector of node compare elements<a name="line.86"></a> |
| <FONT color="green">087</FONT> // based on the input vector of nodes<a name="line.87"></a> |
| <FONT color="green">088</FONT> Vector nodes = new Vector();<a name="line.88"></a> |
| <FONT color="green">089</FONT> <a name="line.89"></a> |
| <FONT color="green">090</FONT> for (int i = 0; i < n; i++)<a name="line.90"></a> |
| <FONT color="green">091</FONT> {<a name="line.91"></a> |
| <FONT color="green">092</FONT> NodeCompareElem elem = new NodeCompareElem(v.item(i));<a name="line.92"></a> |
| <FONT color="green">093</FONT> <a name="line.93"></a> |
| <FONT color="green">094</FONT> nodes.addElement(elem);<a name="line.94"></a> |
| <FONT color="green">095</FONT> }<a name="line.95"></a> |
| <FONT color="green">096</FONT> <a name="line.96"></a> |
| <FONT color="green">097</FONT> Vector scratchVector = new Vector();<a name="line.97"></a> |
| <FONT color="green">098</FONT> <a name="line.98"></a> |
| <FONT color="green">099</FONT> mergesort(nodes, scratchVector, 0, n - 1, support);<a name="line.99"></a> |
| <FONT color="green">100</FONT> <a name="line.100"></a> |
| <FONT color="green">101</FONT> // return sorted vector of nodes<a name="line.101"></a> |
| <FONT color="green">102</FONT> for (int i = 0; i < n; i++)<a name="line.102"></a> |
| <FONT color="green">103</FONT> {<a name="line.103"></a> |
| <FONT color="green">104</FONT> v.setItem(((NodeCompareElem) nodes.elementAt(i)).m_node, i);<a name="line.104"></a> |
| <FONT color="green">105</FONT> }<a name="line.105"></a> |
| <FONT color="green">106</FONT> v.setCurrentPos(0);<a name="line.106"></a> |
| <FONT color="green">107</FONT> <a name="line.107"></a> |
| <FONT color="green">108</FONT> // old code...<a name="line.108"></a> |
| <FONT color="green">109</FONT> //NodeVector scratchVector = new NodeVector(n);<a name="line.109"></a> |
| <FONT color="green">110</FONT> //mergesort(v, scratchVector, 0, n - 1, support);<a name="line.110"></a> |
| <FONT color="green">111</FONT> }<a name="line.111"></a> |
| <FONT color="green">112</FONT> <a name="line.112"></a> |
| <FONT color="green">113</FONT> /**<a name="line.113"></a> |
| <FONT color="green">114</FONT> * Return the results of a compare of two nodes.<a name="line.114"></a> |
| <FONT color="green">115</FONT> * TODO: Optimize compare -- cache the getStringExpr results, key by m_selectPat + hash of node.<a name="line.115"></a> |
| <FONT color="green">116</FONT> *<a name="line.116"></a> |
| <FONT color="green">117</FONT> * @param n1 First node to use in compare<a name="line.117"></a> |
| <FONT color="green">118</FONT> * @param n2 Second node to use in compare<a name="line.118"></a> |
| <FONT color="green">119</FONT> * @param kIndex Index of NodeSortKey to use for sort<a name="line.119"></a> |
| <FONT color="green">120</FONT> * @param support XPath context to use<a name="line.120"></a> |
| <FONT color="green">121</FONT> *<a name="line.121"></a> |
| <FONT color="green">122</FONT> * @return The results of the compare of the two nodes.<a name="line.122"></a> |
| <FONT color="green">123</FONT> *<a name="line.123"></a> |
| <FONT color="green">124</FONT> * @throws TransformerException<a name="line.124"></a> |
| <FONT color="green">125</FONT> */<a name="line.125"></a> |
| <FONT color="green">126</FONT> int compare(<a name="line.126"></a> |
| <FONT color="green">127</FONT> NodeCompareElem n1, NodeCompareElem n2, int kIndex, XPathContext support)<a name="line.127"></a> |
| <FONT color="green">128</FONT> throws TransformerException<a name="line.128"></a> |
| <FONT color="green">129</FONT> {<a name="line.129"></a> |
| <FONT color="green">130</FONT> <a name="line.130"></a> |
| <FONT color="green">131</FONT> int result = 0;<a name="line.131"></a> |
| <FONT color="green">132</FONT> NodeSortKey k = (NodeSortKey) m_keys.elementAt(kIndex);<a name="line.132"></a> |
| <FONT color="green">133</FONT> <a name="line.133"></a> |
| <FONT color="green">134</FONT> if (k.m_treatAsNumbers)<a name="line.134"></a> |
| <FONT color="green">135</FONT> {<a name="line.135"></a> |
| <FONT color="green">136</FONT> double n1Num, n2Num;<a name="line.136"></a> |
| <FONT color="green">137</FONT> <a name="line.137"></a> |
| <FONT color="green">138</FONT> if (kIndex == 0)<a name="line.138"></a> |
| <FONT color="green">139</FONT> {<a name="line.139"></a> |
| <FONT color="green">140</FONT> n1Num = ((Double) n1.m_key1Value).doubleValue();<a name="line.140"></a> |
| <FONT color="green">141</FONT> n2Num = ((Double) n2.m_key1Value).doubleValue();<a name="line.141"></a> |
| <FONT color="green">142</FONT> }<a name="line.142"></a> |
| <FONT color="green">143</FONT> else if (kIndex == 1)<a name="line.143"></a> |
| <FONT color="green">144</FONT> {<a name="line.144"></a> |
| <FONT color="green">145</FONT> n1Num = ((Double) n1.m_key2Value).doubleValue();<a name="line.145"></a> |
| <FONT color="green">146</FONT> n2Num = ((Double) n2.m_key2Value).doubleValue();<a name="line.146"></a> |
| <FONT color="green">147</FONT> }<a name="line.147"></a> |
| <FONT color="green">148</FONT> <a name="line.148"></a> |
| <FONT color="green">149</FONT> /* Leave this in case we decide to use an array later<a name="line.149"></a> |
| <FONT color="green">150</FONT> if (kIndex < maxkey)<a name="line.150"></a> |
| <FONT color="green">151</FONT> {<a name="line.151"></a> |
| <FONT color="green">152</FONT> double n1Num = (double)n1.m_keyValue[kIndex];<a name="line.152"></a> |
| <FONT color="green">153</FONT> double n2Num = (double)n2.m_keyValue[kIndex];<a name="line.153"></a> |
| <FONT color="green">154</FONT> }*/<a name="line.154"></a> |
| <FONT color="green">155</FONT> else<a name="line.155"></a> |
| <FONT color="green">156</FONT> {<a name="line.156"></a> |
| <FONT color="green">157</FONT> <a name="line.157"></a> |
| <FONT color="green">158</FONT> // Get values dynamically<a name="line.158"></a> |
| <FONT color="green">159</FONT> XObject r1 = k.m_selectPat.execute(m_execContext, n1.m_node,<a name="line.159"></a> |
| <FONT color="green">160</FONT> k.m_namespaceContext);<a name="line.160"></a> |
| <FONT color="green">161</FONT> XObject r2 = k.m_selectPat.execute(m_execContext, n2.m_node,<a name="line.161"></a> |
| <FONT color="green">162</FONT> k.m_namespaceContext);<a name="line.162"></a> |
| <FONT color="green">163</FONT> n1Num = r1.num();<a name="line.163"></a> |
| <FONT color="green">164</FONT> <a name="line.164"></a> |
| <FONT color="green">165</FONT> // Can't use NaN for compare. They are never equal. Use zero instead.<a name="line.165"></a> |
| <FONT color="green">166</FONT> // That way we can keep elements in document order. <a name="line.166"></a> |
| <FONT color="green">167</FONT> //n1Num = Double.isNaN(d) ? 0.0 : d;<a name="line.167"></a> |
| <FONT color="green">168</FONT> n2Num = r2.num();<a name="line.168"></a> |
| <FONT color="green">169</FONT> //n2Num = Double.isNaN(d) ? 0.0 : d;<a name="line.169"></a> |
| <FONT color="green">170</FONT> }<a name="line.170"></a> |
| <FONT color="green">171</FONT> <a name="line.171"></a> |
| <FONT color="green">172</FONT> if ((n1Num == n2Num) && ((kIndex + 1) < m_keys.size()))<a name="line.172"></a> |
| <FONT color="green">173</FONT> {<a name="line.173"></a> |
| <FONT color="green">174</FONT> result = compare(n1, n2, kIndex + 1, support);<a name="line.174"></a> |
| <FONT color="green">175</FONT> }<a name="line.175"></a> |
| <FONT color="green">176</FONT> else<a name="line.176"></a> |
| <FONT color="green">177</FONT> {<a name="line.177"></a> |
| <FONT color="green">178</FONT> double diff;<a name="line.178"></a> |
| <FONT color="green">179</FONT> if (Double.isNaN(n1Num))<a name="line.179"></a> |
| <FONT color="green">180</FONT> {<a name="line.180"></a> |
| <FONT color="green">181</FONT> if (Double.isNaN(n2Num))<a name="line.181"></a> |
| <FONT color="green">182</FONT> diff = 0.0;<a name="line.182"></a> |
| <FONT color="green">183</FONT> else<a name="line.183"></a> |
| <FONT color="green">184</FONT> diff = -1;<a name="line.184"></a> |
| <FONT color="green">185</FONT> }<a name="line.185"></a> |
| <FONT color="green">186</FONT> else if (Double.isNaN(n2Num))<a name="line.186"></a> |
| <FONT color="green">187</FONT> diff = 1;<a name="line.187"></a> |
| <FONT color="green">188</FONT> else<a name="line.188"></a> |
| <FONT color="green">189</FONT> diff = n1Num - n2Num;<a name="line.189"></a> |
| <FONT color="green">190</FONT> <a name="line.190"></a> |
| <FONT color="green">191</FONT> // process order parameter <a name="line.191"></a> |
| <FONT color="green">192</FONT> result = (int) ((diff < 0.0)<a name="line.192"></a> |
| <FONT color="green">193</FONT> ? (k.m_descending ? 1 : -1)<a name="line.193"></a> |
| <FONT color="green">194</FONT> : (diff > 0.0) ? (k.m_descending ? -1 : 1) : 0);<a name="line.194"></a> |
| <FONT color="green">195</FONT> }<a name="line.195"></a> |
| <FONT color="green">196</FONT> } // end treat as numbers <a name="line.196"></a> |
| <FONT color="green">197</FONT> else<a name="line.197"></a> |
| <FONT color="green">198</FONT> {<a name="line.198"></a> |
| <FONT color="green">199</FONT> CollationKey n1String, n2String;<a name="line.199"></a> |
| <FONT color="green">200</FONT> <a name="line.200"></a> |
| <FONT color="green">201</FONT> if (kIndex == 0)<a name="line.201"></a> |
| <FONT color="green">202</FONT> {<a name="line.202"></a> |
| <FONT color="green">203</FONT> n1String = (CollationKey) n1.m_key1Value;<a name="line.203"></a> |
| <FONT color="green">204</FONT> n2String = (CollationKey) n2.m_key1Value;<a name="line.204"></a> |
| <FONT color="green">205</FONT> }<a name="line.205"></a> |
| <FONT color="green">206</FONT> else if (kIndex == 1)<a name="line.206"></a> |
| <FONT color="green">207</FONT> {<a name="line.207"></a> |
| <FONT color="green">208</FONT> n1String = (CollationKey) n1.m_key2Value;<a name="line.208"></a> |
| <FONT color="green">209</FONT> n2String = (CollationKey) n2.m_key2Value;<a name="line.209"></a> |
| <FONT color="green">210</FONT> }<a name="line.210"></a> |
| <FONT color="green">211</FONT> <a name="line.211"></a> |
| <FONT color="green">212</FONT> /* Leave this in case we decide to use an array later<a name="line.212"></a> |
| <FONT color="green">213</FONT> if (kIndex < maxkey)<a name="line.213"></a> |
| <FONT color="green">214</FONT> {<a name="line.214"></a> |
| <FONT color="green">215</FONT> String n1String = (String)n1.m_keyValue[kIndex];<a name="line.215"></a> |
| <FONT color="green">216</FONT> String n2String = (String)n2.m_keyValue[kIndex];<a name="line.216"></a> |
| <FONT color="green">217</FONT> }*/<a name="line.217"></a> |
| <FONT color="green">218</FONT> else<a name="line.218"></a> |
| <FONT color="green">219</FONT> {<a name="line.219"></a> |
| <FONT color="green">220</FONT> <a name="line.220"></a> |
| <FONT color="green">221</FONT> // Get values dynamically<a name="line.221"></a> |
| <FONT color="green">222</FONT> XObject r1 = k.m_selectPat.execute(m_execContext, n1.m_node,<a name="line.222"></a> |
| <FONT color="green">223</FONT> k.m_namespaceContext);<a name="line.223"></a> |
| <FONT color="green">224</FONT> XObject r2 = k.m_selectPat.execute(m_execContext, n2.m_node,<a name="line.224"></a> |
| <FONT color="green">225</FONT> k.m_namespaceContext);<a name="line.225"></a> |
| <FONT color="green">226</FONT> <a name="line.226"></a> |
| <FONT color="green">227</FONT> n1String = k.m_col.getCollationKey(r1.str());<a name="line.227"></a> |
| <FONT color="green">228</FONT> n2String = k.m_col.getCollationKey(r2.str());<a name="line.228"></a> |
| <FONT color="green">229</FONT> }<a name="line.229"></a> |
| <FONT color="green">230</FONT> <a name="line.230"></a> |
| <FONT color="green">231</FONT> // Use collation keys for faster compare, but note that whitespaces <a name="line.231"></a> |
| <FONT color="green">232</FONT> // etc... are treated differently from if we were comparing Strings.<a name="line.232"></a> |
| <FONT color="green">233</FONT> result = n1String.compareTo(n2String);<a name="line.233"></a> |
| <FONT color="green">234</FONT> <a name="line.234"></a> |
| <FONT color="green">235</FONT> //Process caseOrder parameter<a name="line.235"></a> |
| <FONT color="green">236</FONT> if (k.m_caseOrderUpper)<a name="line.236"></a> |
| <FONT color="green">237</FONT> {<a name="line.237"></a> |
| <FONT color="green">238</FONT> String tempN1 = n1String.getSourceString().toLowerCase();<a name="line.238"></a> |
| <FONT color="green">239</FONT> String tempN2 = n2String.getSourceString().toLowerCase();<a name="line.239"></a> |
| <FONT color="green">240</FONT> <a name="line.240"></a> |
| <FONT color="green">241</FONT> if (tempN1.equals(tempN2))<a name="line.241"></a> |
| <FONT color="green">242</FONT> {<a name="line.242"></a> |
| <FONT color="green">243</FONT> <a name="line.243"></a> |
| <FONT color="green">244</FONT> //java defaults to upper case is greater.<a name="line.244"></a> |
| <FONT color="green">245</FONT> result = result == 0 ? 0 : -result;<a name="line.245"></a> |
| <FONT color="green">246</FONT> }<a name="line.246"></a> |
| <FONT color="green">247</FONT> }<a name="line.247"></a> |
| <FONT color="green">248</FONT> <a name="line.248"></a> |
| <FONT color="green">249</FONT> //Process order parameter<a name="line.249"></a> |
| <FONT color="green">250</FONT> if (k.m_descending)<a name="line.250"></a> |
| <FONT color="green">251</FONT> {<a name="line.251"></a> |
| <FONT color="green">252</FONT> result = -result;<a name="line.252"></a> |
| <FONT color="green">253</FONT> }<a name="line.253"></a> |
| <FONT color="green">254</FONT> } //end else<a name="line.254"></a> |
| <FONT color="green">255</FONT> <a name="line.255"></a> |
| <FONT color="green">256</FONT> if (0 == result)<a name="line.256"></a> |
| <FONT color="green">257</FONT> {<a name="line.257"></a> |
| <FONT color="green">258</FONT> if ((kIndex + 1) < m_keys.size())<a name="line.258"></a> |
| <FONT color="green">259</FONT> {<a name="line.259"></a> |
| <FONT color="green">260</FONT> result = compare(n1, n2, kIndex + 1, support);<a name="line.260"></a> |
| <FONT color="green">261</FONT> }<a name="line.261"></a> |
| <FONT color="green">262</FONT> }<a name="line.262"></a> |
| <FONT color="green">263</FONT> <a name="line.263"></a> |
| <FONT color="green">264</FONT> if (0 == result)<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> // I shouldn't have to do this except that there seems to <a name="line.267"></a> |
| <FONT color="green">268</FONT> // be a glitch in the mergesort<a name="line.268"></a> |
| <FONT color="green">269</FONT> // if(r1.getType() == r1.CLASS_NODESET)<a name="line.269"></a> |
| <FONT color="green">270</FONT> // {<a name="line.270"></a> |
| <FONT color="green">271</FONT> DTM dtm = support.getDTM(n1.m_node); // %OPT%<a name="line.271"></a> |
| <FONT color="green">272</FONT> result = dtm.isNodeAfter(n1.m_node, n2.m_node) ? -1 : 1;<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> return result;<a name="line.277"></a> |
| <FONT color="green">278</FONT> }<a name="line.278"></a> |
| <FONT color="green">279</FONT> <a name="line.279"></a> |
| <FONT color="green">280</FONT> /**<a name="line.280"></a> |
| <FONT color="green">281</FONT> * This implements a standard Mergesort, as described in<a name="line.281"></a> |
| <FONT color="green">282</FONT> * Robert Sedgewick's Algorithms book. This is a better<a name="line.282"></a> |
| <FONT color="green">283</FONT> * sort for our purpose than the Quicksort because it<a name="line.283"></a> |
| <FONT color="green">284</FONT> * maintains the original document order of the input if<a name="line.284"></a> |
| <FONT color="green">285</FONT> * the order isn't changed by the sort.<a name="line.285"></a> |
| <FONT color="green">286</FONT> *<a name="line.286"></a> |
| <FONT color="green">287</FONT> * @param a First vector of nodes to compare<a name="line.287"></a> |
| <FONT color="green">288</FONT> * @param b Second vector of nodes to compare <a name="line.288"></a> |
| <FONT color="green">289</FONT> * @param l Left boundary of partition<a name="line.289"></a> |
| <FONT color="green">290</FONT> * @param r Right boundary of partition<a name="line.290"></a> |
| <FONT color="green">291</FONT> * @param support XPath context to use<a name="line.291"></a> |
| <FONT color="green">292</FONT> *<a name="line.292"></a> |
| <FONT color="green">293</FONT> * @throws TransformerException<a name="line.293"></a> |
| <FONT color="green">294</FONT> */<a name="line.294"></a> |
| <FONT color="green">295</FONT> void mergesort(Vector a, Vector b, int l, int r, XPathContext support)<a name="line.295"></a> |
| <FONT color="green">296</FONT> throws TransformerException<a name="line.296"></a> |
| <FONT color="green">297</FONT> {<a name="line.297"></a> |
| <FONT color="green">298</FONT> <a name="line.298"></a> |
| <FONT color="green">299</FONT> if ((r - l) > 0)<a name="line.299"></a> |
| <FONT color="green">300</FONT> {<a name="line.300"></a> |
| <FONT color="green">301</FONT> int m = (r + l) / 2;<a name="line.301"></a> |
| <FONT color="green">302</FONT> <a name="line.302"></a> |
| <FONT color="green">303</FONT> mergesort(a, b, l, m, support);<a name="line.303"></a> |
| <FONT color="green">304</FONT> mergesort(a, b, m + 1, r, support);<a name="line.304"></a> |
| <FONT color="green">305</FONT> <a name="line.305"></a> |
| <FONT color="green">306</FONT> int i, j, k;<a name="line.306"></a> |
| <FONT color="green">307</FONT> <a name="line.307"></a> |
| <FONT color="green">308</FONT> for (i = m; i >= l; i--)<a name="line.308"></a> |
| <FONT color="green">309</FONT> {<a name="line.309"></a> |
| <FONT color="green">310</FONT> <a name="line.310"></a> |
| <FONT color="green">311</FONT> // b[i] = a[i];<a name="line.311"></a> |
| <FONT color="green">312</FONT> // Use insert if we need to increment vector size.<a name="line.312"></a> |
| <FONT color="green">313</FONT> if (i >= b.size())<a name="line.313"></a> |
| <FONT color="green">314</FONT> b.insertElementAt(a.elementAt(i), i);<a name="line.314"></a> |
| <FONT color="green">315</FONT> else<a name="line.315"></a> |
| <FONT color="green">316</FONT> b.setElementAt(a.elementAt(i), i);<a name="line.316"></a> |
| <FONT color="green">317</FONT> }<a name="line.317"></a> |
| <FONT color="green">318</FONT> <a name="line.318"></a> |
| <FONT color="green">319</FONT> i = l;<a name="line.319"></a> |
| <FONT color="green">320</FONT> <a name="line.320"></a> |
| <FONT color="green">321</FONT> for (j = (m + 1); j <= r; j++)<a name="line.321"></a> |
| <FONT color="green">322</FONT> {<a name="line.322"></a> |
| <FONT color="green">323</FONT> <a name="line.323"></a> |
| <FONT color="green">324</FONT> // b[r+m+1-j] = a[j];<a name="line.324"></a> |
| <FONT color="green">325</FONT> if (r + m + 1 - j >= b.size())<a name="line.325"></a> |
| <FONT color="green">326</FONT> b.insertElementAt(a.elementAt(j), r + m + 1 - j);<a name="line.326"></a> |
| <FONT color="green">327</FONT> else<a name="line.327"></a> |
| <FONT color="green">328</FONT> b.setElementAt(a.elementAt(j), r + m + 1 - j);<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> j = r;<a name="line.331"></a> |
| <FONT color="green">332</FONT> <a name="line.332"></a> |
| <FONT color="green">333</FONT> int compVal;<a name="line.333"></a> |
| <FONT color="green">334</FONT> <a name="line.334"></a> |
| <FONT color="green">335</FONT> for (k = l; k <= r; k++)<a name="line.335"></a> |
| <FONT color="green">336</FONT> {<a name="line.336"></a> |
| <FONT color="green">337</FONT> <a name="line.337"></a> |
| <FONT color="green">338</FONT> // if(b[i] < b[j])<a name="line.338"></a> |
| <FONT color="green">339</FONT> if (i == j)<a name="line.339"></a> |
| <FONT color="green">340</FONT> compVal = -1;<a name="line.340"></a> |
| <FONT color="green">341</FONT> else<a name="line.341"></a> |
| <FONT color="green">342</FONT> compVal = compare((NodeCompareElem) b.elementAt(i),<a name="line.342"></a> |
| <FONT color="green">343</FONT> (NodeCompareElem) b.elementAt(j), 0, support);<a name="line.343"></a> |
| <FONT color="green">344</FONT> <a name="line.344"></a> |
| <FONT color="green">345</FONT> if (compVal < 0)<a name="line.345"></a> |
| <FONT color="green">346</FONT> {<a name="line.346"></a> |
| <FONT color="green">347</FONT> <a name="line.347"></a> |
| <FONT color="green">348</FONT> // a[k]=b[i];<a name="line.348"></a> |
| <FONT color="green">349</FONT> a.setElementAt(b.elementAt(i), k);<a name="line.349"></a> |
| <FONT color="green">350</FONT> <a name="line.350"></a> |
| <FONT color="green">351</FONT> i++;<a name="line.351"></a> |
| <FONT color="green">352</FONT> }<a name="line.352"></a> |
| <FONT color="green">353</FONT> else if (compVal > 0)<a name="line.353"></a> |
| <FONT color="green">354</FONT> {<a name="line.354"></a> |
| <FONT color="green">355</FONT> <a name="line.355"></a> |
| <FONT color="green">356</FONT> // a[k]=b[j]; <a name="line.356"></a> |
| <FONT color="green">357</FONT> a.setElementAt(b.elementAt(j), k);<a name="line.357"></a> |
| <FONT color="green">358</FONT> <a name="line.358"></a> |
| <FONT color="green">359</FONT> j--;<a name="line.359"></a> |
| <FONT color="green">360</FONT> }<a name="line.360"></a> |
| <FONT color="green">361</FONT> }<a name="line.361"></a> |
| <FONT color="green">362</FONT> }<a name="line.362"></a> |
| <FONT color="green">363</FONT> }<a name="line.363"></a> |
| <FONT color="green">364</FONT> <a name="line.364"></a> |
| <FONT color="green">365</FONT> /**<a name="line.365"></a> |
| <FONT color="green">366</FONT> * This is a generic version of C.A.R Hoare's Quick Sort<a name="line.366"></a> |
| <FONT color="green">367</FONT> * algorithm. This will handle arrays that are already<a name="line.367"></a> |
| <FONT color="green">368</FONT> * sorted, and arrays with duplicate keys.<BR><a name="line.368"></a> |
| <FONT color="green">369</FONT> *<a name="line.369"></a> |
| <FONT color="green">370</FONT> * If you think of a one dimensional array as going from<a name="line.370"></a> |
| <FONT color="green">371</FONT> * the lowest index on the left to the highest index on the right<a name="line.371"></a> |
| <FONT color="green">372</FONT> * then the parameters to this function are lowest index or<a name="line.372"></a> |
| <FONT color="green">373</FONT> * left and highest index or right. The first time you call<a name="line.373"></a> |
| <FONT color="green">374</FONT> * this function it will be with the parameters 0, a.length - 1.<a name="line.374"></a> |
| <FONT color="green">375</FONT> *<a name="line.375"></a> |
| <FONT color="green">376</FONT> * @param v a vector of integers <a name="line.376"></a> |
| <FONT color="green">377</FONT> * @param lo0 left boundary of array partition<a name="line.377"></a> |
| <FONT color="green">378</FONT> * @param hi0 right boundary of array partition<a name="line.378"></a> |
| <FONT color="green">379</FONT> *<a name="line.379"></a> |
| <FONT color="green">380</FONT> */<a name="line.380"></a> |
| <FONT color="green">381</FONT> <a name="line.381"></a> |
| <FONT color="green">382</FONT> /* private void QuickSort2(Vector v, int lo0, int hi0, XPathContext support)<a name="line.382"></a> |
| <FONT color="green">383</FONT> throws javax.xml.transform.TransformerException,<a name="line.383"></a> |
| <FONT color="green">384</FONT> java.net.MalformedURLException,<a name="line.384"></a> |
| <FONT color="green">385</FONT> java.io.FileNotFoundException,<a name="line.385"></a> |
| <FONT color="green">386</FONT> java.io.IOException<a name="line.386"></a> |
| <FONT color="green">387</FONT> {<a name="line.387"></a> |
| <FONT color="green">388</FONT> int lo = lo0;<a name="line.388"></a> |
| <FONT color="green">389</FONT> int hi = hi0;<a name="line.389"></a> |
| <FONT color="green">390</FONT> <a name="line.390"></a> |
| <FONT color="green">391</FONT> if ( hi0 > lo0)<a name="line.391"></a> |
| <FONT color="green">392</FONT> {<a name="line.392"></a> |
| <FONT color="green">393</FONT> // Arbitrarily establishing partition element as the midpoint of<a name="line.393"></a> |
| <FONT color="green">394</FONT> // the array.<a name="line.394"></a> |
| <FONT color="green">395</FONT> Node midNode = (Node)v.elementAt( ( lo0 + hi0 ) / 2 );<a name="line.395"></a> |
| <FONT color="green">396</FONT> <a name="line.396"></a> |
| <FONT color="green">397</FONT> // loop through the array until indices cross<a name="line.397"></a> |
| <FONT color="green">398</FONT> while( lo <= hi )<a name="line.398"></a> |
| <FONT color="green">399</FONT> {<a name="line.399"></a> |
| <FONT color="green">400</FONT> // find the first element that is greater than or equal to<a name="line.400"></a> |
| <FONT color="green">401</FONT> // the partition element starting from the left Index.<a name="line.401"></a> |
| <FONT color="green">402</FONT> while( (lo < hi0) && (compare((Node)v.elementAt(lo), midNode, 0, support) < 0) )<a name="line.402"></a> |
| <FONT color="green">403</FONT> {<a name="line.403"></a> |
| <FONT color="green">404</FONT> ++lo;<a name="line.404"></a> |
| <FONT color="green">405</FONT> } // end while<a name="line.405"></a> |
| <FONT color="green">406</FONT> <a name="line.406"></a> |
| <FONT color="green">407</FONT> // find an element that is smaller than or equal to<a name="line.407"></a> |
| <FONT color="green">408</FONT> // the partition element starting from the right Index.<a name="line.408"></a> |
| <FONT color="green">409</FONT> while( (hi > lo0) && (compare((Node)v.elementAt(hi), midNode, 0, support) > 0) )<a name="line.409"></a> |
| <FONT color="green">410</FONT> {<a name="line.410"></a> |
| <FONT color="green">411</FONT> --hi;<a name="line.411"></a> |
| <FONT color="green">412</FONT> }<a name="line.412"></a> |
| <FONT color="green">413</FONT> <a name="line.413"></a> |
| <FONT color="green">414</FONT> // if the indexes have not crossed, swap<a name="line.414"></a> |
| <FONT color="green">415</FONT> if( lo <= hi )<a name="line.415"></a> |
| <FONT color="green">416</FONT> {<a name="line.416"></a> |
| <FONT color="green">417</FONT> swap(v, lo, hi);<a name="line.417"></a> |
| <FONT color="green">418</FONT> ++lo;<a name="line.418"></a> |
| <FONT color="green">419</FONT> --hi;<a name="line.419"></a> |
| <FONT color="green">420</FONT> }<a name="line.420"></a> |
| <FONT color="green">421</FONT> }<a name="line.421"></a> |
| <FONT color="green">422</FONT> <a name="line.422"></a> |
| <FONT color="green">423</FONT> // If the right index has not reached the left side of array<a name="line.423"></a> |
| <FONT color="green">424</FONT> // must now sort the left partition.<a name="line.424"></a> |
| <FONT color="green">425</FONT> if( lo0 < hi )<a name="line.425"></a> |
| <FONT color="green">426</FONT> {<a name="line.426"></a> |
| <FONT color="green">427</FONT> QuickSort2( v, lo0, hi, support );<a name="line.427"></a> |
| <FONT color="green">428</FONT> }<a name="line.428"></a> |
| <FONT color="green">429</FONT> <a name="line.429"></a> |
| <FONT color="green">430</FONT> // If the left index has not reached the right side of array<a name="line.430"></a> |
| <FONT color="green">431</FONT> // must now sort the right partition.<a name="line.431"></a> |
| <FONT color="green">432</FONT> if( lo < hi0 )<a name="line.432"></a> |
| <FONT color="green">433</FONT> {<a name="line.433"></a> |
| <FONT color="green">434</FONT> QuickSort2( v, lo, hi0, support );<a name="line.434"></a> |
| <FONT color="green">435</FONT> }<a name="line.435"></a> |
| <FONT color="green">436</FONT> }<a name="line.436"></a> |
| <FONT color="green">437</FONT> } // end QuickSort2 */<a name="line.437"></a> |
| <FONT color="green">438</FONT> <a name="line.438"></a> |
| <FONT color="green">439</FONT> // /**<a name="line.439"></a> |
| <FONT color="green">440</FONT> // * Simple function to swap two elements in<a name="line.440"></a> |
| <FONT color="green">441</FONT> // * a vector.<a name="line.441"></a> |
| <FONT color="green">442</FONT> // * <a name="line.442"></a> |
| <FONT color="green">443</FONT> // * @param v Vector of nodes to swap<a name="line.443"></a> |
| <FONT color="green">444</FONT> // * @param i Index of first node to swap<a name="line.444"></a> |
| <FONT color="green">445</FONT> // * @param i Index of second node to swap<a name="line.445"></a> |
| <FONT color="green">446</FONT> // */<a name="line.446"></a> |
| <FONT color="green">447</FONT> // private void swap(Vector v, int i, int j)<a name="line.447"></a> |
| <FONT color="green">448</FONT> // {<a name="line.448"></a> |
| <FONT color="green">449</FONT> //<a name="line.449"></a> |
| <FONT color="green">450</FONT> // int node = (Node) v.elementAt(i);<a name="line.450"></a> |
| <FONT color="green">451</FONT> //<a name="line.451"></a> |
| <FONT color="green">452</FONT> // v.setElementAt(v.elementAt(j), i);<a name="line.452"></a> |
| <FONT color="green">453</FONT> // v.setElementAt(node, j);<a name="line.453"></a> |
| <FONT color="green">454</FONT> // }<a name="line.454"></a> |
| <FONT color="green">455</FONT> <a name="line.455"></a> |
| <FONT color="green">456</FONT> /**<a name="line.456"></a> |
| <FONT color="green">457</FONT> * This class holds the value(s) from executing the given<a name="line.457"></a> |
| <FONT color="green">458</FONT> * node against the sort key(s). <a name="line.458"></a> |
| <FONT color="green">459</FONT> * @xsl.usage internal<a name="line.459"></a> |
| <FONT color="green">460</FONT> */<a name="line.460"></a> |
| <FONT color="green">461</FONT> class NodeCompareElem<a name="line.461"></a> |
| <FONT color="green">462</FONT> {<a name="line.462"></a> |
| <FONT color="green">463</FONT> <a name="line.463"></a> |
| <FONT color="green">464</FONT> /** Current node */<a name="line.464"></a> |
| <FONT color="green">465</FONT> int m_node;<a name="line.465"></a> |
| <FONT color="green">466</FONT> <a name="line.466"></a> |
| <FONT color="green">467</FONT> /** This maxkey value was chosen arbitrarily. We are assuming that the <a name="line.467"></a> |
| <FONT color="green">468</FONT> // maxkey + 1 keys will only hit fairly rarely and therefore, we<a name="line.468"></a> |
| <FONT color="green">469</FONT> // will get the node values for those keys dynamically.<a name="line.469"></a> |
| <FONT color="green">470</FONT> */<a name="line.470"></a> |
| <FONT color="green">471</FONT> int maxkey = 2;<a name="line.471"></a> |
| <FONT color="green">472</FONT> <a name="line.472"></a> |
| <FONT color="green">473</FONT> // Keep this in case we decide to use an array. Right now<a name="line.473"></a> |
| <FONT color="green">474</FONT> // using two variables is cheaper.<a name="line.474"></a> |
| <FONT color="green">475</FONT> //Object[] m_KeyValue = new Object[2];<a name="line.475"></a> |
| <FONT color="green">476</FONT> <a name="line.476"></a> |
| <FONT color="green">477</FONT> /** Value from first sort key */<a name="line.477"></a> |
| <FONT color="green">478</FONT> Object m_key1Value;<a name="line.478"></a> |
| <FONT color="green">479</FONT> <a name="line.479"></a> |
| <FONT color="green">480</FONT> /** Value from second sort key */<a name="line.480"></a> |
| <FONT color="green">481</FONT> Object m_key2Value;<a name="line.481"></a> |
| <FONT color="green">482</FONT> <a name="line.482"></a> |
| <FONT color="green">483</FONT> /**<a name="line.483"></a> |
| <FONT color="green">484</FONT> * Constructor NodeCompareElem<a name="line.484"></a> |
| <FONT color="green">485</FONT> *<a name="line.485"></a> |
| <FONT color="green">486</FONT> *<a name="line.486"></a> |
| <FONT color="green">487</FONT> * @param node Current node<a name="line.487"></a> |
| <FONT color="green">488</FONT> *<a name="line.488"></a> |
| <FONT color="green">489</FONT> * @throws javax.xml.transform.TransformerException<a name="line.489"></a> |
| <FONT color="green">490</FONT> */<a name="line.490"></a> |
| <FONT color="green">491</FONT> NodeCompareElem(int node) throws javax.xml.transform.TransformerException<a name="line.491"></a> |
| <FONT color="green">492</FONT> {<a name="line.492"></a> |
| <FONT color="green">493</FONT> m_node = node;<a name="line.493"></a> |
| <FONT color="green">494</FONT> <a name="line.494"></a> |
| <FONT color="green">495</FONT> if (!m_keys.isEmpty())<a name="line.495"></a> |
| <FONT color="green">496</FONT> {<a name="line.496"></a> |
| <FONT color="green">497</FONT> NodeSortKey k1 = (NodeSortKey) m_keys.elementAt(0);<a name="line.497"></a> |
| <FONT color="green">498</FONT> XObject r = k1.m_selectPat.execute(m_execContext, node,<a name="line.498"></a> |
| <FONT color="green">499</FONT> k1.m_namespaceContext);<a name="line.499"></a> |
| <FONT color="green">500</FONT> <a name="line.500"></a> |
| <FONT color="green">501</FONT> double d;<a name="line.501"></a> |
| <FONT color="green">502</FONT> <a name="line.502"></a> |
| <FONT color="green">503</FONT> if (k1.m_treatAsNumbers)<a name="line.503"></a> |
| <FONT color="green">504</FONT> {<a name="line.504"></a> |
| <FONT color="green">505</FONT> d = r.num();<a name="line.505"></a> |
| <FONT color="green">506</FONT> <a name="line.506"></a> |
| <FONT color="green">507</FONT> // Can't use NaN for compare. They are never equal. Use zero instead. <a name="line.507"></a> |
| <FONT color="green">508</FONT> m_key1Value = new Double(d);<a name="line.508"></a> |
| <FONT color="green">509</FONT> }<a name="line.509"></a> |
| <FONT color="green">510</FONT> else<a name="line.510"></a> |
| <FONT color="green">511</FONT> {<a name="line.511"></a> |
| <FONT color="green">512</FONT> m_key1Value = k1.m_col.getCollationKey(r.str());<a name="line.512"></a> |
| <FONT color="green">513</FONT> }<a name="line.513"></a> |
| <FONT color="green">514</FONT> <a name="line.514"></a> |
| <FONT color="green">515</FONT> if (r.getType() == XObject.CLASS_NODESET)<a name="line.515"></a> |
| <FONT color="green">516</FONT> {<a name="line.516"></a> |
| <FONT color="green">517</FONT> // %REVIEW%<a name="line.517"></a> |
| <FONT color="green">518</FONT> DTMIterator ni = ((XNodeSet)r).iterRaw();<a name="line.518"></a> |
| <FONT color="green">519</FONT> int current = ni.getCurrentNode();<a name="line.519"></a> |
| <FONT color="green">520</FONT> if(DTM.NULL == current)<a name="line.520"></a> |
| <FONT color="green">521</FONT> current = ni.nextNode();<a name="line.521"></a> |
| <FONT color="green">522</FONT> <a name="line.522"></a> |
| <FONT color="green">523</FONT> // if (ni instanceof ContextNodeList) // %REVIEW%<a name="line.523"></a> |
| <FONT color="green">524</FONT> // tryNextKey = (DTM.NULL != current);<a name="line.524"></a> |
| <FONT color="green">525</FONT> <a name="line.525"></a> |
| <FONT color="green">526</FONT> // else abdicate... should never happen, but... -sb<a name="line.526"></a> |
| <FONT color="green">527</FONT> }<a name="line.527"></a> |
| <FONT color="green">528</FONT> <a name="line.528"></a> |
| <FONT color="green">529</FONT> if (m_keys.size() > 1)<a name="line.529"></a> |
| <FONT color="green">530</FONT> {<a name="line.530"></a> |
| <FONT color="green">531</FONT> NodeSortKey k2 = (NodeSortKey) m_keys.elementAt(1);<a name="line.531"></a> |
| <FONT color="green">532</FONT> <a name="line.532"></a> |
| <FONT color="green">533</FONT> XObject r2 = k2.m_selectPat.execute(m_execContext, node,<a name="line.533"></a> |
| <FONT color="green">534</FONT> k2.m_namespaceContext);<a name="line.534"></a> |
| <FONT color="green">535</FONT> <a name="line.535"></a> |
| <FONT color="green">536</FONT> if (k2.m_treatAsNumbers) {<a name="line.536"></a> |
| <FONT color="green">537</FONT> d = r2.num();<a name="line.537"></a> |
| <FONT color="green">538</FONT> m_key2Value = new Double(d);<a name="line.538"></a> |
| <FONT color="green">539</FONT> } else {<a name="line.539"></a> |
| <FONT color="green">540</FONT> m_key2Value = k2.m_col.getCollationKey(r2.str());<a name="line.540"></a> |
| <FONT color="green">541</FONT> }<a name="line.541"></a> |
| <FONT color="green">542</FONT> }<a name="line.542"></a> |
| <FONT color="green">543</FONT> <a name="line.543"></a> |
| <FONT color="green">544</FONT> /* Leave this in case we decide to use an array later<a name="line.544"></a> |
| <FONT color="green">545</FONT> while (kIndex <= m_keys.size() && kIndex < maxkey)<a name="line.545"></a> |
| <FONT color="green">546</FONT> {<a name="line.546"></a> |
| <FONT color="green">547</FONT> NodeSortKey k = (NodeSortKey)m_keys.elementAt(kIndex);<a name="line.547"></a> |
| <FONT color="green">548</FONT> XObject r = k.m_selectPat.execute(m_execContext, node, k.m_namespaceContext);<a name="line.548"></a> |
| <FONT color="green">549</FONT> if(k.m_treatAsNumbers)<a name="line.549"></a> |
| <FONT color="green">550</FONT> m_KeyValue[kIndex] = r.num();<a name="line.550"></a> |
| <FONT color="green">551</FONT> else<a name="line.551"></a> |
| <FONT color="green">552</FONT> m_KeyValue[kIndex] = r.str();<a name="line.552"></a> |
| <FONT color="green">553</FONT> } */<a name="line.553"></a> |
| <FONT color="green">554</FONT> } // end if not empty <a name="line.554"></a> |
| <FONT color="green">555</FONT> }<a name="line.555"></a> |
| <FONT color="green">556</FONT> } // end NodeCompareElem class<a name="line.556"></a> |
| <FONT color="green">557</FONT> }<a name="line.557"></a> |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| |
| </PRE> |
| </BODY> |
| </HTML> |
