1 Star 1 Fork 2

cxylk/Java-Notes

加入 Gitee
与超过 1400万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
文件
克隆/下载
HeapDoubleBuffer.java 5.02 KB
一键复制 编辑 原始数据 按行查看 历史
cxylk 提交于 2021-01-21 16:33 +08:00 . :rainbow:idea构建jdk源码
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601
/*
* 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;
/**
* A read/write HeapDoubleBuffer.
*/
class HeapDoubleBuffer
extends DoubleBuffer
{
// For speed these fields are actually declared in X-Buffer;
// these declarations are here as documentation
/*
protected final double[] hb;
protected final int offset;
*/
HeapDoubleBuffer(int cap, int lim) { // package-private
super(-1, 0, lim, cap, new double[cap], 0);
/*
hb = new double[cap];
offset = 0;
*/
}
HeapDoubleBuffer(double[] buf, int off, int len) { // package-private
super(-1, off, off + len, buf.length, buf, 0);
/*
hb = buf;
offset = 0;
*/
}
protected HeapDoubleBuffer(double[] buf,
int mark, int pos, int lim, int cap,
int off)
{
super(mark, pos, lim, cap, buf, off);
/*
hb = buf;
offset = off;
*/
}
public DoubleBuffer slice() {
return new HeapDoubleBuffer(hb,
-1,
0,
this.remaining(),
this.remaining(),
this.position() + offset);
}
public DoubleBuffer duplicate() {
return new HeapDoubleBuffer(hb,
this.markValue(),
this.position(),
this.limit(),
this.capacity(),
offset);
}
public DoubleBuffer asReadOnlyBuffer() {
return new HeapDoubleBufferR(hb,
this.markValue(),
this.position(),
this.limit(),
this.capacity(),
offset);
}
protected int ix(int i) {
return i + offset;
}
public double get() {
return hb[ix(nextGetIndex())];
}
public double get(int i) {
return hb[ix(checkIndex(i))];
}
public DoubleBuffer get(double[] 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 boolean isDirect() {
return false;
}
public boolean isReadOnly() {
return false;
}
public DoubleBuffer put(double x) {
hb[ix(nextPutIndex())] = x;
return this;
}
public DoubleBuffer put(int i, double x) {
hb[ix(checkIndex(i))] = x;
return this;
}
public DoubleBuffer put(double[] 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 DoubleBuffer put(DoubleBuffer src) {
if (src instanceof HeapDoubleBuffer) {
if (src == this)
throw new IllegalArgumentException();
HeapDoubleBuffer sb = (HeapDoubleBuffer)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 DoubleBuffer compact() {
System.arraycopy(hb, ix(position()), hb, ix(0), remaining());
position(remaining());
limit(capacity());
discardMark();
return this;
}
public ByteOrder order() {
return ByteOrder.nativeOrder();
}
}
Loading...
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化
1
https://gitee.com/cxylk/Java-Notes.git
git@gitee.com:cxylk/Java-Notes.git
cxylk
Java-Notes
Java-Notes
main

搜索帮助