Re: [PATCH 21/22] teach the merge algorithm about cache iterators

From: Daniel Barkalow <barkalow@iabervon.org>
Date: Sep 12, 2005, 20:43 UTC
Message-ID: <Pine.LNX.4.63.0509121633480.23242@iabervon.org>
In-Reply-To: <20050912145629.28120.70337.stgit@dexter.citi.umich.edu>

On Mon, 12 Sep 2005, Chuck Lever wrote:

> For now, we simply replace indpos with a cache cursor.  Likely more
> changes will be needed after we successfully replace the cache array
> with an abstract data type.

The right order is probably to add the concept of a cache that isn't the one that normal functions deal with, have read_cache_unmerged return such a thing, call cc_init with that, and rip out all of the removal and position adjustment code. Then read_tree won't care at all about the internal structure of the cache type, and it can be replaced without any problem.

	-Daniel
*This .sig left intentionally blank*

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