本文整理了Java中java.util.Vector.grow()方法的一些代码示例，展示了Vector.grow()的具体用法。这些代码示例主要来源于Github/Stackoverflow/Maven等平台，是从一些精选项目中提取出来的代码，具有较强的参考意义，能在一定程度帮忙到你。Vector.grow()方法的具体详情如下：
包路径：java.util.Vector
类名称：Vector
方法名：grow

Vector.grow介绍

[英]JIT optimization
[中]准时制优化

代码示例

代码示例来源：origin: robovm/robovm

/**
 * Sets the capacity of this vector to be the same as the size.
 *
 * @see #capacity
 * @see #ensureCapacity
 * @see #size
 */
public synchronized void trimToSize() {
  if (elementData.length != elementCount) {
    grow(elementCount);
  }
}

代码示例来源：origin: robovm/robovm

/**
 * Ensures that this vector can hold the specified number of elements
 * without growing.
 *
 * @param minimumCapacity
 *            the minimum number of elements that this vector will hold
 *            before growing.
 * @see #capacity
 */
public synchronized void ensureCapacity(int minimumCapacity) {
  if (elementData.length < minimumCapacity) {
    int next = (capacityIncrement <= 0 ? elementData.length
        : capacityIncrement)
        + elementData.length;
    grow(minimumCapacity > next ? minimumCapacity : next);
  }
}

代码示例来源：origin: FlexoVM/flexovm

/**
 * Sets the capacity of this vector to be the same as the size.
 *
 * @see #capacity
 * @see #ensureCapacity
 * @see #size
 */
public synchronized void trimToSize() {
  if (elementData.length != elementCount) {
    grow(elementCount);
  }
}

代码示例来源：origin: com.jtransc/jtransc-rt

/**
 * Sets the capacity of this vector to be the same as the size.
 *
 * @see #capacity
 * @see #ensureCapacity
 * @see #size
 */
public synchronized void trimToSize() {
  if (elementData.length != elementCount) {
    grow(elementCount);
  }
}

代码示例来源：origin: MobiVM/robovm

/**
 * Sets the capacity of this vector to be the same as the size.
 *
 * @see #capacity
 * @see #ensureCapacity
 * @see #size
 */
public synchronized void trimToSize() {
  if (elementData.length != elementCount) {
    grow(elementCount);
  }
}

代码示例来源：origin: ibinti/bugvm

/**
 * Sets the capacity of this vector to be the same as the size.
 *
 * @see #capacity
 * @see #ensureCapacity
 * @see #size
 */
public synchronized void trimToSize() {
  if (elementData.length != elementCount) {
    grow(elementCount);
  }
}

代码示例来源：origin: com.mobidevelop.robovm/robovm-rt

/**
 * Sets the capacity of this vector to be the same as the size.
 *
 * @see #capacity
 * @see #ensureCapacity
 * @see #size
 */
public synchronized void trimToSize() {
  if (elementData.length != elementCount) {
    grow(elementCount);
  }
}

代码示例来源：origin: com.bugvm/bugvm-rt

/**
 * Sets the capacity of this vector to be the same as the size.
 *
 * @see #capacity
 * @see #ensureCapacity
 * @see #size
 */
public synchronized void trimToSize() {
  if (elementData.length != elementCount) {
    grow(elementCount);
  }
}

代码示例来源：origin: com.gluonhq/robovm-rt

/**
 * Sets the capacity of this vector to be the same as the size.
 *
 * @see #capacity
 * @see #ensureCapacity
 * @see #size
 */
public synchronized void trimToSize() {
  if (elementData.length != elementCount) {
    grow(elementCount);
  }
}

代码示例来源：origin: jtulach/bck2brwsr

/**
 * This implements the unsynchronized semantics of ensureCapacity.
 * Synchronized methods in this class can internally call this
 * method for ensuring capacity without incurring the cost of an
 * extra synchronization.
 *
 * @see #ensureCapacity(int)
 */
private void ensureCapacityHelper(int minCapacity) {
  // overflow-conscious code
  if (minCapacity - elementData.length > 0)
    grow(minCapacity);
}

代码示例来源：origin: org.apidesign.bck2brwsr/emul

/**
 * This implements the unsynchronized semantics of ensureCapacity.
 * Synchronized methods in this class can internally call this
 * method for ensuring capacity without incurring the cost of an
 * extra synchronization.
 *
 * @see #ensureCapacity(int)
 */
