mirror of https://github.com/apache/lucene.git
fix ant regenerate
git-svn-id: https://svn.apache.org/repos/asf/lucene/dev/trunk@1642304 13f79535-47bb-0310-9956-ffa450edef68
This commit is contained in:
parent
d439254a5a
commit
20e0d50186
|
@ -57,16 +57,16 @@ FOOTER="""
|
|||
* For every number of bits per value, there is a minimum number of
|
||||
* blocks (b) / values (v) you need to write in order to reach the next block
|
||||
* boundary:
|
||||
* - 16 bits per value -> b=2, v=1
|
||||
* - 24 bits per value -> b=3, v=1
|
||||
* - 50 bits per value -> b=25, v=4
|
||||
* - 63 bits per value -> b=63, v=8
|
||||
* - 16 bits per value -> b=2, v=1
|
||||
* - 24 bits per value -> b=3, v=1
|
||||
* - 50 bits per value -> b=25, v=4
|
||||
* - 63 bits per value -> b=63, v=8
|
||||
* - ...
|
||||
*
|
||||
* A bulk read consists in copying <code>iterations*v</code> values that are
|
||||
* contained in <code>iterations*b</code> blocks into a <code>long[]</code>
|
||||
* (higher values of <code>iterations</code> are likely to yield a better
|
||||
* throughput) => this requires n * (b + 8v) bytes of memory.
|
||||
* throughput): this requires n * (b + 8v) bytes of memory.
|
||||
*
|
||||
* This method computes <code>iterations</code> as
|
||||
* <code>ramBudget / (b + 8v)</code> (since a long is 8 bytes).
|
||||
|
|
|
@ -105,16 +105,6 @@ if __name__ == '__main__':
|
|||
public void clear() {
|
||||
Arrays.fill(values, %s0L);
|
||||
}
|
||||
|
||||
@Override
|
||||
public Object getArray() {
|
||||
return values;
|
||||
}
|
||||
|
||||
@Override
|
||||
public boolean hasArray() {
|
||||
return true;
|
||||
}
|
||||
""" %(MASKS[bpv], CASTS[bpv], CASTS[bpv]))
|
||||
|
||||
if bpv == 64:
|
||||
|
|
|
@ -178,7 +178,7 @@ abstract class Packed64SingleBlock extends PackedInts.MutableImpl {
|
|||
public void fill(int fromIndex, int toIndex, long val) {
|
||||
assert fromIndex >= 0;
|
||||
assert fromIndex <= toIndex;
|
||||
assert PackedInts.bitsRequired(val) <= bitsPerValue;
|
||||
assert PackedInts.unsignedBitsRequired(val) <= bitsPerValue;
|
||||
|
||||
final int valuesPerBlock = 64 / bitsPerValue;
|
||||
if (toIndex - fromIndex <= valuesPerBlock << 1) {
|
||||
|
|
Loading…
Reference in New Issue