HeapLongBufferpublic class HeapLongBuffer extends LongBuffer | A read/write HeapLongBuffer. |
| Constructors Summary |
|---|
HeapLongBuffer(int cap, int lim) // package-private
super(-1, 0, lim, cap, new long[cap], 0);
/*
hb = new long[cap];
offset = 0;
*/
| HeapLongBuffer(long[] buf, int off, int len) // package-private
super(-1, off, off + len, buf.length, buf, 0);
/*
hb = buf;
offset = 0;
*/
| protected HeapLongBuffer(long[] buf, int mark, int pos, int lim, int cap, int off)
super(mark, pos, lim, cap, buf, off);
/*
hb = buf;
offset = off;
*/
|
| Methods Summary |
|---|
| public java.nio.LongBuffer | asReadOnlyBuffer()
return new HeapLongBufferR(hb,
this.markValue(),
this.position(),
this.limit(),
this.capacity(),
offset);
| | public java.nio.LongBuffer | compact()
System.arraycopy(hb, ix(position()), hb, ix(0), remaining());
position(remaining());
limit(capacity());
return this;
| | public java.nio.LongBuffer | duplicate()
return new HeapLongBuffer(hb,
this.markValue(),
this.position(),
this.limit(),
this.capacity(),
offset);
| | public java.nio.LongBuffer | get(long[] dst, int offset, int length)
checkBounds(offset, length, dst.length);
if (length > remaining())
throw new BufferUnderflowException();
System.arraycopy(hb, ix(position()), dst, offset, length);
position(position() + length);
return this;
| | public long | get()
return hb[ix(nextGetIndex())];
| | public long | get(int i)
return hb[ix(checkIndex(i))];
| | public boolean | isDirect()
return false;
| | public boolean | isReadOnly()
return false;
| | protected int | ix(int i)
return i + offset;
| | public java.nio.ByteOrder | order()
return ByteOrder.nativeOrder();
| | public java.nio.LongBuffer | put(long x)
hb[ix(nextPutIndex())] = x;
return this;
| | public java.nio.LongBuffer | put(int i, long x)
hb[ix(checkIndex(i))] = x;
return this;
| | public java.nio.LongBuffer | put(long[] src, int offset, int length)
checkBounds(offset, length, src.length);
if (length > remaining())
throw new BufferOverflowException();
System.arraycopy(src, offset, hb, ix(position()), length);
position(position() + length);
return this;
| | public java.nio.LongBuffer | put(java.nio.LongBuffer src)
if (src instanceof HeapLongBuffer) {
if (src == this)
throw new IllegalArgumentException();
HeapLongBuffer sb = (HeapLongBuffer)src;
int n = sb.remaining();
if (n > remaining())
throw new BufferOverflowException();
System.arraycopy(sb.hb, sb.ix(sb.position()),
hb, ix(position()), n);
sb.position(sb.position() + n);
position(position() + n);
} else if (src.isDirect()) {
int n = src.remaining();
if (n > remaining())
throw new BufferOverflowException();
src.get(hb, ix(position()), n);
position(position() + n);
} else {
super.put(src);
}
return this;
| | public java.nio.LongBuffer | slice()
return new HeapLongBuffer(hb,
-1,
0,
this.remaining(),
this.remaining(),
this.position() + offset);
|
|
