This class defines four categories of operations upon * short buffers: * *
Absolute and relative {@link #get() get} and * {@link #put(short) put} methods that read and write * single shorts;
Absolute and relative {@link #get(short[]) bulk get} * methods that transfer contiguous sequences of shorts from this buffer * into an array; and
Absolute and relative {@link #put(short[]) bulk put} * methods that transfer contiguous sequences of shorts from a * short array or some other short * buffer into this buffer; and
A method for {@link #compact compacting} * a short buffer.
Short buffers can be created either by {@link #allocate * allocation}, which allocates space for the buffer's * * * content, by {@link #wrap(short[]) wrapping} an existing * short array into a buffer, or by creating a * view of an existing byte buffer. * * * * *
Like a byte buffer, a short buffer is either direct or non-direct. A * short buffer created via the {@code wrap} methods of this class will * be non-direct. A short buffer created as a view of a byte buffer will * be direct if, and only if, the byte buffer itself is direct. Whether or not * a short buffer is direct may be determined by invoking the {@link * #isDirect isDirect} method.
* * * * * Methods in this class that do not otherwise have a value to return are
* specified to return the buffer upon which they are invoked. This allows
* method invocations to be chained.
*
*
*
* @author Mark Reinhold
* @author JSR-51 Expert Group
* @since 1.4
*/
public abstract class ShortBuffer
extends Buffer
implements Comparable The new buffer's position will be zero, its limit will be its
* capacity, its mark will be undefined, each of its elements will be
* initialized to zero, and its byte order will be
* the {@link ByteOrder#nativeOrder native order} of the underlying
* hardware.
* It will have a {@link #array backing array}, and its
* {@link #arrayOffset array offset} will be zero.
*
* @param capacity
* The new buffer's capacity, in shorts
*
* @return The new short buffer
*
* @throws IllegalArgumentException
* If the {@code capacity} is a negative integer
*/
public static ShortBuffer allocate(int capacity) {
if (capacity < 0)
throw createCapacityException(capacity);
// Android-removed: Removed MemorySegmentProxy not supported yet.
return new HeapShortBuffer(capacity, capacity);
}
/**
* Wraps a short array into a buffer.
*
* The new buffer will be backed by the given short array;
* that is, modifications to the buffer will cause the array to be modified
* and vice versa. The new buffer's capacity will be
* {@code array.length}, its position will be {@code offset}, its limit
* will be {@code offset + length}, its mark will be undefined, and its
* byte order will be
* the {@link ByteOrder#nativeOrder native order} of the underlying
* hardware.
* Its {@link #array backing array} will be the given array, and
* its {@link #arrayOffset array offset} will be zero. The new buffer will be backed by the given short array;
* that is, modifications to the buffer will cause the array to be modified
* and vice versa. The new buffer's capacity and limit will be
* {@code array.length}, its position will be zero, its mark will be
* undefined, and its byte order will be
* the {@link ByteOrder#nativeOrder native order} of the underlying
* hardware.
* Its {@link #array backing array} will be the given array, and its
* {@link #arrayOffset array offset} will be zero. The content of the new buffer will start at this buffer's current
* position. Changes to this buffer's content will be visible in the new
* buffer, and vice versa; the two buffers' position, limit, and mark
* values will be independent.
*
* The new buffer's position will be zero, its capacity and its limit
* will be the number of shorts remaining in this buffer, its mark will be
* undefined, and its byte order will be
* identical to that of this buffer.
* The new buffer will be direct if, and only if, this buffer is direct, and
* it will be read-only if, and only if, this buffer is read-only. The content of the new buffer will start at position {@code index}
* in this buffer, and will contain {@code length} elements. Changes to
* this buffer's content will be visible in the new buffer, and vice versa;
* the two buffers' position, limit, and mark values will be independent.
*
* The new buffer's position will be zero, its capacity and its limit
* will be {@code length}, its mark will be undefined, and its byte order
* will be
* identical to that of this buffer.
* The new buffer will be direct if, and only if, this buffer is direct,
* and it will be read-only if, and only if, this buffer is read-only. The content of the new buffer will be that of this buffer. Changes
* to this buffer's content will be visible in the new buffer, and vice
* versa; the two buffers' position, limit, and mark values will be
* independent.
*
* The new buffer's capacity, limit, position,
* mark values, and byte order will be identical to those of this buffer.
* The new buffer will be direct if, and only if, this buffer is direct, and
* it will be read-only if, and only if, this buffer is read-only. The content of the new buffer will be that of this buffer. Changes
* to this buffer's content will be visible in the new buffer; the new
* buffer itself, however, will be read-only and will not allow the shared
* content to be modified. The two buffers' position, limit, and mark
* values will be independent.
*
* The new buffer's capacity, limit, position,
* mark values, and byte order will be identical to those of this buffer.
*
* If this buffer is itself read-only then this method behaves in
* exactly the same way as the {@link #duplicate duplicate} method. Writes the given short into this buffer at the current
* position, and then increments the position. Writes the given short into this buffer at the given
* index. This method transfers shorts from this buffer into the given
* destination array. If there are fewer shorts remaining in the
* buffer than are required to satisfy the request, that is, if
* {@code length} {@code >} {@code remaining()}, then no
* shorts are transferred and a {@link BufferUnderflowException} is
* thrown.
*
* Otherwise, this method copies {@code length} shorts from this
* buffer into the given array, starting at the current position of this
* buffer and at the given offset in the array. The position of this
* buffer is then incremented by {@code length}.
*
* In other words, an invocation of this method of the form
* This method transfers shorts from this buffer into the given
* destination array. An invocation of this method of the form
* {@code src.get(a)} behaves in exactly the same way as the invocation
*
* This method transfers {@code length} shorts from this
* buffer into the given array, starting at the given index in this
* buffer and at the given offset in the array. The position of this
* buffer is unchanged.
*
* An invocation of this method of the form
* This method transfers shorts from this buffer into the given
* destination array. The position of this buffer is unchanged. An
* invocation of this method of the form
* This method transfers the shorts remaining in the given source
* buffer into this buffer. If there are more shorts remaining in the
* source buffer than in this buffer, that is, if
* {@code src.remaining()} {@code >} {@code remaining()},
* then no shorts are transferred and a {@link
* BufferOverflowException} is thrown.
*
* Otherwise, this method copies
* n = {@code src.remaining()} shorts from the given
* buffer into this buffer, starting at each buffer's current position.
* The positions of both buffers are then incremented by n.
*
* In other words, an invocation of this method of the form
* {@code dst.put(src)} has exactly the same effect as the loop
*
* This method transfers {@code length} shorts into this buffer from
* the given source buffer, starting at the given {@code offset} in the
* source buffer and the given {@code index} in this buffer. The positions
* of both buffers are unchanged.
*
* In other words, an invocation of this method of the form
* This method transfers shorts into this buffer from the given
* source array. If there are more shorts to be copied from the array
* than remain in this buffer, that is, if
* {@code length} {@code >} {@code remaining()}, then no
* shorts are transferred and a {@link BufferOverflowException} is
* thrown.
*
* Otherwise, this method copies {@code length} shorts from the
* given array into this buffer, starting at the given offset in the array
* and at the current position of this buffer. The position of this buffer
* is then incremented by {@code length}.
*
* In other words, an invocation of this method of the form
* This method transfers the entire content of the given source
* short array into this buffer. An invocation of this method of the
* form {@code dst.put(a)} behaves in exactly the same way as the
* invocation
*
* This method transfers {@code length} shorts from the given
* array, starting at the given offset in the array and at the given index
* in this buffer. The position of this buffer is unchanged.
*
* An invocation of this method of the form
* This method copies shorts into this buffer from the given source
* array. The position of this buffer is unchanged. An invocation of this
* method of the form If this method returns {@code true} then the {@link #array() array}
* and {@link #arrayOffset() arrayOffset} methods may safely be invoked.
* Modifications to this buffer's content will cause the returned
* array's content to be modified, and vice versa.
*
* Invoke the {@link #hasArray hasArray} method before invoking this
* method in order to ensure that this buffer has an accessible backing
* array. If this buffer is backed by an array then buffer position p
* corresponds to array index p + {@code arrayOffset()}.
*
* Invoke the {@link #hasArray hasArray} method before invoking this
* method in order to ensure that this buffer has an accessible backing
* array. The shorts between the buffer's current position and its limit,
* if any, are copied to the beginning of the buffer. That is, the
* short at index p = {@code position()} is copied
* to index zero, the short at index p + 1 is copied
* to index one, and so forth until the short at index
* {@code limit()} - 1 is copied to index
* n = {@code limit()} - {@code 1} - p.
* The buffer's position is then set to n+1 and its limit is set to
* its capacity. The mark, if defined, is discarded.
*
* The buffer's position is set to the number of shorts copied,
* rather than to zero, so that an invocation of this method can be
* followed immediately by an invocation of another relative put
* method. The hash code of a short buffer depends only upon its remaining
* elements; that is, upon the elements from {@code position()} up to, and
* including, the element at {@code limit()} - {@code 1}.
*
* Because buffer hash codes are content-dependent, it is inadvisable
* to use buffers as keys in hash maps or similar data structures unless it
* is known that their contents will not change. Two short buffers are equal if, and only if,
*
* They have the same element type, They have the same number of remaining elements, and
* The two sequences of remaining elements, considered
* independently of their starting positions, are pointwise equal.
* A short buffer is not equal to any other type of object. Two short buffers are compared by comparing their sequences of
* remaining elements lexicographically, without regard to the starting
* position of each sequence within its corresponding buffer.
* Pairs of {@code short} elements are compared as if by invoking
* {@link Short#compare(short,short)}.
*
* A short buffer is not comparable to any other type of object.
*
* @return A negative integer, zero, or a positive integer as this buffer
* is less than, equal to, or greater than the given buffer
*/
public int compareTo(ShortBuffer that) {
int thisPos = this.position();
int thisRem = this.limit() - thisPos;
int thatPos = that.position();
int thatRem = that.limit() - thatPos;
int length = Math.min(thisRem, thatRem);
if (length < 0)
return -1;
int i = BufferMismatch.mismatch(this, thisPos,
that, thatPos,
length);
if (i >= 0) {
return compare(this.get(thisPos + i), that.get(thatPos + i));
}
return thisRem - thatRem;
}
private static int compare(short x, short y) {
return Short.compare(x, y);
}
/**
* Finds and returns the relative index of the first mismatch between this
* buffer and a given buffer. The index is relative to the
* {@link #position() position} of each buffer and will be in the range of
* 0 (inclusive) up to the smaller of the {@link #remaining() remaining}
* elements in each buffer (exclusive).
*
* If the two buffers share a common prefix then the returned index is
* the length of the common prefix and it follows that there is a mismatch
* between the two buffers at that index within the respective buffers.
* If one buffer is a proper prefix of the other then the returned index is
* the smaller of the remaining elements in each buffer, and it follows that
* the index is only valid for the buffer with the larger number of
* remaining elements.
* Otherwise, there is no mismatch.
*
* @param that
* The byte buffer to be tested for a mismatch with this buffer
*
* @return The relative index of the first mismatch between this and the
* given buffer, otherwise -1 if no mismatch.
*
* @since 11
*/
public int mismatch(ShortBuffer that) {
int thisPos = this.position();
int thisRem = this.limit() - thisPos;
int thatPos = that.position();
int thatRem = that.limit() - thatPos;
int length = Math.min(thisRem, thatRem);
if (length < 0)
return -1;
int r = BufferMismatch.mismatch(this, thisPos,
that, thatPos,
length);
return (r == -1 && thisRem != thatRem) ? length : r;
}
// -- Other char stuff --
// -- Other byte stuff: Access to binary data --
/**
* Retrieves this buffer's byte order.
*
* The byte order of a short buffer created by allocation or by
* wrapping an existing {@code short} array is the {@link
* ByteOrder#nativeOrder native order} of the underlying
* hardware. The byte order of a short buffer created as a view of a byte buffer is that of the
* byte buffer at the moment that the view is created. src.get(dst, off, len) has exactly the same effect as
* the loop
*
* {@code
* for (int i = off; i < off + len; i++)
* dst[i] = src.get();
* }
*
* except that it first checks that there are sufficient shorts in
* this buffer and it is potentially much more efficient.
*
* @param dst
* The array into which shorts are to be written
*
* @param offset
* The offset within the array of the first short to be
* written; must be non-negative and no larger than
* {@code dst.length}
*
* @param length
* The maximum number of shorts to be written to the given
* array; must be non-negative and no larger than
* {@code dst.length - offset}
*
* @return This buffer
*
* @throws BufferUnderflowException
* If there are fewer than {@code length} shorts
* remaining in this buffer
*
* @throws IndexOutOfBoundsException
* If the preconditions on the {@code offset} and {@code length}
* parameters do not hold
*/
public ShortBuffer get(short[] dst, int offset, int length) {
Objects.checkFromIndexSize(offset, length, dst.length);
int pos = position();
if (length > limit() - pos)
throw new BufferUnderflowException();
getArray(pos, dst, offset, length);
position(pos + length);
return this;
}
/**
* Relative bulk get method.
*
*
* src.get(a, 0, a.length)
*
* @param dst
* The destination array
*
* @return This buffer
*
* @throws BufferUnderflowException
* If there are fewer than {@code length} shorts
* remaining in this buffer
*/
public ShortBuffer get(short[] dst) {
return get(dst, 0, dst.length);
}
/**
* Absolute bulk get method.
*
* src.get(index, dst, offset, length)
* has exactly the same effect as the following loop except that it first
* checks the consistency of the supplied parameters and it is potentially
* much more efficient:
*
* {@code
* for (int i = offset, j = index; i < offset + length; i++, j++)
* dst[i] = src.get(j);
* }
*
* @param index
* The index in this buffer from which the first short will be
* read; must be non-negative and less than {@code limit()}
*
* @param dst
* The destination array
*
* @param offset
* The offset within the array of the first short to be
* written; must be non-negative and less than
* {@code dst.length}
*
* @param length
* The number of shorts to be written to the given array;
* must be non-negative and no larger than the smaller of
* {@code limit() - index} and {@code dst.length - offset}
*
* @return This buffer
*
* @throws IndexOutOfBoundsException
* If the preconditions on the {@code index}, {@code offset}, and
* {@code length} parameters do not hold
*
* @since 13
*/
public ShortBuffer get(int index, short[] dst, int offset, int length) {
Objects.checkFromIndexSize(index, length, limit());
Objects.checkFromIndexSize(offset, length, dst.length);
getArray(index, dst, offset, length);
return this;
}
/**
* Absolute bulk get method.
*
* src.get(index, dst) behaves in exactly the same
* way as the invocation:
*
*
* src.get(index, dst, 0, dst.length)
*
* @param index
* The index in this buffer from which the first short will be
* read; must be non-negative and less than {@code limit()}
*
* @param dst
* The destination array
*
* @return This buffer
*
* @throws IndexOutOfBoundsException
* If {@code index} is negative, not smaller than {@code limit()},
* or {@code limit() - index < dst.length}
*
* @since 13
*/
public ShortBuffer get(int index, short[] dst) {
return get(index, dst, 0, dst.length);
}
private ShortBuffer getArray(int index, short[] dst, int offset, int length) {
// Android-changed: ScopedMemoryAccess is not yet supported.
/*
if (
((long)length << 1) > Bits.JNI_COPY_TO_ARRAY_THRESHOLD) {
long bufAddr = address + ((long)index << 1);
long dstOffset =
ARRAY_BASE_OFFSET + ((long)offset << 1);
long len = (long)length << 1;
try {
if (order() != ByteOrder.nativeOrder())
SCOPED_MEMORY_ACCESS.copySwapMemory(
scope(), null, base(), bufAddr,
dst, dstOffset, len, Short.BYTES);
else
SCOPED_MEMORY_ACCESS.copyMemory(
scope(), null, base(), bufAddr,
dst, dstOffset, len);
} finally {
Reference.reachabilityFence(this);
}
} else {
int end = offset + length;
for (int i = offset, j = index; i < end; i++, j++) {
dst[i] = get(j);
}
}
*/
int end = offset + length;
for (int i = offset, j = index; i < end; i++, j++) {
dst[i] = get(j);
}
return this;
}
// -- Bulk put operations --
/**
* Relative bulk put method (optional operation).
*
*
* while (src.hasRemaining())
* dst.put(src.get());
*
* except that it first checks that there is sufficient space in this
* buffer and it is potentially much more efficient. If this buffer and
* the source buffer share the same backing array or memory, then the
* result will be as if the source elements were first copied to an
* intermediate location before being written into this buffer.
*
* @param src
* The source buffer from which shorts are to be read;
* must not be this buffer
*
* @return This buffer
*
* @throws BufferOverflowException
* If there is insufficient space in this buffer
* for the remaining shorts in the source buffer
*
* @throws IllegalArgumentException
* If the source buffer is this buffer
*
* @throws ReadOnlyBufferException
* If this buffer is read-only
*/
public ShortBuffer put(ShortBuffer src) {
if (src == this)
throw createSameBufferException();
if (isReadOnly())
throw new ReadOnlyBufferException();
int srcPos = src.position();
int srcLim = src.limit();
int srcRem = (srcPos <= srcLim ? srcLim - srcPos : 0);
int pos = position();
int lim = limit();
int rem = (pos <= lim ? lim - pos : 0);
if (srcRem > rem)
throw new BufferOverflowException();
putBuffer(pos, src, srcPos, srcRem);
position(pos + srcRem);
src.position(srcPos + srcRem);
return this;
}
/**
* Absolute bulk put method (optional operation).
*
* dst.put(index, src, offset, length)
* has exactly the same effect as the loop
*
* {@code
* for (int i = offset, j = index; i < offset + length; i++, j++)
* dst.put(j, src.get(i));
* }
*
* except that it first checks the consistency of the supplied parameters
* and it is potentially much more efficient. If this buffer and
* the source buffer share the same backing array or memory, then the
* result will be as if the source elements were first copied to an
* intermediate location before being written into this buffer.
*
* @param index
* The index in this buffer at which the first short will be
* written; must be non-negative and less than {@code limit()}
*
* @param src
* The buffer from which shorts are to be read
*
* @param offset
* The index within the source buffer of the first short to be
* read; must be non-negative and less than {@code src.limit()}
*
* @param length
* The number of shorts to be read from the given buffer;
* must be non-negative and no larger than the smaller of
* {@code limit() - index} and {@code src.limit() - offset}
*
* @return This buffer
*
* @throws IndexOutOfBoundsException
* If the preconditions on the {@code index}, {@code offset}, and
* {@code length} parameters do not hold
*
* @throws ReadOnlyBufferException
* If this buffer is read-only
*
* @since 16
*/
public ShortBuffer put(int index, ShortBuffer src, int offset, int length) {
Objects.checkFromIndexSize(index, length, limit());
Objects.checkFromIndexSize(offset, length, src.limit());
if (isReadOnly())
throw new ReadOnlyBufferException();
putBuffer(index, src, offset, length);
return this;
}
void putBuffer(int pos, ShortBuffer src, int srcPos, int n) {
// Android-changed: ScopedMemoryAccess is not yet supported.
/*
Object srcBase = src.base();
assert srcBase != null || src.isDirect();
Object base = base();
assert base != null || isDirect();
long srcAddr = src.address + ((long)srcPos << 1);
long addr = address + ((long)pos << 1);
long len = (long)n << 1;
try {
if (this.order() != src.order())
SCOPED_MEMORY_ACCESS.copySwapMemory(
src.scope(), scope(), srcBase, srcAddr,
base, addr, len, Short.BYTES);
else
SCOPED_MEMORY_ACCESS.copyMemory(
src.scope(), scope(), srcBase, srcAddr,
base, addr, len);
} finally {
Reference.reachabilityFence(src);
Reference.reachabilityFence(this);
}
*/
if (this.hb != null) {
if (src.hb != null) {
System.arraycopy(src.hb, srcPos + src.offset, hb, pos + offset, n);
} else {
// this and src don't share the same backed short[].
src.get(srcPos, this.hb, pos + offset, n);
}
return;
} else if (src.hb != null) {
// this and src don't share the same backed short[].
this.put(pos, src.hb, srcPos + src.offset, n);
return;
}
// Slow path using get(int).
int posMax = pos + n;
Object thisBase = base();
// If this buffer and the source buffer share the same backing array or memory, then the
// result will be as if the source elements were first copied to an intermediate location
// before being written into this buffer.
// Instead of copying to an intermediate location, we change the writing order.
boolean ascendingOrder;
if (isDirect() && src.isDirect()) {
// Both src and dst should be ByteBufferAsShortBuffer classes.
// this.offset and src.offset should be zero, and can be ignored.
long dstStart = this.address + ((long) pos << 1);
long srcStart = src.address + ((long) srcPos << 1);
// The second condition is optional, but the ascending order is the preferred behavior.
ascendingOrder = (dstStart <= srcStart) || (srcStart + ((long) n << 1) < dstStart);
// We may just do memmove here if both buffer uses the same byte order.
} else if (thisBase != null && thisBase == src.base()) { // Share the same short[] or byte[]
if (thisBase == this.hb) { // Both this and src should be HeapShortBuffer
int dstStart = this.offset + pos;
int srcStart = src.offset + srcPos;
ascendingOrder = (dstStart <= srcStart) || (srcStart + n < dstStart);
} else if (this instanceof ByteBufferAsShortBuffer asDst &&
src instanceof ByteBufferAsShortBuffer asSrc && thisBase instanceof byte[]) {
// this.offset and src.offset should be zero, and can be ignored.
long dstStart = asDst.byteOffset + asDst.bb.offset + ((long) pos << 1);
long srcStart = asSrc.byteOffset + asSrc.bb.offset + ((long) srcPos << 1);
ascendingOrder = (dstStart <= srcStart) || (srcStart + ((long) n << 1) < dstStart);
} else {
// There isn't a known case following into this condition. We should add a DCHECK here.
ascendingOrder = true;
}
} else {
ascendingOrder = true;
}
if (ascendingOrder) {
for (int i = pos, j = srcPos; i < posMax; i++, j++) {
put(i, src.get(j));
}
} else {
for (int i = posMax - 1, j = srcPos + n - 1; i >= pos; i--, j--) {
put(i, src.get(j));
}
}
}
/**
* Relative bulk put method (optional operation).
*
* dst.put(src, off, len) has exactly the same effect as
* the loop
*
* {@code
* for (int i = off; i < off + len; i++)
* dst.put(src[i]);
* }
*
* except that it first checks that there is sufficient space in this
* buffer and it is potentially much more efficient.
*
* @param src
* The array from which shorts are to be read
*
* @param offset
* The offset within the array of the first short to be read;
* must be non-negative and no larger than {@code src.length}
*
* @param length
* The number of shorts to be read from the given array;
* must be non-negative and no larger than
* {@code src.length - offset}
*
* @return This buffer
*
* @throws BufferOverflowException
* If there is insufficient space in this buffer
*
* @throws IndexOutOfBoundsException
* If the preconditions on the {@code offset} and {@code length}
* parameters do not hold
*
* @throws ReadOnlyBufferException
* If this buffer is read-only
*/
public ShortBuffer put(short[] src, int offset, int length) {
if (isReadOnly())
throw new ReadOnlyBufferException();
Objects.checkFromIndexSize(offset, length, src.length);
int pos = position();
if (length > limit() - pos)
throw new BufferOverflowException();
putArray(pos, src, offset, length);
position(pos + length);
return this;
}
/**
* Relative bulk put method (optional operation).
*
*
* dst.put(a, 0, a.length)
*
* @param src
* The source array
*
* @return This buffer
*
* @throws BufferOverflowException
* If there is insufficient space in this buffer
*
* @throws ReadOnlyBufferException
* If this buffer is read-only
*/
public final ShortBuffer put(short[] src) {
return put(src, 0, src.length);
}
/**
* Absolute bulk put method (optional operation).
*
* dst.put(index, src, offset, length)
* has exactly the same effect as the following loop except that it first
* checks the consistency of the supplied parameters and it is potentially
* much more efficient:
*
* {@code
* for (int i = offset, j = index; i < offset + length; i++, j++)
* dst.put(j, src[i]);
* }
*
* @param index
* The index in this buffer at which the first short will be
* written; must be non-negative and less than {@code limit()}
*
* @param src
* The array from which shorts are to be read
*
* @param offset
* The offset within the array of the first short to be read;
* must be non-negative and less than {@code src.length}
*
* @param length
* The number of shorts to be read from the given array;
* must be non-negative and no larger than the smaller of
* {@code limit() - index} and {@code src.length - offset}
*
* @return This buffer
*
* @throws IndexOutOfBoundsException
* If the preconditions on the {@code index}, {@code offset}, and
* {@code length} parameters do not hold
*
* @throws ReadOnlyBufferException
* If this buffer is read-only
*
* @since 13
*/
public ShortBuffer put(int index, short[] src, int offset, int length) {
if (isReadOnly())
throw new ReadOnlyBufferException();
Objects.checkFromIndexSize(index, length, limit());
Objects.checkFromIndexSize(offset, length, src.length);
putArray(index, src, offset, length);
return this;
}
/**
* Absolute bulk put method (optional operation).
*
* dst.put(index, src)
* behaves in exactly the same way as the invocation:
*
*
* dst.put(index, src, 0, src.length);
*
* @param index
* The index in this buffer at which the first short will be
* written; must be non-negative and less than {@code limit()}
*
* @param src
* The array from which shorts are to be read
*
* @return This buffer
*
* @throws IndexOutOfBoundsException
* If {@code index} is negative, not smaller than {@code limit()},
* or {@code limit() - index < src.length}
*
* @throws ReadOnlyBufferException
* If this buffer is read-only
*
* @since 13
*/
public ShortBuffer put(int index, short[] src) {
return put(index, src, 0, src.length);
}
private ShortBuffer putArray(int index, short[] src, int offset, int length) {
// Android-changed: ScopedMemoryAccess is not yet supported.
/*
if (
((long)length << 1) > Bits.JNI_COPY_FROM_ARRAY_THRESHOLD) {
long bufAddr = address + ((long)index << 1);
long srcOffset =
ARRAY_BASE_OFFSET + ((long)offset << 1);
long len = (long)length << 1;
try {
if (order() != ByteOrder.nativeOrder())
SCOPED_MEMORY_ACCESS.copySwapMemory(
null, scope(), src, srcOffset,
base(), bufAddr, len, Short.BYTES);
else
SCOPED_MEMORY_ACCESS.copyMemory(
null, scope(), src, srcOffset,
base(), bufAddr, len);
} finally {
Reference.reachabilityFence(this);
}
} else {
int end = offset + length;
for (int i = offset, j = index; i < end; i++, j++)
this.put(j, src[i]);
}
*/
int end = offset + length;
for (int i = offset, j = index; i < end; i++, j++) {
this.put(j, src[i]);
}
return this;
}
// -- Other stuff --
/**
* Tells whether or not this buffer is backed by an accessible short
* array.
*
*
*
*
*
*