1 Star 0 Fork 2

machunpeng/Java-Notes

forked from cxylk/Java-Notes 
加入 Gitee
与超过 1400万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
文件
克隆/下载
ByteBufferAsFloatBufferL.java 3.42 KB
一键复制 编辑 原始数据 按行查看 历史
cxylk 提交于 2021-01-21 16:33 +08:00 . :rainbow:idea构建jdk源码
/*
* Copyright (c) 2000, 2013, Oracle and/or its affiliates. All rights reserved.
* ORACLE PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*/
// -- This file was mechanically generated: Do not edit! -- //
package java.nio;
class ByteBufferAsFloatBufferL // package-private
extends FloatBuffer
{
protected final ByteBuffer bb;
protected final int offset;
ByteBufferAsFloatBufferL(ByteBuffer bb) { // package-private
super(-1, 0,
bb.remaining() >> 2,
bb.remaining() >> 2);
this.bb = bb;
// enforce limit == capacity
int cap = this.capacity();
this.limit(cap);
int pos = this.position();
assert (pos <= cap);
offset = pos;
}
ByteBufferAsFloatBufferL(ByteBuffer bb,
int mark, int pos, int lim, int cap,
int off)
{
super(mark, pos, lim, cap);
this.bb = bb;
offset = off;
}
public FloatBuffer slice() {
int pos = this.position();
int lim = this.limit();
assert (pos <= lim);
int rem = (pos <= lim ? lim - pos : 0);
int off = (pos << 2) + offset;
assert (off >= 0);
return new ByteBufferAsFloatBufferL(bb, -1, 0, rem, rem, off);
}
public FloatBuffer duplicate() {
return new ByteBufferAsFloatBufferL(bb,
this.markValue(),
this.position(),
this.limit(),
this.capacity(),
offset);
}
public FloatBuffer asReadOnlyBuffer() {
return new ByteBufferAsFloatBufferRL(bb,
this.markValue(),
this.position(),
this.limit(),
this.capacity(),
offset);
}
protected int ix(int i) {
return (i << 2) + offset;
}
public float get() {
return Bits.getFloatL(bb, ix(nextGetIndex()));
}
public float get(int i) {
return Bits.getFloatL(bb, ix(checkIndex(i)));
}
public FloatBuffer put(float x) {
Bits.putFloatL(bb, ix(nextPutIndex()), x);
return this;
}
public FloatBuffer put(int i, float x) {
Bits.putFloatL(bb, ix(checkIndex(i)), x);
return this;
}
public FloatBuffer compact() {
int pos = position();
int lim = limit();
assert (pos <= lim);
int rem = (pos <= lim ? lim - pos : 0);
ByteBuffer db = bb.duplicate();
db.limit(ix(lim));
db.position(ix(0));
ByteBuffer sb = db.slice();
sb.position(pos << 2);
sb.compact();
position(rem);
limit(capacity());
discardMark();
return this;
}
public boolean isDirect() {
return bb.isDirect();
}
public boolean isReadOnly() {
return false;
}
public ByteOrder order() {
return ByteOrder.LITTLE_ENDIAN;
}
}
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
1
https://gitee.com/machunpeng/Java-Notes.git
git@gitee.com:machunpeng/Java-Notes.git
machunpeng
Java-Notes
Java-Notes
main

搜索帮助