mirror of
https://github.com/MarginaliaSearch/MarginaliaSearch.git
synced 2025-02-23 13:09:00 +00:00
Bugfix for rare bug where some queries may miss hits due to BTreeReader's retain function giving up too fast.
This commit is contained in:
parent
baaf21911a
commit
c057ce74a8
@ -52,8 +52,10 @@ public class BTreeReader {
|
|||||||
public void retainEntries(BTreeQueryBuffer buffer) {
|
public void retainEntries(BTreeQueryBuffer buffer) {
|
||||||
if (header.layers() == 0) {
|
if (header.layers() == 0) {
|
||||||
BTreePointer pointer = new BTreePointer(header);
|
BTreePointer pointer = new BTreePointer(header);
|
||||||
|
while (buffer.hasMore()) {
|
||||||
pointer.retainData(buffer);
|
pointer.retainData(buffer);
|
||||||
}
|
}
|
||||||
|
}
|
||||||
retainSingle(buffer);
|
retainSingle(buffer);
|
||||||
}
|
}
|
||||||
|
|
||||||
@ -61,8 +63,10 @@ public class BTreeReader {
|
|||||||
public void rejectEntries(BTreeQueryBuffer buffer) {
|
public void rejectEntries(BTreeQueryBuffer buffer) {
|
||||||
if (header.layers() == 0) {
|
if (header.layers() == 0) {
|
||||||
BTreePointer pointer = new BTreePointer(header);
|
BTreePointer pointer = new BTreePointer(header);
|
||||||
|
while (buffer.hasMore()) {
|
||||||
pointer.rejectData(buffer);
|
pointer.rejectData(buffer);
|
||||||
}
|
}
|
||||||
|
}
|
||||||
rejectSingle(buffer);
|
rejectSingle(buffer);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
Loading…
Reference in New Issue
Block a user