Re: git and larger trees, not so fast?
From: Linus Torvalds <torvalds@linux-foundation.org>
Date: 2016-06-15 22:43:28
Possibly related (same subject, not in this thread)
- 2016-06-15 · Re: git and larger trees, not so fast? · moe <hidden>
- 2016-06-15 · git and larger trees, not so fast? · moe <hidden>
- 2016-06-15 · git and larger trees, not so fast? · moe <hidden>
- 2016-06-15 · Re: git and larger trees, not so fast? · Linus Torvalds <torvalds@linux-foundation.org>
- 2016-06-15 · Re: git and larger trees, not so fast? · Linus Torvalds <torvalds@linux-foundation.org>
On Thu, 9 Aug 2007, Linus Torvalds wrote:
So "builtin-read-tree.c" (or rather unpack-trees.c) would need the same kind of logic.
The path seems to be:
cmd_read_tree ->
unpack_trees ->
unpack_trees_rec ->
[ recursive .. unpack_trees_rec ] ->
oneway_merge ->
keep_entry ->
add_index_entry()
and here again we end up having the same insertion sort issue.
Linus