FileDocCategorySizeDatePackage
IntegerArray.javaAPI DocJava SE 5 API4716Fri Aug 26 14:55:42 BST 2005com.sun.org.apache.xalan.internal.xsltc.util

IntegerArray

public final class IntegerArray extends Object
author
Jacek Ambroziak

Fields Summary
private static final int
InitialSize
private int[]
_array
private int
_size
private int
_free
Constructors Summary
public IntegerArray()

  
      
	this(InitialSize);
    
public IntegerArray(int size)

	_array = new int[_size = size];
    
public IntegerArray(int[] array)

	this(array.length);
	System.arraycopy(array, 0, _array, 0, _free = _size);
    
Methods Summary
public final voidadd(int value)

	if (_free == _size) {
	    growArray(_size * 2);
	}
	_array[_free++] = value;
    
public voidaddNew(int value)
Adds new int at the end if not already present.

	for (int i = 0; i < _free; i++) {
	    if (_array[i] == value) return;  // already in array
	}
	add(value);
    
public final intat(int index)

	return _array[index];
    
public final intcardinality()

	return _free;
    
public voidclear()

	_free = 0;
    
public java.lang.Objectclone()

	final IntegerArray clone = new IntegerArray(_free > 0 ? _free : 1);
	System.arraycopy(_array, 0, clone._array, 0, _free);
	clone._free = _free;
	return clone;
    
private voidgrowArray(int size)

	final int[] newArray = new int[_size = size];
	System.arraycopy(_array, 0, newArray, 0, _free);
	_array = newArray;
    
public intindexOf(int n)

	for (int i = 0; i < _free; i++) {
	    if (n == _array[i]) return i;
	}
	return -1;
    
public intlast()

	return _array[_free - 1];
    
public voidmerge(com.sun.org.apache.xalan.internal.xsltc.util.IntegerArray other)
Merge two sorted arrays and eliminate duplicates.

	final int newSize = _free + other._free;
// System.out.println("IntegerArray.merge() begin newSize = " + newSize);
	int[] newArray = new int[newSize];

	// Merge the two arrays
	int i = 0, j = 0, k;
	for (k = 0; i < _free && j < other._free; k++) {
	    int x = _array[i];
	    int y = other._array[j];

	    if (x < y) {
		newArray[k] = x;
		i++;
	    }
	    else if (x > y) {
		newArray[k] = y;
		j++;
	    }
	    else {
		newArray[k] = x;
		i++; j++;
	    }
	}

	// Copy the rest if of different lengths
	if (i >= _free) {
	    while (j < other._free) {
		newArray[k++] = other._array[j++];
	    }
	}
	else {
	    while (i < _free) {
		newArray[k++] = _array[i++];
	    }
	}

	// Update reference to this array
	_array = newArray;
	_free = _size = newSize;
// System.out.println("IntegerArray.merge() end");
    
private static intpartition(int[] array, int p, int r)

	final int x = array[(p + r) >>> 1];
	int i = p - 1; int j = r + 1;

	while (true) {
	    while (x < array[--j]);
	    while (x > array[++i]);
	    if (i < j) {
		int temp = array[i];
		array[i] = array[j];
		array[j] = temp;
	    }
	    else {
		return j;
	    }
	}
    
public voidpop()

	_free--;
    
public voidpop(int n)

	_free -= n;
    
public intpopLast()

	return _array[--_free];
    
public voidprint(java.io.PrintStream out)

	if (_free > 0) {
	    for (int i = 0; i < _free - 1; i++) {
		out.print(_array[i]);
		out.print(' ");
	    }
	    out.println(_array[_free - 1]);
	}
	else {
	    out.println("IntegerArray: empty");
	}
    
private static voidquicksort(int[] array, int p, int r)

	if (p < r) {
	    final int q = partition(array, p, r);
	    quicksort(array, p, q);
	    quicksort(array, q + 1, r);
	}
    
public voidreverse()

	int left = 0; 
	int right = _free - 1;

	while (left < right) {
	    int temp = _array[left];
	    _array[left++] = _array[right];
	    _array[right--] = temp;
	}
    
public final voidset(int index, int value)

	_array[index] = value;
    
public voidsetLast(int n)

	_array[_free - 1] = n;
    
public voidsort()

	quicksort(_array, 0, _free - 1);
    
public int[]toIntArray()

	final int[] result = new int[cardinality()];
	System.arraycopy(_array, 0, result, 0, cardinality());
	return result;