MarginaliaSearch/code/libraries/btree/test/nu/marginalia/btree
Viktor Lofgren daf2a8df54 (btree) Roll back optimization of queryDataWithIndex
It had been previously assumed that re-writing this function in the style of retain() would make it faster, but it had the opposite effect.

The reason why retain is so fast due to properties of the data that hold true when intersecting document lists, where long runs of adjacent documents are expected, but not when looking up the data associated with the already intersected documents, where the data is more sparse.
2024-05-19 11:29:28 +02:00
..
BTreeReaderQueryDataWithIndexTest.java (btree) Roll back optimization of queryDataWithIndex 2024-05-19 11:29:28 +02:00
BTreeReaderQueryDataWithoutIndexTest.java (refac) Remove src/main from all source code paths. 2024-02-23 16:13:40 +01:00
BTreeReaderRejectRetainWithIndexTest.java (array) Clean up the Array library 2024-05-18 13:23:06 +02:00
BTreeReaderRejectRetainWithoutIndexTest.java (array) Clean up the Array library 2024-05-18 13:23:06 +02:00
BTreeWriterTest.java (btree) Clean up code 2024-05-18 18:03:17 +02:00