Re: [PATCH] Adding a cache of commit to patch-id pairs to speed up git-cherry
- From
Jeff King <peff@peff.net>
- Date
- Jun 2, 2008, 06:42 UTC
- Message-ID
- <20080602064218.GA15144@sigill.intra.peff.net>
- In-Reply-To
- <alpine.DEB.1.00.0806020649110.13507@racer.site.net>
On Mon, Jun 02, 2008 at 07:13:14AM +0100, Johannes Schindelin wrote:
> I do not think that this "read-the-entire-table-into-memory" paradigm is a > wise choice. mmap()ing, I would have understood, but reading a potentially > pretty large table into memory?
When I was just a git-youth, I wrote a fast mmap-based cache for storing SHA1 pairs. It might give some direction. You should be able to find it here:
http://mid.gmane.org/20060629035849.GA30749@coredump.intra.peff.net
It mmaps and binary searches a sorted list. New entries are added to an in-memory list, and then at the end of a run, the two sorted lists are merged to create the new on-disk version.
-Peff