Google Git
Sign in
apache / xalan-site / baed2198e564a4221346ce9823f7f57830a0d758 / . / docs / xalan / xalan-j / apidocs / src-html / org / apache / xalan / xsltc / util / IntegerArray.html
blob: 0bc8d6ef3a3476e9d3653caad99e17f9be6781f1 [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: IntegerArray.java 1225434 2011-12-29 05:07:42Z mrglavas $<a name="line.19"></a>
<FONT color="green">020</FONT> */<a name="line.20"></a>
<FONT color="green">021</FONT> <a name="line.21"></a>
<FONT color="green">022</FONT> package org.apache.xalan.xsltc.util;<a name="line.22"></a>
<FONT color="green">023</FONT> <a name="line.23"></a>
<FONT color="green">024</FONT> /**<a name="line.24"></a>
<FONT color="green">025</FONT> * @author Jacek Ambroziak<a name="line.25"></a>
<FONT color="green">026</FONT> */<a name="line.26"></a>
<FONT color="green">027</FONT> public final class IntegerArray implements Cloneable {<a name="line.27"></a>
<FONT color="green">028</FONT> private static final int InitialSize = 32;<a name="line.28"></a>
<FONT color="green">029</FONT> <a name="line.29"></a>
<FONT color="green">030</FONT> private int[] _array;<a name="line.30"></a>
<FONT color="green">031</FONT> private int _size;<a name="line.31"></a>
<FONT color="green">032</FONT> private int _free = 0;<a name="line.32"></a>
<FONT color="green">033</FONT> <a name="line.33"></a>
<FONT color="green">034</FONT> public IntegerArray() {<a name="line.34"></a>
<FONT color="green">035</FONT> this(InitialSize);<a name="line.35"></a>
<FONT color="green">036</FONT> }<a name="line.36"></a>
<FONT color="green">037</FONT> <a name="line.37"></a>
<FONT color="green">038</FONT> public IntegerArray(int size) {<a name="line.38"></a>
<FONT color="green">039</FONT> _array = new int[_size = size];<a name="line.39"></a>
<FONT color="green">040</FONT> }<a name="line.40"></a>
<FONT color="green">041</FONT> <a name="line.41"></a>
<FONT color="green">042</FONT> public IntegerArray(int[] array) {<a name="line.42"></a>
<FONT color="green">043</FONT> this(array.length);<a name="line.43"></a>
<FONT color="green">044</FONT> System.arraycopy(array, 0, _array, 0, _free = _size);<a name="line.44"></a>
<FONT color="green">045</FONT> }<a name="line.45"></a>
<FONT color="green">046</FONT> <a name="line.46"></a>
<FONT color="green">047</FONT> public void clear() {<a name="line.47"></a>
<FONT color="green">048</FONT> _free = 0;<a name="line.48"></a>
<FONT color="green">049</FONT> }<a name="line.49"></a>
<FONT color="green">050</FONT> <a name="line.50"></a>
<FONT color="green">051</FONT> public Object clone() {<a name="line.51"></a>
<FONT color="green">052</FONT> final IntegerArray clone = new IntegerArray(_free &gt; 0 ? _free : 1);<a name="line.52"></a>
<FONT color="green">053</FONT> System.arraycopy(_array, 0, clone._array, 0, _free);<a name="line.53"></a>
<FONT color="green">054</FONT> clone._free = _free;<a name="line.54"></a>
<FONT color="green">055</FONT> return clone;<a name="line.55"></a>
<FONT color="green">056</FONT> }<a name="line.56"></a>
<FONT color="green">057</FONT> <a name="line.57"></a>
<FONT color="green">058</FONT> public int[] toIntArray() {<a name="line.58"></a>
<FONT color="green">059</FONT> final int[] result = new int[cardinality()];<a name="line.59"></a>
<FONT color="green">060</FONT> System.arraycopy(_array, 0, result, 0, cardinality());<a name="line.60"></a>
<FONT color="green">061</FONT> return result;<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> public final int at(int index) {<a name="line.64"></a>
<FONT color="green">065</FONT> return _array[index];<a name="line.65"></a>
<FONT color="green">066</FONT> }<a name="line.66"></a>
<FONT color="green">067</FONT> <a name="line.67"></a>
<FONT color="green">068</FONT> public final void set(int index, int value) {<a name="line.68"></a>
<FONT color="green">069</FONT> _array[index] = value;<a name="line.69"></a>
<FONT color="green">070</FONT> }<a name="line.70"></a>
<FONT color="green">071</FONT> <a name="line.71"></a>
<FONT color="green">072</FONT> public int indexOf(int n) {<a name="line.72"></a>
<FONT color="green">073</FONT> for (int i = 0; i &lt; _free; i++) {<a name="line.73"></a>
<FONT color="green">074</FONT> if (n == _array[i]) return i;<a name="line.74"></a>
<FONT color="green">075</FONT> }<a name="line.75"></a>
<FONT color="green">076</FONT> return -1;<a name="line.76"></a>
<FONT color="green">077</FONT> }<a name="line.77"></a>
<FONT color="green">078</FONT> <a name="line.78"></a>
<FONT color="green">079</FONT> public final void add(int value) {<a name="line.79"></a>
<FONT color="green">080</FONT> if (_free == _size) {<a name="line.80"></a>
<FONT color="green">081</FONT> growArray(_size * 2);<a name="line.81"></a>
<FONT color="green">082</FONT> }<a name="line.82"></a>
<FONT color="green">083</FONT> _array[_free++] = value;<a name="line.83"></a>
<FONT color="green">084</FONT> }<a name="line.84"></a>
<FONT color="green">085</FONT> <a name="line.85"></a>
<FONT color="green">086</FONT> /** <a name="line.86"></a>
<FONT color="green">087</FONT> * Adds new int at the end if not already present.<a name="line.87"></a>
<FONT color="green">088</FONT> */<a name="line.88"></a>
<FONT color="green">089</FONT> public void addNew(int value) {<a name="line.89"></a>
<FONT color="green">090</FONT> for (int i = 0; i &lt; _free; i++) {<a name="line.90"></a>
<FONT color="green">091</FONT> if (_array[i] == value) return; // already in array<a name="line.91"></a>
<FONT color="green">092</FONT> }<a name="line.92"></a>
<FONT color="green">093</FONT> add(value);<a name="line.93"></a>
<FONT color="green">094</FONT> }<a name="line.94"></a>
<FONT color="green">095</FONT> <a name="line.95"></a>
<FONT color="green">096</FONT> public void reverse() {<a name="line.96"></a>
<FONT color="green">097</FONT> int left = 0; <a name="line.97"></a>
<FONT color="green">098</FONT> int right = _free - 1;<a name="line.98"></a>
<FONT color="green">099</FONT> <a name="line.99"></a>
<FONT color="green">100</FONT> while (left &lt; right) {<a name="line.100"></a>
<FONT color="green">101</FONT> int temp = _array[left];<a name="line.101"></a>
<FONT color="green">102</FONT> _array[left++] = _array[right];<a name="line.102"></a>
<FONT color="green">103</FONT> _array[right--] = temp;<a name="line.103"></a>
<FONT color="green">104</FONT> }<a name="line.104"></a>
<FONT color="green">105</FONT> }<a name="line.105"></a>
<FONT color="green">106</FONT> <a name="line.106"></a>
<FONT color="green">107</FONT> /**<a name="line.107"></a>
<FONT color="green">108</FONT> * Merge two sorted arrays and eliminate duplicates.<a name="line.108"></a>
<FONT color="green">109</FONT> * Elements of the other IntegerArray must not be changed. <a name="line.109"></a>
<FONT color="green">110</FONT> */<a name="line.110"></a>
<FONT color="green">111</FONT> public void merge(final IntegerArray other) {<a name="line.111"></a>
<FONT color="green">112</FONT> final int newSize = _free + other._free;<a name="line.112"></a>
<FONT color="green">113</FONT> // System.out.println("IntegerArray.merge() begin newSize = " + newSize);<a name="line.113"></a>
<FONT color="green">114</FONT> int[] newArray = new int[newSize];<a name="line.114"></a>
<FONT color="green">115</FONT> <a name="line.115"></a>
<FONT color="green">116</FONT> // Merge the two arrays<a name="line.116"></a>
<FONT color="green">117</FONT> int i = 0, j = 0, k;<a name="line.117"></a>
<FONT color="green">118</FONT> for (k = 0; i &lt; _free &amp;&amp; j &lt; other._free; k++) {<a name="line.118"></a>
<FONT color="green">119</FONT> int x = _array[i];<a name="line.119"></a>
<FONT color="green">120</FONT> int y = other._array[j];<a name="line.120"></a>
<FONT color="green">121</FONT> <a name="line.121"></a>
<FONT color="green">122</FONT> if (x &lt; y) {<a name="line.122"></a>
<FONT color="green">123</FONT> newArray[k] = x;<a name="line.123"></a>
<FONT color="green">124</FONT> i++;<a name="line.124"></a>
<FONT color="green">125</FONT> }<a name="line.125"></a>
<FONT color="green">126</FONT> else if (x &gt; y) {<a name="line.126"></a>
<FONT color="green">127</FONT> newArray[k] = y;<a name="line.127"></a>
<FONT color="green">128</FONT> j++;<a name="line.128"></a>
<FONT color="green">129</FONT> }<a name="line.129"></a>
<FONT color="green">130</FONT> else {<a name="line.130"></a>
<FONT color="green">131</FONT> newArray[k] = x;<a name="line.131"></a>
<FONT color="green">132</FONT> i++; j++;<a name="line.132"></a>
<FONT color="green">133</FONT> }<a name="line.133"></a>
<FONT color="green">134</FONT> }<a name="line.134"></a>
<FONT color="green">135</FONT> <a name="line.135"></a>
<FONT color="green">136</FONT> // Copy the rest if of different lengths<a name="line.136"></a>
<FONT color="green">137</FONT> if (i &gt;= _free) {<a name="line.137"></a>
<FONT color="green">138</FONT> while (j &lt; other._free) {<a name="line.138"></a>
<FONT color="green">139</FONT> newArray[k++] = other._array[j++];<a name="line.139"></a>
<FONT color="green">140</FONT> }<a name="line.140"></a>
<FONT color="green">141</FONT> }<a name="line.141"></a>
<FONT color="green">142</FONT> else {<a name="line.142"></a>
<FONT color="green">143</FONT> while (i &lt; _free) {<a name="line.143"></a>
<FONT color="green">144</FONT> newArray[k++] = _array[i++];<a name="line.144"></a>
<FONT color="green">145</FONT> }<a name="line.145"></a>
<FONT color="green">146</FONT> }<a name="line.146"></a>
<FONT color="green">147</FONT> <a name="line.147"></a>
<FONT color="green">148</FONT> // Update reference to this array<a name="line.148"></a>
<FONT color="green">149</FONT> _array = newArray;<a name="line.149"></a>
<FONT color="green">150</FONT> _free = _size = newSize;<a name="line.150"></a>
<FONT color="green">151</FONT> // System.out.println("IntegerArray.merge() end");<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> public void sort() {<a name="line.154"></a>
<FONT color="green">155</FONT> quicksort(_array, 0, _free - 1);<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> private static void quicksort(int[] array, int p, int r) {<a name="line.158"></a>
<FONT color="green">159</FONT> if (p &lt; r) {<a name="line.159"></a>
<FONT color="green">160</FONT> final int q = partition(array, p, r);<a name="line.160"></a>
<FONT color="green">161</FONT> quicksort(array, p, q);<a name="line.161"></a>
<FONT color="green">162</FONT> quicksort(array, q + 1, r);<a name="line.162"></a>
<FONT color="green">163</FONT> }<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> private static int partition(int[] array, int p, int r) {<a name="line.166"></a>
<FONT color="green">167</FONT> final int x = array[(p + r) &gt;&gt;&gt; 1];<a name="line.167"></a>
<FONT color="green">168</FONT> int i = p - 1; int j = r + 1;<a name="line.168"></a>
<FONT color="green">169</FONT> <a name="line.169"></a>
<FONT color="green">170</FONT> while (true) {<a name="line.170"></a>
<FONT color="green">171</FONT> while (x &lt; array[--j]);<a name="line.171"></a>
<FONT color="green">172</FONT> while (x &gt; array[++i]);<a name="line.172"></a>
<FONT color="green">173</FONT> if (i &lt; j) {<a name="line.173"></a>
<FONT color="green">174</FONT> int temp = array[i];<a name="line.174"></a>
<FONT color="green">175</FONT> array[i] = array[j];<a name="line.175"></a>
<FONT color="green">176</FONT> array[j] = temp;<a name="line.176"></a>
<FONT color="green">177</FONT> }<a name="line.177"></a>
<FONT color="green">178</FONT> else {<a name="line.178"></a>
<FONT color="green">179</FONT> return j;<a name="line.179"></a>
<FONT color="green">180</FONT> }<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> private void growArray(int size) {<a name="line.184"></a>
<FONT color="green">185</FONT> final int[] newArray = new int[_size = size];<a name="line.185"></a>
<FONT color="green">186</FONT> System.arraycopy(_array, 0, newArray, 0, _free);<a name="line.186"></a>
<FONT color="green">187</FONT> _array = newArray;<a name="line.187"></a>
<FONT color="green">188</FONT> }<a name="line.188"></a>
<FONT color="green">189</FONT> <a name="line.189"></a>
<FONT color="green">190</FONT> public int popLast() {<a name="line.190"></a>
<FONT color="green">191</FONT> return _array[--_free];<a name="line.191"></a>
<FONT color="green">192</FONT> }<a name="line.192"></a>
<FONT color="green">193</FONT> <a name="line.193"></a>
<FONT color="green">194</FONT> public int last() {<a name="line.194"></a>
<FONT color="green">195</FONT> return _array[_free - 1];<a name="line.195"></a>
<FONT color="green">196</FONT> }<a name="line.196"></a>
<FONT color="green">197</FONT> <a name="line.197"></a>
<FONT color="green">198</FONT> public void setLast(int n) {<a name="line.198"></a>
<FONT color="green">199</FONT> _array[_free - 1] = n;<a name="line.199"></a>
<FONT color="green">200</FONT> }<a name="line.200"></a>
<FONT color="green">201</FONT> <a name="line.201"></a>
<FONT color="green">202</FONT> public void pop() {<a name="line.202"></a>
<FONT color="green">203</FONT> _free--;<a name="line.203"></a>
<FONT color="green">204</FONT> }<a name="line.204"></a>
<FONT color="green">205</FONT> <a name="line.205"></a>
<FONT color="green">206</FONT> public void pop(int n) {<a name="line.206"></a>
<FONT color="green">207</FONT> _free -= n;<a name="line.207"></a>
<FONT color="green">208</FONT> }<a name="line.208"></a>
<FONT color="green">209</FONT> <a name="line.209"></a>
<FONT color="green">210</FONT> public final int cardinality() {<a name="line.210"></a>
<FONT color="green">211</FONT> return _free;<a name="line.211"></a>
<FONT color="green">212</FONT> }<a name="line.212"></a>
<FONT color="green">213</FONT> <a name="line.213"></a>
<FONT color="green">214</FONT> public void print(java.io.PrintStream out) {<a name="line.214"></a>
<FONT color="green">215</FONT> if (_free &gt; 0) {<a name="line.215"></a>
<FONT color="green">216</FONT> for (int i = 0; i &lt; _free - 1; i++) {<a name="line.216"></a>
<FONT color="green">217</FONT> out.print(_array[i]);<a name="line.217"></a>
<FONT color="green">218</FONT> out.print(' ');<a name="line.218"></a>
<FONT color="green">219</FONT> }<a name="line.219"></a>
<FONT color="green">220</FONT> out.println(_array[_free - 1]);<a name="line.220"></a>
<FONT color="green">221</FONT> }<a name="line.221"></a>
<FONT color="green">222</FONT> else {<a name="line.222"></a>
<FONT color="green">223</FONT> out.println("IntegerArray: empty");<a name="line.223"></a>
<FONT color="green">224</FONT> }<a name="line.224"></a>
<FONT color="green">225</FONT> }<a name="line.225"></a>
<FONT color="green">226</FONT> }<a name="line.226"></a>
</PRE>
</BODY>
</HTML>