Re: [PATCH 21/22] teach the merge algorithm about cache iterators
- From
Junio C Hamano <junkio@cox.net>
- Date
- Sep 14, 2005, 17:50 UTC
- Message-ID
- <7vbr2vlest.fsf@assigned-by-dhcp.cox.net>
- In-Reply-To
- <Pine.LNX.4.63.0509141214490.23242@iabervon.org>
Daniel Barkalow <barkalow@iabervon.org> writes:
> Another thing to try would be the original dynamic table implementation, > plus a hashtable for name lookups, generated the first time a lookup is > attempted (since some programs don't do any lookups by name). This has the > advantage of skipping the O(n) startup.
How about just the original dynamic table implementation with the original binary search name lookups? Am I missing something?