Java Preconditions.checkPositionIndexes方法代碼示例

import com.google.common.base.Preconditions; //導入方法依賴的package包/類
/**
 * Returns a list iterator containing the elements in the specified range of
 * {@code array} in order, starting at the specified index.
 *
 * <p>The {@code Iterable} equivalent of this method is {@code
 * Arrays.asList(array).subList(offset, offset + length).listIterator(index)}.
 */
static <T> UnmodifiableListIterator<T> forArray(
    final T[] array, final int offset, int length, int index) {
  checkArgument(length >= 0);
  int end = offset + length;

  // Technically we should give a slightly more descriptive error on overflow
  Preconditions.checkPositionIndexes(offset, end, array.length);
  Preconditions.checkPositionIndex(index, length);
  if (length == 0) {
    return emptyListIterator();
  }
  return new ArrayItr<T>(array, offset, length, index);
}
 

import com.google.common.base.Preconditions; //導入方法依賴的package包/類
@Override
public ImmutableList<E> subList(int fromIndex, int toIndex) {
  Preconditions.checkPositionIndexes(fromIndex, toIndex, 1);
  return (fromIndex == toIndex) ? ImmutableList.<E>of() : this;
}
 

import com.google.common.base.Preconditions; //導入方法依賴的package包/類
/**
 * Returns a new immutable array containing the values in the specified range.
 *
 * <p><b>Performance note:</b> The returned array has the same full memory footprint as this one
 * does (no actual copying is performed). To reduce memory usage, use {@code subArray(start,
 * end).trimmed()}.
 */
public ImmutableIntArray subArray(int startIndex, int endIndex) {
  Preconditions.checkPositionIndexes(startIndex, endIndex, length());
  return startIndex == endIndex
      ? EMPTY
      : new ImmutableIntArray(array, start + startIndex, start + endIndex);
}
 

import com.google.common.base.Preconditions; //導入方法依賴的package包/類
/**
 * Copies bytes from this hash code into {@code dest}.
 *
 * @param dest the byte array into which the hash code will be written
 * @param offset the start offset in the data
 * @param maxLength the maximum number of bytes to write
 * @return the number of bytes written to {@code dest}
 * @throws IndexOutOfBoundsException if there is not enough room in {@code dest}
 */
@CanIgnoreReturnValue
public int writeBytesTo(byte[] dest, int offset, int maxLength) {
  maxLength = Ints.min(maxLength, bits() / 8);
  Preconditions.checkPositionIndexes(offset, offset + maxLength, dest.length);
  writeBytesToImpl(dest, offset, maxLength);
  return maxLength;
}