June 12, 2026
3:03 p.m.
On Fri Jun 12 15:04:05 2026 +0000, Jacek Caban wrote:
I think it would be easier to use `rb_tree` with each element containing a list of named items matching the name. Good idea, reworked that way: the tree entry holds the list of items sharing the name in registration order, which also drops the lazy rebuild and shrinks the diff. The numbers are unchanged, flat ~120 ms for 300k references regardless of item position or count.
-- https://gitlab.winehq.org/wine/wine/-/merge_requests/11130#note_142967