| commit | 1fee1242577ae23b32c33ff1122402bb228f2692 | |
| author | Derrick Stolee <dstolee@microsoft.com> | |
| Fri, 20 Jul 2018 16:33:25 +0000 (20 16:33 +0000) | ||
| committer | Junio C Hamano <gitster@pobox.com> | |
| Fri, 20 Jul 2018 22:38:56 +0000 (20 15:38 -0700) | ||
| tree | 3120c581683f0e34652c17ef9d3d8f9cce2541e0 | treesnapshot (tar.gz zip) |
| parent | 1792bc125069e3e5b59f0158e259335a07aa7cf5 | commitdiff |
test-reach: test commit_contains
The commit_contains method has two modes which depend on the given
ref_filter struct. We have the "normal" algorithm (which is also the
typically-slow operation) and the "tag" algorithm. This difference is
essentially what changes performance for 'git branch --contains' versus
'git tag --contains'. There are thoughts that the data shapes used by
these two applications justify the different implementations.
Create tests using 'test-tool reach commit_contains [--tag]' to cover
both methods.
Signed-off-by: Derrick Stolee <dstolee@microsoft.com>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
The commit_contains method has two modes which depend on the given
ref_filter struct. We have the "normal" algorithm (which is also the
typically-slow operation) and the "tag" algorithm. This difference is
essentially what changes performance for 'git branch --contains' versus
'git tag --contains'. There are thoughts that the data shapes used by
these two applications justify the different implementations.
Create tests using 'test-tool reach commit_contains [--tag]' to cover
both methods.
Signed-off-by: Derrick Stolee <dstolee@microsoft.com>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
| t/helper/test-reach.c | diffblobblamehistory | |
| t/t6600-test-reach.sh | diffblobblamehistory |