📄 bytebuffer.java
字号:
/* ByteBuffer.java -- Copyright (C) 2002, 2003, 2004 Free Software Foundation, Inc.This file is part of GNU Classpath.GNU Classpath is free software; you can redistribute it and/or modifyit under the terms of the GNU General Public License as published bythe Free Software Foundation; either version 2, or (at your option)any later version.GNU Classpath is distributed in the hope that it will be useful, butWITHOUT ANY WARRANTY; without even the implied warranty ofMERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNUGeneral Public License for more details.You should have received a copy of the GNU General Public Licensealong with GNU Classpath; see the file COPYING. If not, write to theFree Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA02110-1301 USA.Linking this library statically or dynamically with other modules ismaking a combined work based on this library. Thus, the terms andconditions of the GNU General Public License cover the wholecombination.As a special exception, the copyright holders of this library give youpermission to link this library with independent modules to produce anexecutable, regardless of the license terms of these independentmodules, and to copy and distribute the resulting executable underterms of your choice, provided that you also meet, for each linkedindependent module, the terms and conditions of the license of thatmodule. An independent module is a module which is not derived fromor based on this library. If you modify this library, you may extendthis exception to your version of the library, but you are notobligated to do so. If you do not wish to do so, delete thisexception statement from your version. */package java.nio;/** * @since 1.4 */public abstract class ByteBuffer extends Buffer implements Comparable{ ByteOrder endian = ByteOrder.BIG_ENDIAN; int array_offset; byte[] backing_buffer; ByteBuffer (int capacity, int limit, int position, int mark) { super (capacity, limit, position, mark); } /** * Allocates a new direct byte buffer. */ public static ByteBuffer allocateDirect (int capacity) { return DirectByteBufferImpl.allocate (capacity); } /** * Allocates a new <code>ByteBuffer</code> object with a given capacity. */ public static ByteBuffer allocate (int capacity) { return wrap(new byte[capacity], 0, capacity); } /** * Wraps a <code>byte</code> array into a <code>ByteBuffer</code> * object. * * @exception IndexOutOfBoundsException If the preconditions on the offset * and length parameters do not hold */ public static final ByteBuffer wrap (byte[] array, int offset, int length) { // FIXME: In GCJ and other implementations where arrays may not // move we might consider, at least when offset==0: // return new DirectByteBufferImpl(array, // address_of_data(array) + offset, // length, length, 0, false); // This may be more efficient, mainly because we can then use the // same logic for all ByteBuffers. return new ByteBufferImpl (array, 0, array.length, offset + length, offset, -1, false); } /** * Wraps a <code>byte</code> array into a <code>ByteBuffer</code> * object. */ public static final ByteBuffer wrap (byte[] array) { return wrap (array, 0, array.length); } /** * This method transfers <code>byte</code>s from this buffer into the given * destination array. Before the transfer, it checks if there are fewer than * length <code>byte</code>s remaining in this buffer. * * @param dst The destination array * @param offset The offset within the array of the first <code>byte</code> * to be written; must be non-negative and no larger than dst.length. * @param length The maximum number of bytes to be written to the given array; * must be non-negative and no larger than dst.length - offset. * * @exception BufferUnderflowException If there are fewer than length * <code>byte</code>s remaining in this buffer. * @exception IndexOutOfBoundsException If the preconditions on the offset * and length parameters do not hold. */ public ByteBuffer get (byte[] dst, int offset, int length) { checkArraySize(dst.length, offset, length); checkForUnderflow(length); for (int i = offset; i < offset + length; i++) { dst [i] = get (); } return this; } /** * This method transfers <code>byte</code>s from this buffer into the given * destination array. * * @param dst The byte array to write into. * * @exception BufferUnderflowException If there are fewer than dst.length * <code>byte</code>s remaining in this buffer. */ public ByteBuffer get (byte[] dst) { return get (dst, 0, dst.length); } /** * Writes the content of the the <code>ByteBUFFER</code> src * into the buffer. Before the transfer, it checks if there is fewer than * <code>src.remaining()</code> space remaining in this buffer. * * @param src The source data. * * @exception BufferOverflowException If there is insufficient space in this * buffer for the remaining <code>byte</code>s in the source buffer. * @exception IllegalArgumentException If the source buffer is this buffer. * @exception ReadOnlyBufferException If this buffer is read-only. */ public ByteBuffer put (ByteBuffer src) { if (src == this) throw new IllegalArgumentException (); checkForOverflow(src.remaining()); if (src.remaining () > 0) { byte[] toPut = new byte [src.remaining ()]; src.get (toPut); put (toPut); } return this; } /** * Writes the content of the the <code>byte array</code> src * into the buffer. Before the transfer, it checks if there is fewer than * length space remaining in this buffer. * * @param src The array to copy into the buffer. * @param offset The offset within the array of the first byte to be read; * must be non-negative and no larger than src.length. * @param length The number of bytes to be read from the given array; * must be non-negative and no larger than src.length - offset. * * @exception BufferOverflowException If there is insufficient space in this * buffer for the remaining <code>byte</code>s in the source array. * @exception IndexOutOfBoundsException If the preconditions on the offset * and length parameters do not hold * @exception ReadOnlyBufferException If this buffer is read-only. */ public ByteBuffer put (byte[] src, int offset, int length) { checkArraySize(src.length, offset, length); checkForOverflow(length); for (int i = offset; i < offset + length; i++) put (src [i]); return this; } /** * Writes the content of the the <code>byte array</code> src * into the buffer. * * @param src The array to copy into the buffer. * * @exception BufferOverflowException If there is insufficient space in this * buffer for the remaining <code>byte</code>s in the source array. * @exception ReadOnlyBufferException If this buffer is read-only. */ public final ByteBuffer put (byte[] src) { return put (src, 0, src.length); } /** * Tells whether ot not this buffer is backed by an accessible * <code>byte</code> array. */ public final boolean hasArray () { return (backing_buffer != null && !isReadOnly ()); } /** * Returns the <code>byte</code> array that backs this buffer. * * @exception ReadOnlyBufferException If this buffer is read-only. * @exception UnsupportedOperationException If this buffer is not backed * by an accessible array. */ public final byte[] array () { if (backing_buffer == null) throw new UnsupportedOperationException (); checkIfReadOnly(); return backing_buffer; } /** * Returns the offset within this buffer's backing array of the first element. * * @exception ReadOnlyBufferException If this buffer is read-only. * @exception UnsupportedOperationException If this buffer is not backed * by an accessible array. */ public final int arrayOffset () { if (backing_buffer == null) throw new UnsupportedOperationException (); checkIfReadOnly(); return array_offset; } /** * Calculates a hash code for this buffer. * * This is done with <code>int</code> arithmetic, * where ** represents exponentiation, by this formula:<br> * <code>s[position()] + 31 + (s[position()+1] + 30)*31**1 + ... + * (s[limit()-1]+30)*31**(limit()-1)</code>. * Where s is the buffer data. Note that the hashcode is dependent * on buffer content, and therefore is not useful if the buffer * content may change. * * @return the hash code */ public int hashCode () { int hashCode = get(position()) + 31; int multiplier = 1; for (int i = position() + 1; i < limit(); ++i) { multiplier *= 31; hashCode += (get(i) + 30)*multiplier; } return hashCode; } /** * Checks if this buffer is equal to obj. */ public boolean equals (Object obj) { if (obj instanceof ByteBuffer) { return compareTo (obj) == 0; } return false; } /** * Compares two <code>ByteBuffer</code> objects. * * @exception ClassCastException If obj is not an object derived from * <code>ByteBuffer</code>. */ public int compareTo (Object obj) { ByteBuffer other = (ByteBuffer) obj; int num = Math.min(remaining(), other.remaining()); int pos_this = position(); int pos_other = other.position(); for (int count = 0; count < num; count++) { byte a = get(pos_this++); byte b = other.get(pos_other++); if (a == b) continue; if (a < b) return -1; return 1; }
⌨️ 快捷键说明
复制代码
Ctrl + C
搜索代码
Ctrl + F
全屏模式
F11
切换主题
Ctrl + Shift + D
显示快捷键
?
增大字号
Ctrl + =
减小字号
Ctrl + -