summaryrefslogtreecommitdiff
path: root/t/t5515/fetch.br-remote-glob
diff options
context:
space:
mode:
authorLibravatar Karthik Nayak <karthik.188@gmail.com>2015-10-30 14:15:28 +0530
committerLibravatar Junio C Hamano <gitster@pobox.com>2015-10-30 13:50:52 -0700
commit9e468334b41c1d1fc715de177ef1f61a36c1cf01 (patch)
tree5861b609930bbfe709c1f8f09bceb2b2fe570d1a /t/t5515/fetch.br-remote-glob
parentbranch: add '--points-at' option (diff)
downloadtgif-9e468334b41c1d1fc715de177ef1f61a36c1cf01.tar.xz
ref-filter: fallback on alphabetical comparison
In ref-filter.c the comparison of refs while sorting is handled by cmp_ref_sorting() function. When sorting as per numerical values (e.g. --sort=objectsize) there is no fallback comparison when both refs hold the same value. This can cause unexpected results (i.e. the order of listing refs with equal values cannot be pre-determined) as pointed out by Johannes Sixt ($gmane/280117). Hence, fallback to alphabetical comparison based on the refname whenever the other criterion is equal. A test in t3203 was expecting that branch-two sorts before HEAD, which happened to be how qsort(3) on Linux sorted the array, but (1) that outcome was not even guaranteed, and (2) once we start breaking ties with the refname, "HEAD" should sort before "branch-two" so the original expectation was inconsistent with the criterion we now use. Update it to match the new world order, which we can now depend on being stable. Helped-by: Junio C Hamano <gitster@pobox.com> Reported-by: Johannes Sixt <j6t@kdbg.org> Signed-off-by: Karthik Nayak <Karthik.188@gmail.com> Signed-off-by: Junio C Hamano <gitster@pobox.com>
Diffstat (limited to 't/t5515/fetch.br-remote-glob')
0 files changed, 0 insertions, 0 deletions