1 // Copyright 2000-2005 the Contributors, as shown in the revision logs.
2 // Licensed under the Apache Public Source License 2.0 ("the License").
3 // You may not use this file except in compliance with the License.
9 * An unsynchronized Vector implementation; same semantics as
10 * java.util.Vector. Useful for JDK1.1 platforms that don't have
11 * java.util.ArrayList.
15 * @see java.util.Vector
17 public final class Vec implements Serializable, Cloneable {
19 private Object[] store;
22 public Vec() { this(10); }
23 public Vec(int i) { store = new Object[i]; }
24 public Vec(int i, Object[] store) { size = i; this.store = store; }
26 store = new Object[old.store.length];
27 System.arraycopy(old.store, 0, store, 0, old.store.length);
31 public Object clone() { return new Vec(this); }
32 private void grow() { grow(store.length * 2); }
33 private void grow(int newsize) {
34 Object[] newstore = new Object[newsize];
35 System.arraycopy(store, 0, newstore, 0, size);
39 public void removeAllElements() {
40 for(int i=0; i<size; i++) store[i] = null;
44 public void toArray(Object[] o) {
45 for(int i=0; i<size; i++)
49 public int indexOf(Object o) {
50 for(int i=0; i<size; i++)
51 if (o == null ? store[i] == null : store[i].equals(o)) return i;
56 public void addElement(Object o) {
57 if (size >= store.length - 1) grow();
61 public Object peek() {
65 public Object elementAt(int i) {
69 public Object lastElement() {
70 if (size == 0) return null;
71 return store[size - 1];
74 public void push(Object o) { addElement(o); }
76 Object ret = lastElement();
77 if (size > 0) store[--size] = null;
81 public int size() { return size; }
83 public void setSize(int newSize) {
84 if (newSize < 0) throw new RuntimeException("tried to set size to negative value");
85 if (newSize > store.length) grow(newSize * 2);
87 for(int i=newSize; i<size; i++)
92 public Object[] copyInto(Object[] out) {
93 for(int i=0; i<size; i++)
98 public void fromArray(Object[] in) {
100 for(int i=0; i<size; i++)
104 public void removeElementAt(int i) {
105 if (i >= size || i < 0) throw new RuntimeException("tried to remove an element outside the vector's limits");
106 for(int j=i; j<size - 1; j++)
107 store[j] = store[j + 1];
111 public void setElementAt(Object o, int i) {
112 if (i >= size) setSize(i);
116 public void removeElement(Object o) {
117 int idx = indexOf(o);
118 if (idx != -1) removeElementAt(idx);
121 public void insertElementAt(Object o, int at) {
122 if (size == store.length) grow();
123 for(int i=size; i>at; i--)
124 store[i] = store[i-1];
129 public interface CompareFunc {
130 public int compare(Object a, Object b);
133 public void sort(CompareFunc c) {
134 sort(this, null, c, 0, size-1);
137 public static void sort(Vec a, Vec b, CompareFunc c) {
138 if (b != null && a.size != b.size) throw new IllegalArgumentException("Vec a and b must be of equal size");
139 sort(a, b, c, 0, a.size-1);
142 private static final void sort(Vec a, Vec b, CompareFunc c, int start, int end) {
143 Object tmpa, tmpb = null;
144 if(start >= end) return;
146 for(int i=start+1;i<=end;i++) {
148 if (b != null) tmpb = b.store[i];
150 for(j=i-1;j>=start;j--) {
151 if(c.compare(a.store[j],tmpa) <= 0) break;
152 a.store[j+1] = a.store[j];
153 if (b != null) b.store[j+1] = b.store[j];
156 if (b != null) b.store[j+1] = tmpb;
161 Object pivot = a.store[end];
166 while(c.compare(a.store[++lo],pivot) < 0) { }
167 while((hi > lo) && c.compare(a.store[--hi],pivot) > 0) { }
169 if (b != null) swap(b, lo,hi);
173 if (b != null) swap(b, lo,end);
175 sort(a, b, c, start, lo-1);
176 sort(a, b, c, lo+1, end);
179 private static final void swap(Vec vec, int a, int b) {
181 Object tmp = vec.store[a];
182 vec.store[a] = vec.store[b];
187 public static final void sortInts(int[] a, int start, int end) {
189 if(start >= end) return;
191 for(int i=start+1;i<=end;i++) {
194 for(j=i-1;j>=start;j--) {
195 if(a[j] <= tmpa) break;
206 while(a[++lo] < pivot) { }
207 while((hi > lo) && a[--hi] > pivot) { }
210 swapInts(a, lo, end);
211 sortInts(a, start, lo-1);
212 sortInts(a, lo+1, end);
214 private static final void swapInts(int[] vec, int a, int b) {
224 // just a cut-and-paste copy of Vec with int storage
225 public static class Int {
227 private int size = 0;
229 public Int() { this(10); }
230 public Int(int i) { store = new int[i]; }
231 public Int(int i, int[] store) { size = i; this.store = store; }
233 private void grow() { grow(store.length * 2); }
234 private void grow(int newsize) {
235 int[] newstore = new int[newsize];
236 System.arraycopy(store, 0, newstore, 0, size);
240 public void removeAllElements() {
241 for(int i=0; i<size; i++) store[i] = 0;
245 public void toArray(int[] o) {
246 for(int i=0; i<size; i++)
250 public int[] dump() { int[] o = new int[size]; toArray(o); return o; }
252 public int indexOf(int o) {
253 for(int i=0; i<size; i++)
254 if (o == store[i]) return i;
259 public void addElement(int o) {
260 if (size >= store.length - 1) grow();
265 return lastElement();
268 public int elementAt(int i) {
272 public int lastElement() {
273 if (size == 0) return 0;
274 return store[size - 1];
277 public void push(int o) { addElement(o); }
279 int ret = lastElement();
280 if (size > 0) store[size--] = 0;
284 public int size() { return size; }
286 public void setSize(int newSize) {
287 if (newSize < 0) throw new RuntimeException("tried to set size to negative value");
288 if (newSize > store.length) grow(newSize * 2);
290 for(int i=newSize; i<size; i++)
295 public int[] copyInto(int[] out) {
296 for(int i=0; i<size; i++)
301 public void fromArray(int[] in) {
303 for(int i=0; i<size; i++)
307 public void removeElementAt(int i) {
308 if (i >= size || i < 0) throw new RuntimeException("tried to remove an element outside the vector's limits");
309 for(int j=i; j<size - 1; j++)
310 store[j] = store[j + 1];
314 public void setElementAt(int o, int i) {
315 if (i >= size) setSize(i);
319 public void removeElement(int o) {
320 int idx = indexOf(o);
321 if (idx != -1) removeElementAt(idx);
324 public void insertElementAt(int o, int at) {
325 if (size == store.length) grow();
326 for(int i=size; i>at; i--)
327 store[i] = store[i-1];
332 public void sort() { sort(this, null, 0, size-1); }
334 public static void sort(Vec.Int a, Vec.Int b) {
335 if (b != null && a.size != b.size) throw new IllegalArgumentException("Vec.Int a and b must be of equal size");
336 sort(a, b, 0, a.size-1);
339 private static final void sort(Vec.Int a, Vec.Int b, int start, int end) {
341 if(start >= end) return;
343 for(int i=start+1;i<=end;i++) {
345 if (b != null) tmpb = b.store[i];
347 for(j=i-1;j>=start;j--) {
348 if((a.store[j]-tmpa) <= 0) break;
349 a.store[j+1] = a.store[j];
350 if (b != null) b.store[j+1] = b.store[j];
353 if (b != null) b.store[j+1] = tmpb;
358 int pivot = a.store[end];
363 while((a.store[++lo]-pivot) < 0) { }
364 while((hi > lo) && (a.store[--hi]-pivot) > 0) { }
366 if (b != null) swap(b, lo,hi);
370 if (b != null) swap(b, lo,end);
372 sort(a, b, start, lo-1);
373 sort(a, b, lo+1, end);
376 private static final void swap(Vec.Int vec, int a, int b) {
378 int tmp = vec.store[a];
379 vec.store[a] = vec.store[b];
384 public static final void sortInts(int[] a, int start, int end) {
386 if(start >= end) return;
388 for(int i=start+1;i<=end;i++) {
391 for(j=i-1;j>=start;j--) {
392 if(a[j] <= tmpa) break;
405 while(a[++lo] < pivot) { }
406 while((hi > lo) && a[--hi] > pivot) { }
409 swapInts(a, lo, end);
410 sortInts(a, start, lo-1);
411 sortInts(a, lo+1, end);
414 private static final void swapInts(int[] vec, int a, int b) {
425 public static final void sortFloats(float[] a, int start, int end) {
427 if(start >= end) return;
429 for(int i=start+1;i<=end;i++) {
432 for(j=i-1;j>=start;j--) {
433 if(a[j] <= tmpa) break;
440 float pivot = a[end];
444 while(a[++lo] < pivot) { }
445 while((hi > lo) && a[--hi] > pivot) { }
446 swapFloats(a, lo, hi);
448 swapFloats(a, lo, end);
449 sortFloats(a, start, lo-1);
450 sortFloats(a, lo+1, end);
452 private static final void swapFloats(float[] vec, int a, int b) {