This action will force synchronization from Stefan/Java8Source, which will overwrite any changes that you have made since you forked the repository, and can not be recovered!!!
Synchronous operation will process in the background and will refresh the page when finishing processing. Please be patient.
/** 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 ByteBufferAsLongBufferB // package-privateextends LongBuffer{protected final ByteBuffer bb;protected final int offset;ByteBufferAsLongBufferB(ByteBuffer bb) { // package-privatesuper(-1, 0,bb.remaining() >> 3,bb.remaining() >> 3);this.bb = bb;// enforce limit == capacityint cap = this.capacity();this.limit(cap);int pos = this.position();assert (pos <= cap);offset = pos;}ByteBufferAsLongBufferB(ByteBuffer bb,int mark, int pos, int lim, int cap,int off){super(mark, pos, lim, cap);this.bb = bb;offset = off;}public LongBuffer slice() {int pos = this.position();int lim = this.limit();assert (pos <= lim);int rem = (pos <= lim ? lim - pos : 0);int off = (pos << 3) + offset;assert (off >= 0);return new ByteBufferAsLongBufferB(bb, -1, 0, rem, rem, off);}public LongBuffer duplicate() {return new ByteBufferAsLongBufferB(bb,this.markValue(),this.position(),this.limit(),this.capacity(),offset);}public LongBuffer asReadOnlyBuffer() {return new ByteBufferAsLongBufferRB(bb,this.markValue(),this.position(),this.limit(),this.capacity(),offset);}protected int ix(int i) {return (i << 3) + offset;}public long get() {return Bits.getLongB(bb, ix(nextGetIndex()));}public long get(int i) {return Bits.getLongB(bb, ix(checkIndex(i)));}public LongBuffer put(long x) {Bits.putLongB(bb, ix(nextPutIndex()), x);return this;}public LongBuffer put(int i, long x) {Bits.putLongB(bb, ix(checkIndex(i)), x);return this;}public LongBuffer 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 << 3);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.BIG_ENDIAN;}}
此处可能存在不合适展示的内容,页面不予展示。您可通过相关编辑功能自查并修改。
如您确认内容无涉及 不当用语 / 纯广告导流 / 暴力 / 低俗色情 / 侵权 / 盗版 / 虚假 / 无价值内容或违法国家有关法律法规的内容,可点击提交进行申诉,我们将尽快为您处理。