From: Junio C Hamano <gitster@pobox.com>
Date: Wed, 16 Jul 2025 00:07:38 GMT
Subject: Re: [PATCH 0/3] commit: convert pop_most_recent_commit() to prio_queue
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?