private void grow(int newCapacity) { E[] newData = newElementArray(newCapacity); // Assumes elementCount is <= newCapacity // assert elementCount <= newCapacity; System.arraycopy(elementData, 0, newData, 0, elementCount); elementData = newData; }
/** * JIT optimization */ private void growByOne() { int adding = 0; if (capacityIncrement <= 0) { if ((adding = elementData.length) == 0) { adding = 1; } } else { adding = capacityIncrement; } E[] newData = newElementArray(elementData.length + adding); System.arraycopy(elementData, 0, newData, 0, elementCount); elementData = newData; }
private void growBy(int required) { int adding = 0; if (capacityIncrement <= 0) { if ((adding = elementData.length) == 0) { adding = required; } while (adding < required) { adding += adding; } } else { adding = (required / capacityIncrement) * capacityIncrement; if (adding < required) { adding += capacityIncrement; } } E[] newData = newElementArray(elementData.length + adding); System.arraycopy(elementData, 0, newData, 0, elementCount); elementData = newData; }
/** * Constructs a new vector using the specified capacity and capacity * increment. * * @param capacity * the initial capacity of the new vector. * @param capacityIncrement * the amount to increase the capacity when this vector is full. * @throws IllegalArgumentException * if {@code capacity} is negative. */ public Vector(int capacity, int capacityIncrement) { if (capacity < 0) { throw new IllegalArgumentException("capacity < 0: " + capacity); } elementData = newElementArray(capacity); elementCount = 0; this.capacityIncrement = capacityIncrement; }
private void grow(int newCapacity) { E[] newData = newElementArray(newCapacity); // Assumes elementCount is <= newCapacity // assert elementCount <= newCapacity; System.arraycopy(elementData, 0, newData, 0, elementCount); elementData = newData; }
private void grow(int newCapacity) { E[] newData = newElementArray(newCapacity); // Assumes elementCount is <= newCapacity // assert elementCount <= newCapacity; System.arraycopy(elementData, 0, newData, 0, elementCount); elementData = newData; }
private void grow(int newCapacity) { E[] newData = newElementArray(newCapacity); // Assumes elementCount is <= newCapacity // assert elementCount <= newCapacity; System.arraycopy(elementData, 0, newData, 0, elementCount); elementData = newData; }
private void grow(int newCapacity) { E[] newData = newElementArray(newCapacity); // Assumes elementCount is <= newCapacity // assert elementCount <= newCapacity; System.arraycopy(elementData, 0, newData, 0, elementCount); elementData = newData; }
private void grow(int newCapacity) { E[] newData = newElementArray(newCapacity); // Assumes elementCount is <= newCapacity // assert elementCount <= newCapacity; System.arraycopy(elementData, 0, newData, 0, elementCount); elementData = newData; }
private void grow(int newCapacity) { E[] newData = newElementArray(newCapacity); // Assumes elementCount is <= newCapacity // assert elementCount <= newCapacity; System.arraycopy(elementData, 0, newData, 0, elementCount); elementData = newData; }
private void grow(int newCapacity) { E[] newData = newElementArray(newCapacity); // Assumes elementCount is <= newCapacity // assert elementCount <= newCapacity; System.arraycopy(elementData, 0, newData, 0, elementCount); elementData = newData; }
/** * JIT optimization */ private void growByOne() { int adding = 0; if (capacityIncrement <= 0) { if ((adding = elementData.length) == 0) { adding = 1; } } else { adding = capacityIncrement; } E[] newData = newElementArray(elementData.length + adding); System.arraycopy(elementData, 0, newData, 0, elementCount); elementData = newData; }
/** * JIT optimization */ private void growByOne() { int adding = 0; if (capacityIncrement <= 0) { if ((adding = elementData.length) == 0) { adding = 1; } } else { adding = capacityIncrement; } E[] newData = newElementArray(elementData.length + adding); System.arraycopy(elementData, 0, newData, 0, elementCount); elementData = newData; }
/** * JIT optimization */ private void growByOne() { int adding = 0; if (capacityIncrement <= 0) { if ((adding = elementData.length) == 0) { adding = 1; } } else { adding = capacityIncrement; } E[] newData = newElementArray(elementData.length + adding); System.arraycopy(elementData, 0, newData, 0, elementCount); elementData = newData; }
/** * JIT optimization */ private void growByOne() { int adding = 0; if (capacityIncrement <= 0) { if ((adding = elementData.length) == 0) { adding = 1; } } else { adding = capacityIncrement; } E[] newData = newElementArray(elementData.length + adding); System.arraycopy(elementData, 0, newData, 0, elementCount); elementData = newData; }
private void growBy(int required) { int adding = 0; if (capacityIncrement <= 0) { if ((adding = elementData.length) == 0) { adding = required; } while (adding < required) { adding += adding; } } else { adding = (required / capacityIncrement) * capacityIncrement; if (adding < required) { adding += capacityIncrement; } } E[] newData = newElementArray(elementData.length + adding); System.arraycopy(elementData, 0, newData, 0, elementCount); elementData = newData; }
/** * JIT optimization */ private void growByOne() { int adding = 0; if (capacityIncrement <= 0) { if ((adding = elementData.length) == 0) { adding = 1; } } else { adding = capacityIncrement; } E[] newData = newElementArray(elementData.length + adding); System.arraycopy(elementData, 0, newData, 0, elementCount); elementData = newData; }
/** * JIT optimization */ private void growByOne() { int adding = 0; if (capacityIncrement <= 0) { if ((adding = elementData.length) == 0) { adding = 1; } } else { adding = capacityIncrement; } E[] newData = newElementArray(elementData.length + adding); System.arraycopy(elementData, 0, newData, 0, elementCount); elementData = newData; }
/** * JIT optimization */ private void growByOne() { int adding = 0; if (capacityIncrement <= 0) { if ((adding = elementData.length) == 0) { adding = 1; } } else { adding = capacityIncrement; } E[] newData = newElementArray(elementData.length + adding); System.arraycopy(elementData, 0, newData, 0, elementCount); elementData = newData; }
private void growBy(int required) { int adding = 0; if (capacityIncrement <= 0) { if ((adding = elementData.length) == 0) { adding = required; } while (adding < required) { adding += adding; } } else { adding = (required / capacityIncrement) * capacityIncrement; if (adding < required) { adding += capacityIncrement; } } E[] newData = newElementArray(elementData.length + adding); System.arraycopy(elementData, 0, newData, 0, elementCount); elementData = newData; }