@Override void pack(long[] values, int numValues, int block, float acceptableOverheadRatio) { long min = values[0]; for (int i = 1; i < numValues; ++i) { min = Math.min(min, values[i]); } for (int i = 0; i < numValues; ++i) { values[i] -= min; } super.pack(values, numValues, block, acceptableOverheadRatio); mins[block] = min; }
/** Add a new element to this builder. */ public Builder add(long l) { if (pending == null) { throw new IllegalStateException("Cannot be reused after build()"); } if (pendingOff == pending.length) { // check size if (values.length == valuesOff) { final int newLength = ArrayUtil.oversize(valuesOff + 1, 8); grow(newLength); } pack(); } pending[pendingOff++] = l; size += 1; return this; }
@Override void pack(long[] values, int numValues, int block, float acceptableOverheadRatio) { long min = values[0]; for (int i = 1; i < numValues; ++i) { min = Math.min(min, values[i]); } for (int i = 0; i < numValues; ++i) { values[i] -= min; } super.pack(values, numValues, block, acceptableOverheadRatio); mins[block] = min; }
/** Add a new element to this builder. */ public Builder add(long l) { if (pending == null) { throw new IllegalStateException("Cannot be reused after build()"); } if (pendingOff == pending.length) { // check size if (values.length == valuesOff) { final int newLength = ArrayUtil.oversize(valuesOff + 1, 8); grow(newLength); } pack(); } pending[pendingOff++] = l; size += 1; return this; }
/** Add a new element to this builder. */ public Builder add(long l) { if (pending == null) { throw new IllegalStateException("Cannot be reused after build()"); } if (pendingOff == pending.length) { // check size if (values.length == valuesOff) { final int newLength = ArrayUtil.oversize(valuesOff + 1, 8); grow(newLength); } pack(); } pending[pendingOff++] = l; size += 1; return this; }
/** Add a new element to this builder. */ public Builder add(long l) { if (pending == null) { throw new IllegalStateException("Cannot be reused after build()"); } if (pendingOff == pending.length) { // check size if (values.length == valuesOff) { final int newLength = ArrayUtil.oversize(valuesOff + 1, 8); grow(newLength); } pack(); } pending[pendingOff++] = l; size += 1; return this; }
private void pack() { pack(pending, pendingOff, valuesOff, acceptableOverheadRatio); ramBytesUsed += values[valuesOff].ramBytesUsed(); valuesOff += 1; // reset pending buffer pendingOff = 0; }
@Override void pack(long[] values, int numValues, int block, float acceptableOverheadRatio) { long min = values[0]; for (int i = 1; i < numValues; ++i) { min = Math.min(min, values[i]); } for (int i = 0; i < numValues; ++i) { values[i] -= min; } super.pack(values, numValues, block, acceptableOverheadRatio); mins[block] = min; }
@Override void pack(long[] values, int numValues, int block, float acceptableOverheadRatio) { long min = values[0]; for (int i = 1; i < numValues; ++i) { min = Math.min(min, values[i]); } for (int i = 0; i < numValues; ++i) { values[i] -= min; } super.pack(values, numValues, block, acceptableOverheadRatio); mins[block] = min; }
private void pack() { pack(pending, pendingOff, valuesOff, acceptableOverheadRatio); ramBytesUsed += values[valuesOff].ramBytesUsed(); valuesOff += 1; // reset pending buffer pendingOff = 0; }
private void pack() { pack(pending, pendingOff, valuesOff, acceptableOverheadRatio); ramBytesUsed += values[valuesOff].ramBytesUsed(); valuesOff += 1; // reset pending buffer pendingOff = 0; }
final void finish() { if (pendingOff > 0) { if (values.length == valuesOff) { grow(valuesOff + 1); } pack(); } }
final void finish() { if (pendingOff > 0) { if (values.length == valuesOff) { grow(valuesOff + 1); } pack(); } }
final void finish() { if (pendingOff > 0) { if (values.length == valuesOff) { grow(valuesOff + 1); } pack(); } }
private void pack() { pack(pending, pendingOff, valuesOff, acceptableOverheadRatio); ramBytesUsed += values[valuesOff].ramBytesUsed(); valuesOff += 1; // reset pending buffer pendingOff = 0; }
final void finish() { if (pendingOff > 0) { if (values.length == valuesOff) { grow(valuesOff + 1); } pack(); } }