/*
* Copyright (c) 2000, 2020, Oracle and/or its affiliates. All rights reserved.
* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
*
* This code is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License version 2 only, as
* published by the Free Software Foundation. Oracle designates this
* particular file as subject to the "Classpath" exception as provided
* by Oracle in the LICENSE file that accompanied this code.
*
* This code is distributed in the hope that it will be useful, but WITHOUT
* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* version 2 for more details (a copy is included in the LICENSE file that
* accompanied this code).
*
* You should have received a copy of the GNU General Public License version
* 2 along with this work; if not, write to the Free Software Foundation,
* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
*
* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
* or visit www.oracle.com if you need additional information or have any
* questions.
*/
// -- This file was mechanically generated: Do not edit! -- //
package java.nio;
import java.lang.ref.Reference;
import java.util.Objects;
import jdk.internal.access.foreign.MemorySegmentProxy;
import jdk.internal.util.ArraysSupport;
A short buffer.
This class defines four categories of operations upon
short buffers:
Absolute and relative get
and put
methods that read and write single shorts;
Absolute and relative bulk get
methods that transfer contiguous sequences of shorts from this buffer into an array; and
Absolute and relative bulk put
methods that transfer contiguous sequences of shorts from a short array{#if[char]?, a string,} or some other short buffer into this buffer;{#if[!byte]? and}
A method for compacting
a short buffer.
Short buffers can be created either by allocation
, which allocates space for the buffer's content, by wrapping
an existing short array {#if[char]?or string} 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 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 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, JSR-51 Expert Group Since: 1.4
/**
* A short buffer.
*
* <p> This class defines four categories of operations upon
* short buffers:
*
* <ul>
*
* <li><p> Absolute and relative {@link #get() <i>get</i>} and
* {@link #put(short) <i>put</i>} methods that read and write
* single shorts; </p></li>
*
* <li><p> Absolute and relative {@link #get(short[]) <i>bulk get</i>}
* methods that transfer contiguous sequences of shorts from this buffer
* into an array; and</p></li>
*
* <li><p> Absolute and relative {@link #put(short[]) <i>bulk put</i>}
* methods that transfer contiguous sequences of shorts from a
* short array{#if[char]?, a string,} or some other short
* buffer into this buffer;{#if[!byte]? and} </p></li>
*
*
* <li><p> A method for {@link #compact compacting}
* a short buffer. </p></li>
*
* </ul>
*
* <p> Short buffers can be created either by {@link #allocate
* <i>allocation</i>}, which allocates space for the buffer's
*
*
* content, by {@link #wrap(short[]) <i>wrapping</i>} an existing
* short array {#if[char]?or string} into a buffer, or by creating a
* <a href="ByteBuffer.html#views"><i>view</i></a> of an existing byte buffer.
*
*
*
*
* <p> Like a byte buffer, a short buffer is either <a
* href="ByteBuffer.html#direct"><i>direct</i> or <i>non-direct</i></a>. 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. </p>
*
*
*
*
* <p> 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<ShortBuffer>
{
// These fields are declared here rather than in Heap-X-Buffer in order to
// reduce the number of virtual method invocations needed to access these
// values, which is especially costly when coding small buffers.
//
final short[] hb; // Non-null only for heap buffers
final int offset;
boolean isReadOnly;
// Creates a new buffer with the given mark, position, limit, capacity,
// backing array, and array offset
//
ShortBuffer(int mark, int pos, int lim, int cap, // package-private
short[] hb, int offset, MemorySegmentProxy segment)
{
super(mark, pos, lim, cap, segment);
this.hb = hb;
this.offset = offset;
}
// Creates a new buffer with the given mark, position, limit, and capacity
//
ShortBuffer(int mark, int pos, int lim, int cap, MemorySegmentProxy segment) { // package-private
this(mark, pos, lim, cap, null, 0, segment);
}
// Creates a new buffer with given base, address and capacity
//
ShortBuffer(short[] hb, long addr, int cap, MemorySegmentProxy segment) { // package-private
super(addr, cap, segment);
this.hb = hb;
this.offset = 0;
}
@Override
Object base() {
return hb;
}
Allocates a new short buffer.
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 native order
of the underlying hardware. It will have a backing array
, and its array offset
will be zero.
Params: - capacity –
The new buffer's capacity, in shorts
Throws: - IllegalArgumentException – If the
capacity
is a negative integer
Returns: The new short buffer
/**
* Allocates a new short buffer.
*
* <p> 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);
return new HeapShortBuffer(capacity, capacity, null);
}
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 array.length
, its position will be offset
, its limit will be offset + length
, its mark will be undefined, and its byte order will be the native order
of the underlying hardware. Its backing array
will be the given array, and its array offset
will be zero.
Params: - array –
The array that will back the new buffer
- offset – The offset of the subarray to be used; must be non-negative and no larger than
array.length
. The new buffer's position will be set to this value. - length – The length of the subarray to be used; must be non-negative and no larger than
array.length - offset
. The new buffer's limit will be set to offset + length
.
Throws: - IndexOutOfBoundsException – If the preconditions on the
offset
and length
parameters do not hold
Returns: The new short buffer
/**
* Wraps a short array into a buffer.
*
* <p> 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. </p>
*
* @param array
* The array that will back the new buffer
*
* @param offset
* The offset of the subarray to be used; must be non-negative and
* no larger than {@code array.length}. The new buffer's position
* will be set to this value.
*
* @param length
* The length of the subarray to be used;
* must be non-negative and no larger than
* {@code array.length - offset}.
* The new buffer's limit will be set to {@code offset + length}.
*
* @return The new short buffer
*
* @throws IndexOutOfBoundsException
* If the preconditions on the {@code offset} and {@code length}
* parameters do not hold
*/
public static ShortBuffer wrap(short[] array,
int offset, int length)
{
try {
return new HeapShortBuffer(array, offset, length, null);
} catch (IllegalArgumentException x) {
throw new IndexOutOfBoundsException();
}
}
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 and limit will be array.length
, its position will be zero, its mark will be undefined, and its byte order will be the native order
of the underlying hardware. Its backing array
will be the given array, and its array offset
will be zero.
Params: - array –
The array that will back this buffer
Returns: The new short buffer
/**
* Wraps a short array into a buffer.
*
* <p> 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. </p>
*
* @param array
* The array that will back this buffer
*
* @return The new short buffer
*/
public static ShortBuffer wrap(short[] array) {
return wrap(array, 0, array.length);
}
Creates a new short buffer whose content is a shared subsequence of
this buffer's content.
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.
Returns: The new short buffer
/**
* Creates a new short buffer whose content is a shared subsequence of
* this buffer's content.
*
* <p> 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.
*
* <p> 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. </p>
*
* @return The new short buffer
*/
@Override
public abstract ShortBuffer slice();
Creates a new short buffer whose content is a shared subsequence of
this buffer's content.
The content of the new buffer will start at position index
in this buffer, and will contain 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 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.
Params: - index – The position in this buffer at which the content of the new buffer will start; must be non-negative and no larger than
limit()
- length – The number of elements the new buffer will contain; must be non-negative and no larger than
limit() - index
Throws: - IndexOutOfBoundsException – If
index
is negative or greater than limit()
, length
is negative, or length > limit() - index
Returns: The new buffer Since: 13
/**
* Creates a new short buffer whose content is a shared subsequence of
* this buffer's content.
*
* <p> 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.
*
* <p> 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. </p>
*
* @param index
* The position in this buffer at which the content of the new
* buffer will start; must be non-negative and no larger than
* {@link #limit() limit()}
*
* @param length
* The number of elements the new buffer will contain; must be
* non-negative and no larger than {@code limit() - index}
*
* @return The new buffer
*
* @throws IndexOutOfBoundsException
* If {@code index} is negative or greater than {@code limit()},
* {@code length} is negative, or {@code length > limit() - index}
*
* @since 13
*/
@Override
public abstract ShortBuffer slice(int index, int length);
Creates a new short buffer that shares this buffer's content.
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.
Returns: The new short buffer
/**
* Creates a new short buffer that shares this buffer's content.
*
* <p> 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.
*
* <p> 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. </p>
*
* @return The new short buffer
*/
@Override
public abstract ShortBuffer duplicate();
Creates a new, read-only short buffer that shares this buffer's
content.
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 duplicate
method.
Returns: The new, read-only short buffer
/**
* Creates a new, read-only short buffer that shares this buffer's
* content.
*
* <p> 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.
*
* <p> The new buffer's capacity, limit, position,
* mark values, and byte order will be identical to those of this buffer.
*
* <p> If this buffer is itself read-only then this method behaves in
* exactly the same way as the {@link #duplicate duplicate} method. </p>
*
* @return The new, read-only short buffer
*/
public abstract ShortBuffer asReadOnlyBuffer();
// -- Singleton get/put methods --
Relative get method. Reads the short at this buffer's
current position, and then increments the position.
Throws: - BufferUnderflowException –
If the buffer's current position is not smaller than its limit
Returns: The short at the buffer's current position
/**
* Relative <i>get</i> method. Reads the short at this buffer's
* current position, and then increments the position.
*
* @return The short at the buffer's current position
*
* @throws BufferUnderflowException
* If the buffer's current position is not smaller than its limit
*/
public abstract short get();
Relative put method (optional operation).
Writes the given short into this buffer at the current
position, and then increments the position.
Params: - s –
The short to be written
Throws: - BufferOverflowException –
If this buffer's current position is not smaller than its limit
- ReadOnlyBufferException –
If this buffer is read-only
Returns: This buffer
/**
* Relative <i>put</i> method <i>(optional operation)</i>.
*
* <p> Writes the given short into this buffer at the current
* position, and then increments the position. </p>
*
* @param s
* The short to be written
*
* @return This buffer
*
* @throws BufferOverflowException
* If this buffer's current position is not smaller than its limit
*
* @throws ReadOnlyBufferException
* If this buffer is read-only
*/
public abstract ShortBuffer put(short s);
Absolute get method. Reads the short at the given
index.
Params: - index –
The index from which the short will be read
Throws: - IndexOutOfBoundsException – If
index
is negative or not smaller than the buffer's limit
Returns: The short at the given index
/**
* Absolute <i>get</i> method. Reads the short at the given
* index.
*
* @param index
* The index from which the short will be read
*
* @return The short at the given index
*
* @throws IndexOutOfBoundsException
* If {@code index} is negative
* or not smaller than the buffer's limit
*/
public abstract short get(int index);
Absolute put method (optional operation).
Writes the given short into this buffer at the given
index.
Params: - index –
The index at which the short will be written
- s –
The short value to be written
Throws: - IndexOutOfBoundsException – If
index
is negative or not smaller than the buffer's limit - ReadOnlyBufferException –
If this buffer is read-only
Returns: This buffer
/**
* Absolute <i>put</i> method <i>(optional operation)</i>.
*
* <p> Writes the given short into this buffer at the given
* index. </p>
*
* @param index
* The index at which the short will be written
*
* @param s
* The short value to be written
*
* @return This buffer
*
* @throws IndexOutOfBoundsException
* If {@code index} is negative
* or not smaller than the buffer's limit
*
* @throws ReadOnlyBufferException
* If this buffer is read-only
*/
public abstract ShortBuffer put(int index, short s);
// -- Bulk get operations --
Relative bulk get method.
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 length
>
remaining()
, then no shorts are transferred and a BufferUnderflowException
is thrown.
Otherwise, this method copies 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 length
.
In other words, an invocation of this method of the form
src.get(dst, off, len)
has exactly the same effect as
the loop
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.
Params: - dst –
The array into which shorts are to be written
- offset – The offset within the array of the first short to be written; must be non-negative and no larger than
dst.length
- length – The maximum number of shorts to be written to the given array; must be non-negative and no larger than
dst.length - offset
Throws: - BufferUnderflowException – If there are fewer than
length
shorts remaining in this buffer - IndexOutOfBoundsException – If the preconditions on the
offset
and length
parameters do not hold
Returns: This buffer
/**
* Relative bulk <i>get</i> method.
*
* <p> 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.
*
* <p> 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}.
*
* <p> In other words, an invocation of this method of the form
* <code>src.get(dst, off, len)</code> has exactly the same effect as
* the loop
*
* <pre>{@code
* for (int i = off; i < off + len; i++)
* dst[i] = src.get();
* }</pre>
*
* 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);
if (length > remaining())
throw new BufferUnderflowException();
int end = offset + length;
for (int i = offset; i < end; i++)
dst[i] = get();
return this;
}
Relative bulk get method.
This method transfers shorts from this buffer into the given destination array. An invocation of this method of the form src.get(a)
behaves in exactly the same way as the invocation
src.get(a, 0, a.length)
Params: - dst –
The destination array
Throws: - BufferUnderflowException – If there are fewer than
length
shorts remaining in this buffer
Returns: This buffer
/**
* Relative bulk <i>get</i> method.
*
* <p> 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
*
* <pre>
* src.get(a, 0, a.length) </pre>
*
* @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.
This method transfers 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
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:
for (int i = offset, j = index; i < offset + length; i++, j++)
dst[i] = src.get(j);
Params: - index – The index in this buffer from which the first short will be read; must be non-negative and less than
limit()
- dst –
The destination array
- offset – The offset within the array of the first short to be written; must be non-negative and less than
dst.length
- length – The number of shorts to be written to the given array; must be non-negative and no larger than the smaller of
limit() - index
and dst.length - offset
Throws: - IndexOutOfBoundsException – If the preconditions on the
index
, offset
, and length
parameters do not hold
Returns: This buffer Since: 13
/**
* Absolute bulk <i>get</i> method.
*
* <p> 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.
*
* <p> An invocation of this method of the form
* <code>src.get(index, dst, offset, length)</code>
* 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:
*
* <pre>{@code
* for (int i = offset, j = index; i < offset + length; i++, j++)
* dst[i] = src.get(j);
* }</pre>
*
* @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);
int end = offset + length;
for (int i = offset, j = index; i < end; i++, j++)
dst[i] = get(j);
return this;
}
Absolute bulk get method.
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
src.get(index, dst)
behaves in exactly the same
way as the invocation:
src.get(index, dst, 0, dst.length)
Params: - index – The index in this buffer from which the first short will be read; must be non-negative and less than
limit()
- dst –
The destination array
Throws: - IndexOutOfBoundsException – If
index
is negative, not smaller than limit()
, or limit() - index < dst.length
Returns: This buffer Since: 13
/**
* Absolute bulk <i>get</i> method.
*
* <p> 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
* <code>src.get(index, dst)</code> behaves in exactly the same
* way as the invocation:
*
* <pre>
* src.get(index, dst, 0, dst.length) </pre>
*
* @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);
}
// -- Bulk put operations --
Relative bulk put method (optional operation).
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 src.remaining()
>
remaining()
, then no shorts are transferred and a BufferOverflowException
is thrown.
Otherwise, this method copies
n = 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 dst.put(src)
has exactly the same effect as the loop
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.
Params: - src –
The source buffer from which shorts are to be read;
must not be this buffer
Throws: - BufferOverflowException –
If there is insufficient space in this buffer
for the remaining shorts in the source buffer
- IllegalArgumentException –
If the source buffer is this buffer
- ReadOnlyBufferException –
If this buffer is read-only
Returns: This buffer
/**
* Relative bulk <i>put</i> method <i>(optional operation)</i>.
*
* <p> 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.
*
* <p> Otherwise, this method copies
* <i>n</i> = {@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 <i>n</i>.
*
* <p> In other words, an invocation of this method of the form
* {@code dst.put(src)} has exactly the same effect as the loop
*
* <pre>
* while (src.hasRemaining())
* dst.put(src.get()); </pre>
*
* 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).
This method transfers length
shorts into this buffer from the given source buffer, starting at the given offset
in the source buffer and the given index
in this buffer. The positions of both buffers are unchanged.
In other words, an invocation of this method of the form
dst.put(index, src, offset, length)
has exactly the same effect as the loop
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.
Params: - index – The index in this buffer at which the first short will be written; must be non-negative and less than
limit()
- src –
The buffer from which shorts are to be read
- offset – The index within the source buffer of the first short to be read; must be non-negative and less than
src.limit()
- length – The number of shorts to be read from the given buffer; must be non-negative and no larger than the smaller of
limit() - index
and src.limit() - offset
Throws: - IndexOutOfBoundsException – If the preconditions on the
index
, offset
, and length
parameters do not hold - ReadOnlyBufferException –
If this buffer is read-only
Returns: This buffer Since: 16
/**
* Absolute bulk <i>put</i> method <i>(optional operation)</i>.
*
* <p> 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.
*
* <p> In other words, an invocation of this method of the form
* <code>dst.put(index, src, offset, length)</code>
* has exactly the same effect as the loop
*
* <pre>{@code
* for (int i = offset, j = index; i < offset + length; i++, j++)
* dst.put(j, src.get(i));
* }</pre>
*
* 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) {
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;
if (this.order() == src.order()) {
try {
SCOPED_MEMORY_ACCESS.copyMemory(
scope(), src.scope(), srcBase,
srcAddr, base, addr, len);
} finally {
Reference.reachabilityFence(src);
Reference.reachabilityFence(this);
}
} else {
try {
SCOPED_MEMORY_ACCESS.copySwapMemory(
scope(), src.scope(), srcBase,
srcAddr, base, addr, len, (long)1 << 1);
} finally {
Reference.reachabilityFence(src);
Reference.reachabilityFence(this);
}
}
}
Relative bulk put method (optional operation).
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 length
>
remaining()
, then no shorts are transferred and a BufferOverflowException
is thrown.
Otherwise, this method copies 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 length
.
In other words, an invocation of this method of the form
dst.put(src, off, len)
has exactly the same effect as
the loop
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.
Params: - src –
The array from which shorts are to be read
- offset – The offset within the array of the first short to be read; must be non-negative and no larger than
src.length
- length – The number of shorts to be read from the given array; must be non-negative and no larger than
src.length - offset
Throws: - BufferOverflowException –
If there is insufficient space in this buffer
- IndexOutOfBoundsException – If the preconditions on the
offset
and length
parameters do not hold - ReadOnlyBufferException –
If this buffer is read-only
Returns: This buffer
/**
* Relative bulk <i>put</i> method <i>(optional operation)</i>.
*
* <p> 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.
*
* <p> 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}.
*
* <p> In other words, an invocation of this method of the form
* <code>dst.put(src, off, len)</code> has exactly the same effect as
* the loop
*
* <pre>{@code
* for (int i = off; i < off + len; i++)
* dst.put(src[i]);
* }</pre>
*
* 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) {
Objects.checkFromIndexSize(offset, length, src.length);
if (length > remaining())
throw new BufferOverflowException();
int end = offset + length;
for (int i = offset; i < end; i++)
this.put(src[i]);
return this;
}
Relative bulk put method (optional operation).
This method transfers the entire content of the given source short array into this buffer. An invocation of this method of the form dst.put(a)
behaves in exactly the same way as the invocation
dst.put(a, 0, a.length)
Params: - src –
The source array
Throws: - BufferOverflowException –
If there is insufficient space in this buffer
- ReadOnlyBufferException –
If this buffer is read-only
Returns: This buffer
/**
* Relative bulk <i>put</i> method <i>(optional operation)</i>.
*
* <p> 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
*
* <pre>
* dst.put(a, 0, a.length) </pre>
*
* @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).
This method transfers 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
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:
for (int i = offset, j = index; i < offset + length; i++, j++)
dst.put(j, src[i]);
Params: - index – The index in this buffer at which the first short will be written; must be non-negative and less than
limit()
- src –
The array from which shorts are to be read
- offset – The offset within the array of the first short to be read; must be non-negative and less than
src.length
- length – The number of shorts to be read from the given array; must be non-negative and no larger than the smaller of
limit() - index
and src.length - offset
Throws: - IndexOutOfBoundsException – If the preconditions on the
index
, offset
, and length
parameters do not hold - ReadOnlyBufferException –
If this buffer is read-only
Returns: This buffer Since: 13
/**
* Absolute bulk <i>put</i> method <i>(optional operation)</i>.
*
* <p> 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.
*
* <p> An invocation of this method of the form
* <code>dst.put(index, src, offset, length)</code>
* 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:
*
* <pre>{@code
* for (int i = offset, j = index; i < offset + length; i++, j++)
* dst.put(j, src[i]);
* }</pre>
*
* @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);
int end = offset + length;
for (int i = offset, j = index; i < end; i++, j++)
this.put(j, src[i]);
return this;
}
Absolute bulk put method (optional operation).
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 dst.put(index, src)
behaves in exactly the same way as the invocation:
dst.put(index, src, 0, src.length);
Params: - index – The index in this buffer at which the first short will be written; must be non-negative and less than
limit()
- src –
The array from which shorts are to be read
Throws: - IndexOutOfBoundsException – If
index
is negative, not smaller than limit()
, or limit() - index < src.length
- ReadOnlyBufferException –
If this buffer is read-only
Returns: This buffer Since: 13
/**
* Absolute bulk <i>put</i> method <i>(optional operation)</i>.
*
* <p> 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 <code>dst.put(index, src)</code>
* behaves in exactly the same way as the invocation:
*
* <pre>
* dst.put(index, src, 0, src.length); </pre>
*
* @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);
}
// -- Other stuff --
Tells whether or not this buffer is backed by an accessible short
array.
If this method returns true
then the array
and arrayOffset
methods may safely be invoked.
Returns: true
if, and only if, this buffer is backed by an array and is not read-only
/**
* Tells whether or not this buffer is backed by an accessible short
* array.
*
* <p> If this method returns {@code true} then the {@link #array() array}
* and {@link #arrayOffset() arrayOffset} methods may safely be invoked.
* </p>
*
* @return {@code true} if, and only if, this buffer
* is backed by an array and is not read-only
*/
public final boolean hasArray() {
return (hb != null) && !isReadOnly;
}
Returns the short array that backs this
buffer (optional operation).
Modifications to this buffer's content will cause the returned
array's content to be modified, and vice versa.
Invoke the hasArray
method before invoking this method in order to ensure that this buffer has an accessible backing array.
Throws: - ReadOnlyBufferException –
If this buffer is backed by an array but is read-only
- UnsupportedOperationException –
If this buffer is not backed by an accessible array
Returns: The array that backs this buffer
/**
* Returns the short array that backs this
* buffer <i>(optional operation)</i>.
*
* <p> Modifications to this buffer's content will cause the returned
* array's content to be modified, and vice versa.
*
* <p> Invoke the {@link #hasArray hasArray} method before invoking this
* method in order to ensure that this buffer has an accessible backing
* array. </p>
*
* @return The array that backs this buffer
*
* @throws ReadOnlyBufferException
* If this buffer is backed by an array but is read-only
*
* @throws UnsupportedOperationException
* If this buffer is not backed by an accessible array
*/
public final short[] array() {
if (hb == null)
throw new UnsupportedOperationException();
if (isReadOnly)
throw new ReadOnlyBufferException();
return hb;
}
Returns the offset within this buffer's backing array of the first
element of the buffer (optional operation).
If this buffer is backed by an array then buffer position p
corresponds to array index p + arrayOffset()
.
Invoke the hasArray
method before invoking this method in order to ensure that this buffer has an accessible backing array.
Throws: - ReadOnlyBufferException –
If this buffer is backed by an array but is read-only
- UnsupportedOperationException –
If this buffer is not backed by an accessible array
Returns: The offset within this buffer's array
of the first element of the buffer
/**
* Returns the offset within this buffer's backing array of the first
* element of the buffer <i>(optional operation)</i>.
*
* <p> If this buffer is backed by an array then buffer position <i>p</i>
* corresponds to array index <i>p</i> + {@code arrayOffset()}.
*
* <p> Invoke the {@link #hasArray hasArray} method before invoking this
* method in order to ensure that this buffer has an accessible backing
* array. </p>
*
* @return The offset within this buffer's array
* of the first element of the buffer
*
* @throws ReadOnlyBufferException
* If this buffer is backed by an array but is read-only
*
* @throws UnsupportedOperationException
* If this buffer is not backed by an accessible array
*/
public final int arrayOffset() {
if (hb == null)
throw new UnsupportedOperationException();
if (isReadOnly)
throw new ReadOnlyBufferException();
return offset;
}
// -- Covariant return type overrides
{@inheritDoc}
/**
* {@inheritDoc}
*/
@Override
public
final
ShortBuffer position(int newPosition) {
super.position(newPosition);
return this;
}
{@inheritDoc}
/**
* {@inheritDoc}
*/
@Override
public
final
ShortBuffer limit(int newLimit) {
super.limit(newLimit);
return this;
}
{@inheritDoc}
/**
* {@inheritDoc}
*/
@Override
public
final
ShortBuffer mark() {
super.mark();
return this;
}
{@inheritDoc}
/**
* {@inheritDoc}
*/
@Override
public
final
ShortBuffer reset() {
super.reset();
return this;
}
{@inheritDoc}
/**
* {@inheritDoc}
*/
@Override
public
final
ShortBuffer clear() {
super.clear();
return this;
}
{@inheritDoc}
/**
* {@inheritDoc}
*/
@Override
public
final
ShortBuffer flip() {
super.flip();
return this;
}
{@inheritDoc}
/**
* {@inheritDoc}
*/
@Override
public
final
ShortBuffer rewind() {
super.rewind();
return this;
}
Compacts this buffer (optional operation).
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 = 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 limit()
- 1 is copied to index n = limit()
- 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.
Throws: - ReadOnlyBufferException –
If this buffer is read-only
Returns: This buffer
/**
* Compacts this buffer <i>(optional operation)</i>.
*
* <p> 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 <i>p</i> = {@code position()} is copied
* to index zero, the short at index <i>p</i> + 1 is copied
* to index one, and so forth until the short at index
* {@code limit()} - 1 is copied to index
* <i>n</i> = {@code limit()} - {@code 1} - <i>p</i>.
* The buffer's position is then set to <i>n+1</i> and its limit is set to
* its capacity. The mark, if defined, is discarded.
*
* <p> 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 <i>put</i>
* method. </p>
*
*
* @return This buffer
*
* @throws ReadOnlyBufferException
* If this buffer is read-only
*/
public abstract ShortBuffer compact();
Tells whether or not this short buffer is direct.
Returns: true
if, and only if, this buffer is direct
/**
* Tells whether or not this short buffer is direct.
*
* @return {@code true} if, and only if, this buffer is direct
*/
public abstract boolean isDirect();
Returns a string summarizing the state of this buffer.
Returns: A summary string
/**
* Returns a string summarizing the state of this buffer.
*
* @return A summary string
*/
public String toString() {
StringBuffer sb = new StringBuffer();
sb.append(getClass().getName());
sb.append("[pos=");
sb.append(position());
sb.append(" lim=");
sb.append(limit());
sb.append(" cap=");
sb.append(capacity());
sb.append("]");
return sb.toString();
}
Returns the current hash code of this buffer.
The hash code of a short buffer depends only upon its remaining elements; that is, upon the elements from position()
up to, and including, the element at limit()
- 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.
Returns: The current hash code of this buffer
/**
* Returns the current hash code of this buffer.
*
* <p> 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}.
*
* <p> 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. </p>
*
* @return The current hash code of this buffer
*/
public int hashCode() {
int h = 1;
int p = position();
for (int i = limit() - 1; i >= p; i--)
h = 31 * h + (int)get(i);
return h;
}
Tells whether or not this buffer is equal to another object.
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.
Params: - ob – The object to which this buffer is to be compared
Returns: true
if, and only if, this buffer is equal to the given object
/**
* Tells whether or not this buffer is equal to another object.
*
* <p> Two short buffers are equal if, and only if,
*
* <ol>
*
* <li><p> They have the same element type, </p></li>
*
* <li><p> They have the same number of remaining elements, and
* </p></li>
*
* <li><p> The two sequences of remaining elements, considered
* independently of their starting positions, are pointwise equal.
* </p></li>
*
* </ol>
*
* <p> A short buffer is not equal to any other type of object. </p>
*
* @param ob The object to which this buffer is to be compared
*
* @return {@code true} if, and only if, this buffer is equal to the
* given object
*/
public boolean equals(Object ob) {
if (this == ob)
return true;
if (!(ob instanceof ShortBuffer))
return false;
ShortBuffer that = (ShortBuffer)ob;
int thisPos = this.position();
int thisRem = this.limit() - thisPos;
int thatPos = that.position();
int thatRem = that.limit() - thatPos;
if (thisRem < 0 || thisRem != thatRem)
return false;
return BufferMismatch.mismatch(this, thisPos,
that, thatPos,
thisRem) < 0;
}
Compares this buffer to another.
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 short
elements are compared as if by invoking Short.compare(short, short)
.
A short buffer is not comparable to any other type of object.
Returns: A negative integer, zero, or a positive integer as this buffer
is less than, equal to, or greater than the given buffer
/**
* Compares this buffer to another.
*
* <p> 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)}.
*
* <p> 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 position
of each buffer and will be in the range of 0 (inclusive) up to the smaller of the 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.
Params: - that –
The byte buffer to be tested for a mismatch with this buffer
Returns: The relative index of the first mismatch between this and the
given buffer, otherwise -1 if no mismatch. Since: 11
/**
* 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).
*
* <p> 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 short
array is the 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.
Returns: This buffer's byte order
/**
* Retrieves this buffer's byte order.
*
* <p> 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 <a
* href="ByteBuffer.html#views">view</a> of a byte buffer is that of the
* byte buffer at the moment that the view is created. </p>
*
* @return This buffer's byte order
*/
public abstract ByteOrder order();
}