void ensureCapacity(final int minCapacity) {
    if (elementData == null) {
      elementData = new Content[Math.max(minCapacity, INITIAL_ARRAY_SIZE)];
      return;
    }
    else if (minCapacity < elementData.length) {
      return;
    }
    // use algorithm Wilf suggests which is essentially the same
    // as algorithm as ArrayList.ensureCapacity....
    // typically the minCapacity is only slightly larger than
    // the current capacity.... so grow from the current capacity
    // with a double-check.
    final int newcap = ((size * 3) / 2) + 1;
    final int len = (Math.max(newcap, minCapacity));
    elementData = Arrays.copyOf(elementData, len);
  }
void ensureCapacity(final int minCapacity)