mirror of https://github.com/apache/lucene.git
remove unnecessary final modifiers
git-svn-id: https://svn.apache.org/repos/asf/lucene/dev/trunk@949270 13f79535-47bb-0310-9956-ffa450edef68
This commit is contained in:
parent
181bcbc149
commit
7e5a4cd67e
|
@ -206,7 +206,7 @@ public class SimpleStandardTermsIndexReader extends StandardTermsIndexReader {
|
||||||
}
|
}
|
||||||
|
|
||||||
@Override
|
@Override
|
||||||
public final void getIndexOffset(BytesRef term, TermsIndexResult result) throws IOException {
|
public void getIndexOffset(BytesRef term, TermsIndexResult result) throws IOException {
|
||||||
// You must call loadTermsIndex if you had specified -1 for indexDivisor
|
// You must call loadTermsIndex if you had specified -1 for indexDivisor
|
||||||
if (coreIndex == null) {
|
if (coreIndex == null) {
|
||||||
throw new IllegalStateException("terms index was not loaded");
|
throw new IllegalStateException("terms index was not loaded");
|
||||||
|
@ -215,7 +215,7 @@ public class SimpleStandardTermsIndexReader extends StandardTermsIndexReader {
|
||||||
}
|
}
|
||||||
|
|
||||||
@Override
|
@Override
|
||||||
public final void getIndexOffset(long ord, TermsIndexResult result) throws IOException {
|
public void getIndexOffset(long ord, TermsIndexResult result) throws IOException {
|
||||||
// You must call loadTermsIndex if you had specified -1 for indexDivisor
|
// You must call loadTermsIndex if you had specified -1 for indexDivisor
|
||||||
if (coreIndex == null) {
|
if (coreIndex == null) {
|
||||||
throw new IllegalStateException("terms index was not loaded");
|
throw new IllegalStateException("terms index was not loaded");
|
||||||
|
@ -334,7 +334,7 @@ public class SimpleStandardTermsIndexReader extends StandardTermsIndexReader {
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
public final boolean nextIndexTerm(long ord, TermsIndexResult result) throws IOException {
|
public boolean nextIndexTerm(long ord, TermsIndexResult result) throws IOException {
|
||||||
int idx = 1 + (int) (ord / totalIndexInterval);
|
int idx = 1 + (int) (ord / totalIndexInterval);
|
||||||
if (idx < numIndexTerms) {
|
if (idx < numIndexTerms) {
|
||||||
fillResult(idx, result);
|
fillResult(idx, result);
|
||||||
|
@ -344,7 +344,7 @@ public class SimpleStandardTermsIndexReader extends StandardTermsIndexReader {
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
private final void fillResult(int idx, TermsIndexResult result) {
|
private void fillResult(int idx, TermsIndexResult result) {
|
||||||
final long offset = termOffsets.get(idx);
|
final long offset = termOffsets.get(idx);
|
||||||
final int length = (int) (termOffsets.get(1+idx) - offset);
|
final int length = (int) (termOffsets.get(1+idx) - offset);
|
||||||
termBytes.fill(result.term, termBytesStart + offset, length);
|
termBytes.fill(result.term, termBytesStart + offset, length);
|
||||||
|
@ -352,7 +352,7 @@ public class SimpleStandardTermsIndexReader extends StandardTermsIndexReader {
|
||||||
result.offset = termsStart + termsDictOffsets.get(idx);
|
result.offset = termsStart + termsDictOffsets.get(idx);
|
||||||
}
|
}
|
||||||
|
|
||||||
public final void getIndexOffset(BytesRef term, TermsIndexResult result) throws IOException {
|
public void getIndexOffset(BytesRef term, TermsIndexResult result) throws IOException {
|
||||||
int lo = 0; // binary search
|
int lo = 0; // binary search
|
||||||
int hi = numIndexTerms - 1;
|
int hi = numIndexTerms - 1;
|
||||||
|
|
||||||
|
@ -388,7 +388,7 @@ public class SimpleStandardTermsIndexReader extends StandardTermsIndexReader {
|
||||||
result.offset = termsStart + termsDictOffsets.get(hi);
|
result.offset = termsStart + termsDictOffsets.get(hi);
|
||||||
}
|
}
|
||||||
|
|
||||||
public final void getIndexOffset(long ord, TermsIndexResult result) throws IOException {
|
public void getIndexOffset(long ord, TermsIndexResult result) throws IOException {
|
||||||
int idx = (int) (ord / totalIndexInterval);
|
int idx = (int) (ord / totalIndexInterval);
|
||||||
// caller must ensure ord is in bounds
|
// caller must ensure ord is in bounds
|
||||||
assert idx < numIndexTerms;
|
assert idx < numIndexTerms;
|
||||||
|
|
Loading…
Reference in New Issue