private String toString(final int ridx, final int widx) { return "BufferSlice[" + Integer.toHexString(hashCode()) + "] {" + "buffer size=" + bufferSize + ", elements in pool=" + elementsCount(ridx, widx) + ", poll index=" + unmask(ridx) + ", poll wrap bit=" + (fillHighestOneBitRight( getWrappingBit(ridx)) & 1) + ", offer index=" + unmask(widx) + ", offer wrap bit=" + (fillHighestOneBitRight( getWrappingBit(widx)) & 1) + ", maxPoolSize=" + maxPoolSize + '}'; }
private String toString(final int ridx, final int widx) { return "BufferSlice[" + Integer.toHexString(hashCode()) + "] {" + "buffer size=" + bufferSize + ", elements in pool=" + elementsCount(ridx, widx) + ", poll index=" + unmask(ridx) + ", poll wrap bit=" + (fillHighestOneBitRight( getWrappingBit(ridx)) & 1) + ", offer index=" + unmask(widx) + ", offer wrap bit=" + (fillHighestOneBitRight( getWrappingBit(widx)) & 1) + ", maxPoolSize=" + maxPoolSize + '}'; }
private String toString(final int ridx, final int widx) { return "BufferSlice[" + Integer.toHexString(hashCode()) + "] {" + "buffer size=" + bufferSize + ", elements in pool=" + elementsCount(ridx, widx) + ", poll index=" + unmask(ridx) + ", poll wrap bit=" + (fillHighestOneBitRight( getWrappingBit(ridx)) & 1) + ", offer index=" + unmask(widx) + ", offer wrap bit=" + (fillHighestOneBitRight( getWrappingBit(widx)) & 1) + ", maxPoolSize=" + maxPoolSize + '}'; }
private String toString(final int ridx, final int widx) { return "BufferSlice[" + Integer.toHexString(hashCode()) + "] {" + "buffer size=" + bufferSize + ", elements in pool=" + elementsCount(ridx, widx) + ", poll index=" + unmask(ridx) + ", poll wrap bit=" + (fillHighestOneBitRight( getWrappingBit(ridx)) & 1) + ", offer index=" + unmask(widx) + ", offer wrap bit=" + (fillHighestOneBitRight( getWrappingBit(widx)) & 1) + ", maxPoolSize=" + maxPoolSize + '}'; }
private String toString(final int ridx, final int widx) { return "BufferSlice[" + Integer.toHexString(hashCode()) + "] {" + "buffer size=" + bufferSize + ", elements in pool=" + elementsCount(ridx, widx) + ", poll index=" + unmask(ridx) + ", poll wrap bit=" + (fillHighestOneBitRight( getWrappingBit(ridx)) & 1) + ", offer index=" + unmask(widx) + ", offer wrap bit=" + (fillHighestOneBitRight( getWrappingBit(widx)) & 1) + ", maxPoolSize=" + maxPoolSize + '}'; }
private String toString(final int ridx, final int widx) { return "BufferSlice[" + Integer.toHexString(hashCode()) + "] {" + "buffer size=" + bufferSize + ", elements in pool=" + elementsCount(ridx, widx) + ", poll index=" + unmask(ridx) + ", poll wrap bit=" + (fillHighestOneBitRight( getWrappingBit(ridx)) & 1) + ", offer index=" + unmask(widx) + ", offer wrap bit=" + (fillHighestOneBitRight( getWrappingBit(widx)) & 1) + ", maxPoolSize=" + maxPoolSize + '}'; }
private String toString(final int ridx, final int widx) { return "BufferSlice[" + Integer.toHexString(hashCode()) + "] {" + "buffer size=" + bufferSize + ", elements in pool=" + elementsCount(ridx, widx) + ", poll index=" + unmask(ridx) + ", poll wrap bit=" + (fillHighestOneBitRight( getWrappingBit(ridx)) & 1) + ", offer index=" + unmask(widx) + ", offer wrap bit=" + (fillHighestOneBitRight( getWrappingBit(widx)) & 1) + ", maxPoolSize=" + maxPoolSize + '}'; }
private String toString(final int ridx, final int widx) { return "BufferSlice[" + Integer.toHexString(hashCode()) + "] {" + "buffer size=" + bufferSize + ", elements in pool=" + elementsCount(ridx, widx) + ", poll index=" + unmask(ridx) + ", poll wrap bit=" + (fillHighestOneBitRight( getWrappingBit(ridx)) & 1) + ", offer index=" + unmask(widx) + ", offer wrap bit=" + (fillHighestOneBitRight( getWrappingBit(widx)) & 1) + ", maxPoolSize=" + maxPoolSize + '}'; }
public int elementsCount() { int sum = 0; for (int i = 0; i < slices.length; i++) { sum += slices[i].elementsCount(); } return sum; }
public int elementsCount() { int sum = 0; for (int i = 0; i < slices.length; i++) { sum += slices[i].elementsCount(); } return sum; }
public int elementsCount() { int sum = 0; for (int i = 0; i < slices.length; i++) { sum += slices[i].elementsCount(); } return sum; }
public int elementsCount() { int sum = 0; for (int i = 0; i < slices.length; i++) { sum += slices[i].elementsCount(); } return sum; }
public int elementsCount() { int sum = 0; for (int i = 0; i < slices.length; i++) { sum += slices[i].elementsCount(); } return sum; }
public int elementsCount() { int sum = 0; for (int i = 0; i < slices.length; i++) { sum += slices[i].elementsCount(); } return sum; }
public int elementsCount() { int sum = 0; for (int i = 0; i < slices.length; i++) { sum += slices[i].elementsCount(); } return sum; }
public int elementsCount() { int sum = 0; for (int i = 0; i < slices.length; i++) { sum += slices[i].elementsCount(); } return sum; }
public int elementsCount() { int sum = 0; for (int i = 0; i < slices.length; i++) { sum += slices[i].elementsCount(); } return sum; }
public int elementsCount() { int sum = 0; for (int i = 0; i < slices.length; i++) { sum += slices[i].elementsCount(); } return sum; }
public int elementsCount() { int sum = 0; for (int i = 0; i < slices.length; i++) { sum += slices[i].elementsCount(); } return sum; }
public int elementsCount() { int sum = 0; for (int i = 0; i < slices.length; i++) { sum += slices[i].elementsCount(); } return sum; }