ByteBufferImpl.java, [...]: New files.
2002-11-18 Michael Koch <konqueror@gmx.de> * gnu/java/nio/ByteBufferImpl.java, gnu/java/nio/CharBufferImpl.java, gnu/java/nio/DatagramChannelImpl.java, gnu/java/nio/DoubleBufferImpl.java, gnu/java/nio/FileChannelImpl.java, gnu/java/nio/FloatBufferImpl.java, gnu/java/nio/IntBufferImpl.java, gnu/java/nio/LongBufferImpl.java, gnu/java/nio/PipeImpl.java, gnu/java/nio/SelectionKeyImpl.java, gnu/java/nio/SelectorImpl.java, gnu/java/nio/SelectorProviderImpl.java, gnu/java/nio/ServerSocketChannelImpl.java, gnu/java/nio/ShortBufferImpl.java, gnu/java/nio/SocketChannelImpl.java, java/nio/DoubleBuffer.java, java/nio/FloatBuffer.java, java/nio/IntBuffer.java, java/nio/LongBuffer.java, java/nio/ShortBuffer.java, java/nio/channels/FileChannel.java: New files. From-SVN: r59216
This commit is contained in:
parent
d812d8211c
commit
48f5b6723a
22 changed files with 3899 additions and 0 deletions
225
libjava/java/nio/IntBuffer.java
Normal file
225
libjava/java/nio/IntBuffer.java
Normal file
|
@ -0,0 +1,225 @@
|
|||
/* IntBuffer.java --
|
||||
Copyright (C) 2002 Free Software Foundation, Inc.
|
||||
|
||||
This file is part of GNU Classpath.
|
||||
|
||||
GNU Classpath is free software; you can redistribute it and/or modify
|
||||
it under the terms of the GNU General Public License as published by
|
||||
the 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, but
|
||||
WITHOUT ANY WARRANTY; without even the implied warranty of
|
||||
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
||||
General Public License for more details.
|
||||
|
||||
You should have received a copy of the GNU General Public License
|
||||
along with GNU Classpath; see the file COPYING. If not, write to the
|
||||
Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
|
||||
02111-1307 USA.
|
||||
|
||||
Linking this library statically or dynamically with other modules is
|
||||
making a combined work based on this library. Thus, the terms and
|
||||
conditions of the GNU General Public License cover the whole
|
||||
combination.
|
||||
|
||||
As a special exception, the copyright holders of this library give you
|
||||
permission to link this library with independent modules to produce an
|
||||
executable, regardless of the license terms of these independent
|
||||
modules, and to copy and distribute the resulting executable under
|
||||
terms of your choice, provided that you also meet, for each linked
|
||||
independent module, the terms and conditions of the license of that
|
||||
module. An independent module is a module which is not derived from
|
||||
or based on this library. If you modify this library, you may extend
|
||||
this exception to your version of the library, but you are not
|
||||
obligated to do so. If you do not wish to do so, delete this
|
||||
exception statement from your version. */
|
||||
|
||||
package java.nio;
|
||||
|
||||
import gnu.java.nio.IntBufferImpl;
|
||||
|
||||
public abstract class IntBuffer extends Buffer
|
||||
{
|
||||
private ByteOrder endian = ByteOrder.BIG_ENDIAN;
|
||||
protected int [] backing_buffer;
|
||||
|
||||
public static IntBuffer allocateDirect(int capacity)
|
||||
{
|
||||
return new IntBufferImpl (capacity, 0, capacity);
|
||||
}
|
||||
|
||||
public static IntBuffer allocate(int capacity)
|
||||
{
|
||||
return new IntBufferImpl (capacity, 0, capacity);
|
||||
}
|
||||
|
||||
final public static IntBuffer wrap(int[] array, int offset, int length)
|
||||
{
|
||||
return new IntBufferImpl(array, offset, length);
|
||||
}
|
||||
|
||||
final public static IntBuffer wrap(String a)
|
||||
{
|
||||
int len = a.length();
|
||||
int[] buffer = new int[len];
|
||||
|
||||
for (int i=0;i<len;i++)
|
||||
{
|
||||
buffer[i] = (int) a.charAt(i);
|
||||
}
|
||||
|
||||
return wrap(buffer, 0, len);
|
||||
}
|
||||
|
||||
final public static IntBuffer wrap(int[] array)
|
||||
{
|
||||
return wrap(array, 0, array.length);
|
||||
}
|
||||
|
||||
final public IntBuffer get(int[] dst, int offset, int length)
|
||||
{
|
||||
for (int i = offset; i < offset + length; i++)
|
||||
{
|
||||
dst[i] = get();
|
||||
}
|
||||
|
||||
return this;
|
||||
}
|
||||
|
||||
final public IntBuffer get(int[] dst)
|
||||
{
|
||||
return get(dst, 0, dst.length);
|
||||
}
|
||||
|
||||
final public IntBuffer put(IntBuffer src)
|
||||
{
|
||||
while (src.hasRemaining())
|
||||
put(src.get());
|
||||
|
||||
return this;
|
||||
}
|
||||
|
||||
final public IntBuffer put(int[] src, int offset, int length)
|
||||
{
|
||||
for (int i = offset; i < offset + length; i++)
|
||||
put(src[i]);
|
||||
|
||||
return this;
|
||||
}
|
||||
|
||||
public final IntBuffer put(int[] src)
|
||||
{
|
||||
return put(src, 0, src.length);
|
||||
}
|
||||
|
||||
public final boolean hasArray()
|
||||
{
|
||||
return (backing_buffer != null);
|
||||
}
|
||||
|
||||
public final int[] array()
|
||||
{
|
||||
return backing_buffer;
|
||||
}
|
||||
|
||||
public final int arrayOffset()
|
||||
{
|
||||
return 0;
|
||||
}
|
||||
|
||||
public int hashCode()
|
||||
{
|
||||
return super.hashCode();
|
||||
}
|
||||
|
||||
public boolean equals(Object obj)
|
||||
{
|
||||
if (obj instanceof IntBuffer)
|
||||
{
|
||||
return compareTo(obj) == 0;
|
||||
}
|
||||
|
||||
return false;
|
||||
}
|
||||
|
||||
public int compareTo(Object ob)
|
||||
{
|
||||
IntBuffer a = (IntBuffer) ob;
|
||||
|
||||
if (a.remaining() != remaining())
|
||||
return 1;
|
||||
|
||||
if (! hasArray() ||
|
||||
! a.hasArray())
|
||||
{
|
||||
return 1;
|
||||
}
|
||||
|
||||
int r = remaining();
|
||||
int i1 = position ();
|
||||
int i2 = a.position ();
|
||||
|
||||
for (int i=0;i<r;i++)
|
||||
{
|
||||
int t = (int) (get(i1)- a.get(i2));
|
||||
if (t != 0)
|
||||
{
|
||||
return (int) t;
|
||||
}
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
public final ByteOrder order()
|
||||
{
|
||||
return endian;
|
||||
}
|
||||
|
||||
public final IntBuffer order(ByteOrder bo)
|
||||
{
|
||||
endian = bo;
|
||||
return this;
|
||||
}
|
||||
|
||||
public abstract int get();
|
||||
public abstract IntBuffer put(int b);
|
||||
public abstract int get(int index);
|
||||
public abstract IntBuffer put(int index, int b);
|
||||
public abstract IntBuffer compact();
|
||||
public abstract boolean isDirect();
|
||||
public abstract IntBuffer slice();
|
||||
public abstract IntBuffer duplicate();
|
||||
public abstract IntBuffer asReadOnlyBuffer();
|
||||
public abstract ShortBuffer asShortBuffer();
|
||||
public abstract CharBuffer asCharBuffer();
|
||||
public abstract IntBuffer asIntBuffer();
|
||||
public abstract LongBuffer asLongBuffer();
|
||||
public abstract FloatBuffer asFloatBuffer();
|
||||
public abstract DoubleBuffer asDoubleBuffer();
|
||||
public abstract char getChar();
|
||||
public abstract IntBuffer putChar(char value);
|
||||
public abstract char getChar(int index);
|
||||
public abstract IntBuffer putChar(int index, char value);
|
||||
public abstract short getShort();
|
||||
public abstract IntBuffer putShort(short value);
|
||||
public abstract short getShort(int index);
|
||||
public abstract IntBuffer putShort(int index, short value);
|
||||
public abstract int getInt();
|
||||
public abstract IntBuffer putInt(int value);
|
||||
public abstract int getInt(int index);
|
||||
public abstract IntBuffer putInt(int index, int value);
|
||||
public abstract long getLong();
|
||||
public abstract IntBuffer putLong(long value);
|
||||
public abstract long getLong(int index);
|
||||
public abstract IntBuffer putLong(int index, long value);
|
||||
public abstract float getFloat();
|
||||
public abstract IntBuffer putFloat(float value);
|
||||
public abstract float getFloat(int index);
|
||||
public abstract IntBuffer putFloat(int index, float value);
|
||||
public abstract double getDouble();
|
||||
public abstract IntBuffer putDouble(double value);
|
||||
public abstract double getDouble(int index);
|
||||
public abstract IntBuffer putDouble(int index, double value);
|
||||
}
|
Loading…
Add table
Add a link
Reference in a new issue