git/list[1] front-page[2] threads[3] people[4] search[5] about
 

Re: [PATCH 3/4] Use binary searching on large buckets in git-describe.

From
Junio C Hamano <junkio@cox.net>
Date
Jan 14, 2007, 19:11 UTC
Message-ID
<7v3b6dh19y.fsf@assigned-by-dhcp.cox.net>
In-Reply-To
<20070113222900.GC18011@spearce.org>
"Shawn O. Pearce" <spearce@spearce.org> writes:
> If a project has a really huge number of tags (such as several
> thousand tags) then we are likely to have nearly a hundred tags in
> some buckets.  Scanning those buckets as linked lists could take
> a large amount of time if done repeatedly during history traversal.

I think this is a good idea -- but would you still need the 256 buckets if you do this?

Previous: Shawn O. PearceNext: Shawn O. Pearce
Message 6 of 8 in “Hash tags by commit SHA1 in git-describe.”
  1. 2/4 Hash tags by commit SHA1 in git-describe.Shawn O. Pearce, Jan 13, 2007
  2. Johannes SchindelinJan 14, 2007
  3. Junio C HamanoJan 14, 2007
  4. Shawn O. PearceJan 14, 2007
  5. 3/4 Use binary searching on large buckets in git-describe.Shawn O. Pearce, Jan 13, 2007
  6. Junio C HamanoJan 14, 2007
  7. Shawn O. PearceJan 14, 2007
  8. 4/4 Improve git-describe performance by reducing revision listing.Shawn O. Pearce, Jan 13, 2007

Read the whole thread, see it on lore, or plain text.

$ 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.