Mirror/MarginaliaSearch
1
0
Fork 0
mirror of https://github.com/MarginaliaSearch/MarginaliaSearch.git synced 2025-02-24 05:18:58 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

(btree) Add more consistent asserts on sortedness

Browse Source
This commit is contained in:
Viktor Lofgren 2023-09-01 15:45:02 +02:00
parent bafc2a1f30
commit 04212b2cef
2 changed files with 3 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
code/libraries/btree/src/main/java/nu/marginalia/btree/BTreeReader.java
View File

@ -123,9 +123,7 @@ public class BTreeReader {
*/ */
public long[] queryData(long[] keys, int offset) { public long[] queryData(long[] keys, int offset) {
if (getClass().desiredAssertionStatus()) { assert(isSorted(keys)) : "The input array docIds is assumed to be sorted";
assert(isSorted(keys));
}
if (header.layers() == 0) { if (header.layers() == 0) {
return queryDataNoIndex(keys, offset); return queryDataNoIndex(keys, offset);

2
code/libraries/btree/src/main/java/nu/marginalia/btree/BTreeWriter.java
View File

@ -41,6 +41,8 @@ public class BTreeWriter {
throw new IllegalStateException("Dog ear was not overwritten: " + header); throw new IllegalStateException("Dog ear was not overwritten: " + header);
} }
assert slice.isSortedN(ctx.entrySize) : "Provided data was not sorted";
if (header.layers() >= 1) { // Omit layer if data fits within a single block if (header.layers() >= 1) { // Omit layer if data fits within a single block
writeIndex(header); writeIndex(header);
} }