private void ensureCapacityHelper(int minCapacity) {
  // overflow-conscious code
  if (minCapacity - elementData.length > 0)
    grow(minCapacity);
}

代码示例来源：origin: com.mobidevelop.robovm/robovm-rt

/**
 * Ensures that this vector can hold the specified number of elements
 * without growing.
 *
 * @param minimumCapacity
 *            the minimum number of elements that this vector will hold
 *            before growing.
 * @see #capacity
 */
public synchronized void ensureCapacity(int minimumCapacity) {
  if (elementData.length < minimumCapacity) {
    int next = (capacityIncrement <= 0 ? elementData.length
        : capacityIncrement)
        + elementData.length;
    grow(minimumCapacity > next ? minimumCapacity : next);
  }
}

代码示例来源：origin: com.bugvm/bugvm-rt

/**
 * Ensures that this vector can hold the specified number of elements
 * without growing.
 *
 * @param minimumCapacity
 *            the minimum number of elements that this vector will hold
 *            before growing.
 * @see #capacity
 */
public synchronized void ensureCapacity(int minimumCapacity) {
  if (elementData.length < minimumCapacity) {
    int next = (capacityIncrement <= 0 ? elementData.length
        : capacityIncrement)
        + elementData.length;
    grow(minimumCapacity > next ? minimumCapacity : next);
  }
}

代码示例来源：origin: com.jtransc/jtransc-rt

/**
 * Ensures that this vector can hold the specified number of elements
 * without growing.
 *
 * @param minimumCapacity
 *            the minimum number of elements that this vector will hold
 *            before growing.
 * @see #capacity
 */
public synchronized void ensureCapacity(int minimumCapacity) {
  if (elementData.length < minimumCapacity) {
    int next = (capacityIncrement <= 0 ? elementData.length
        : capacityIncrement)
        + elementData.length;
    grow(minimumCapacity > next ? minimumCapacity : next);
  }
}

代码示例来源：origin: MobiVM/robovm

/**
 * Ensures that this vector can hold the specified number of elements
 * without growing.
 *
 * @param minimumCapacity
 *            the minimum number of elements that this vector will hold
 *            before growing.
 * @see #capacity
 */
public synchronized void ensureCapacity(int minimumCapacity) {
  if (elementData.length < minimumCapacity) {
    int next = (capacityIncrement <= 0 ? elementData.length
        : capacityIncrement)
        + elementData.length;
    grow(minimumCapacity > next ? minimumCapacity : next);
  }
}

代码示例来源：origin: ibinti/bugvm

/**
 * Ensures that this vector can hold the specified number of elements
 * without growing.
 *
 * @param minimumCapacity
 *            the minimum number of elements that this vector will hold
 *            before growing.
 * @see #capacity
 */
public synchronized void ensureCapacity(int minimumCapacity) {
  if (elementData.length < minimumCapacity) {
    int next = (capacityIncrement <= 0 ? elementData.length
        : capacityIncrement)
        + elementData.length;
    grow(minimumCapacity > next ? minimumCapacity : next);
  }
}

代码示例来源：origin: com.gluonhq/robovm-rt

/**
 * Ensures that this vector can hold the specified number of elements
 * without growing.
 *
 * @param minimumCapacity
 *            the minimum number of elements that this vector will hold
 *            before growing.
 * @see #capacity
 */
public synchronized void ensureCapacity(int minimumCapacity) {
  if (elementData.length < minimumCapacity) {
    int next = (capacityIncrement <= 0 ? elementData.length
        : capacityIncrement)
        + elementData.length;
    grow(minimumCapacity > next ? minimumCapacity : next);
  }
}

代码示例来源：origin: FlexoVM/flexovm

/**
 * Ensures that this vector can hold the specified number of elements
 * without growing.
 *
 * @param minimumCapacity
 *            the minimum number of elements that this vector will hold
 *            before growing.
 * @see #capacity
 */
public synchronized void ensureCapacity(int minimumCapacity) {
  if (elementData.length < minimumCapacity) {
    int next = (capacityIncrement <= 0 ? elementData.length
        : capacityIncrement)
        + elementData.length;
    grow(minimumCapacity > next ? minimumCapacity : next);
  }
}