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
..
nu/marginalia/btree	(btree) Roll back optimization of queryDataWithIndex	2024-05-19 11:29:28 +02:00