On Mon, Nov 16, 2015 at 8:25 PM, Stefan Beller <sbel...@google.com> wrote: > Instead of having to search all branches for the requested sha1, we could have > some sort of data structure to make it not an O(n) operation (n being > all objects > in the repo). > > Maybe I overestimate the work which needs to be done, because the server has > bitmaps nowadays.
Quote from [1] > If we take the kernel history in rev-list and pick two commits that > are roughly ~10,000 commits apart from one another, JGit can compute > the rev-list --objects between these two commits in about 120 > milliseconds (git-core should be faster, or at least comparable). I think we should be fine (note that --objects is a lot heavier than commit walking). Though.. I just tried it on git.git. 10k commits (without --objects) take about 200ms with C Git.. [1] http://marc.info/?l=git&m=133374018207891&w=2 -- Duy -- To unsubscribe from this list: send the line "unsubscribe git" in the body of a message to majord...@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html
