3 Commits

Author	SHA1	Message	Date
Sergei Golubchik	26e599cd32	mhnsw: make the search less greedy ... introduced a generosity factor that makes the search less greedy. it dramatically improves the recall by making the search a bit slower (for the same recall one can use half the M and smaller ef). had to add Queue::safe_push() method that removes one of the furthest elements (not necessarily the furthest) in the queue to keep it from overflowing.	2024-11-05 14:00:49 -08:00
Vicențiu Ciorbaru	26e5654301	cleanup: simplify Queue<>, add const ... also add const to methods in List<> and Hash_set<> while we're at it	2024-11-05 14:00:48 -08:00
Sergei Golubchik	f5e9c4e9ef	cleanup: Queue and Bounded_queue ... Bounded_queue<> pretended to be a typesafe C++ wrapper on top of pure C queues.h. But it wasn't, it was tightly bounded to filesort and only useful there. * implement Queue<> - a typesafe C++ wrapper on top of QUEUE * move Bounded_queue to filesort.cc, remove pointless "generalizations" change it to use Queue. * remove bounded_queue.h * change subselect_rowid_merge_engine to use Queue, not QUEUE	2024-11-05 14:00:47 -08:00