/** * {@inheritDoc} */ @Override public final IoBuffer putUnsignedShort(short value) { return putShort(value); }
/** * {@inheritDoc} */ @Override public final IoBuffer putUnsignedShort(int index, short value) { return putShort(index, value); }
/** * {@inheritDoc} */ @Override public final IoBuffer putUnsignedShort(int index, short value) { return putShort(index, value); }
/** * {@inheritDoc} */ @Override public final IoBuffer putUnsignedShort(short value) { return putShort(value); }
/** * {@inheritDoc} */ @Override public IoBuffer putEnumShort(Enum<?> e) { if (e.ordinal() > SHORT_MASK) { throw new IllegalArgumentException(enumConversionErrorMessage(e, "short")); } return putShort((short) e.ordinal()); }
/** * {@inheritDoc} */ @Override public <E extends Enum<E>> IoBuffer putEnumSetShort(Set<E> set) { long vector = toLong(set); if ((vector & ~SHORT_MASK) != 0) { throw new IllegalArgumentException("The enum set is too large to fit in a short: " + set); } return putShort((short) vector); }
/** * {@inheritDoc} */ @Override public <E extends Enum<E>> IoBuffer putEnumSetShort(int index, Set<E> set) { long vector = toLong(set); if ((vector & ~SHORT_MASK) != 0) { throw new IllegalArgumentException("The enum set is too large to fit in a short: " + set); } return putShort(index, (short) vector); }
/** * {@inheritDoc} */ @Override public IoBuffer putEnumShort(int index, Enum<?> e) { if (e.ordinal() > SHORT_MASK) { throw new IllegalArgumentException(enumConversionErrorMessage(e, "short")); } return putShort(index, (short) e.ordinal()); }
/** * {@inheritDoc} */ @Override public IoBuffer putEnumShort(int index, Enum<?> e) { if (e.ordinal() > SHORT_MASK) { throw new IllegalArgumentException(enumConversionErrorMessage(e, "short")); } return putShort(index, (short) e.ordinal()); }
/** * {@inheritDoc} */ @Override public IoBuffer putEnumShort(Enum<?> e) { if (e.ordinal() > SHORT_MASK) { throw new IllegalArgumentException(enumConversionErrorMessage(e, "short")); } return putShort((short) e.ordinal()); }
/** * {@inheritDoc} */ @Override public IoBuffer putEnumShort(int index, Enum<?> e) { if (e.ordinal() > SHORT_MASK) { throw new IllegalArgumentException(enumConversionErrorMessage(e, "short")); } return putShort(index, (short) e.ordinal()); }
/** * {@inheritDoc} */ @Override public IoBuffer putEnumShort(Enum<?> e) { if (e.ordinal() > SHORT_MASK) { throw new IllegalArgumentException(enumConversionErrorMessage(e, "short")); } return putShort((short) e.ordinal()); }
/** * {@inheritDoc} */ @Override public <E extends Enum<E>> IoBuffer putEnumSetShort(int index, Set<E> set) { long vector = toLong(set); if ((vector & ~SHORT_MASK) != 0) { throw new IllegalArgumentException( "The enum set is too large to fit in a short: " + set); } return putShort(index, (short) vector); }
/** * {@inheritDoc} */ @Override public <E extends Enum<E>> IoBuffer putEnumSetShort(Set<E> set) { long vector = toLong(set); if ((vector & ~SHORT_MASK) != 0) { throw new IllegalArgumentException("The enum set is too large to fit in a short: " + set); } return putShort((short) vector); }
/** * {@inheritDoc} */ @Override public <E extends Enum<E>> IoBuffer putEnumSetShort(int index, Set<E> set) { long vector = toLong(set); if ((vector & ~SHORT_MASK) != 0) { throw new IllegalArgumentException("The enum set is too large to fit in a short: " + set); } return putShort(index, (short) vector); }
/** * {@inheritDoc} */ @Override public <E extends Enum<E>> IoBuffer putEnumSetShort(Set<E> set) { long vector = toLong(set); if ((vector & ~SHORT_MASK) != 0) { throw new IllegalArgumentException( "The enum set is too large to fit in a short: " + set); } return putShort((short) vector); }
/** * {@inheritDoc} */ @Override public IoBuffer fill(int size) { autoExpand(size); int q = size >>> 3; int r = size & 7; for (int i = q; i > 0; i--) { putLong(0L); } q = r >>> 2; r = r & 3; if (q > 0) { putInt(0); } q = r >> 1; r = r & 1; if (q > 0) { putShort((short) 0); } if (r > 0) { put((byte) 0); } return this; }
/** * {@inheritDoc} */ @Override public IoBuffer fill(int size) { autoExpand(size); int q = size >>> 3; int r = size & 7; for (int i = q; i > 0; i--) { putLong(0L); } q = r >>> 2; r = r & 3; if (q > 0) { putInt(0); } q = r >> 1; r = r & 1; if (q > 0) { putShort((short) 0); } if (r > 0) { put((byte) 0); } return this; }
/** * {@inheritDoc} */ @Override public IoBuffer fill(int size) { autoExpand(size); int q = size >>> 3; int r = size & 7; for (int i = q; i > 0; i--) { putLong(0L); } q = r >>> 2; r = r & 3; if (q > 0) { putInt(0); } q = r >> 1; r = r & 1; if (q > 0) { putShort((short) 0); } if (r > 0) { put((byte) 0); } return this; }