On Thu, Jun 10, 2010 at 01:14:21PM -0500, Brian Downing wrote:
That makes it look sort of exponential (perhaps around files^1.5),
though from what I can understand of the find_cache_pos code in
unpack-trees it would depend on the exact shape of the repository. It
does seem to linear-search over whole directory trees of the index
repeatedly, though, which would support the exponential theory.
(I meant polynomial with an exponent > 1 here, not exponential [in the
2^n sense]; sorry!)
-bcd