int newLength = (length * 3)/2 + 1; System.out.println("reallocating " + length + " -> " + newLength);
final int newLength = length << 1;
		void add(NodeProxy p) {			// just check if this node has already been added. We only			// check the last entry, which should avoid most of the likely 			// duplicates. The remaining duplicates are removed by			// removeDuplicates().			if(length > 0 && array[length - 1].gid == p.gid) {				return;			}			if (length == array.length) {				int newLength = (length * 3)/2 + 1;				System.out.println("reallocating " + length + " -> " + newLength);				NodeProxy temp[] = new NodeProxy[newLength];				System.arraycopy(array, 0, temp, 0, length);				array = temp;			}			array[length++] = p;		}