Re: [PATCH 0/3] commit: convert pop_most_recent_commit() to prio_queue

From: Junio C Hamano <gitster@pobox.com>
Date: Jul 16, 2025, 00:07 UTC
Message-ID: <xmqqv7ntdmlx.fsf@gitster.g>
In-Reply-To: <bc079b3c-a472-4f5d-95ca-390f9de25196@web.de>

René Scharfe <l.s.r@web.de> writes:

> Use prio_queue to improve worst-case performance at the cost of slightly
> worse best-case performance.  Then add and use prio_queue_replace() to
> recover that loss.

Would change in the tiebreaking behaviour (aka sort stability) also a cost of this change, as this swaps use of sorted linearly linked list with priority queue?

$ cat FOOTERMessages come from the public archive at lore.kernel.org/git, fetched every hour. The front page is chosen and written each morning by an AI editor and can be wrong; the threads themselves are the record. About and API. For agents: an MCP server at https://gitlist.dev/mcp, and any thread, story or person page as Markdown by adding .md to its URL (or sending Accept: text/markdown). Details in /llms.txt.