summaryrefslogtreecommitdiff
path: root/usage.c
diff options
context:
space:
mode:
authorLibravatar Derrick Stolee <dstolee@microsoft.com>2018-07-20 16:33:25 +0000
committerLibravatar Junio C Hamano <gitster@pobox.com>2018-07-20 15:38:56 -0700
commit1fee1242577ae23b32c33ff1122402bb228f2692 (patch)
tree3120c581683f0e34652c17ef9d3d8f9cce2541e0 /usage.c
parenttest-reach: test can_all_from_reach_with_flags (diff)
downloadtgif-1fee1242577ae23b32c33ff1122402bb228f2692.tar.xz
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>
Diffstat (limited to 'usage.c')
0 files changed, 0 insertions, 0 deletions