summaryrefslogtreecommitdiff
path: root/t/t3425-rebase-topology-merges.sh
diff options
context:
space:
mode:
authorLibravatar Jeff King <peff@peff.net>2019-07-30 21:23:37 -0400
committerLibravatar Junio C Hamano <gitster@pobox.com>2019-07-31 10:00:34 -0700
commite1e7a77141bda8f2ab02f5ed8b0030cba793ec2d (patch)
treebe09113dfa2c6d70f9137e9a520f56f2772d9ee5 /t/t3425-rebase-topology-merges.sh
parentGit 2.23-rc0 (diff)
downloadtgif-e1e7a77141bda8f2ab02f5ed8b0030cba793ec2d.tar.xz
t: sort output of hashmap iteration
The iteration order of a hashmap is undefined, and may depend on things like the exact set of items added, or the table has been grown or shrunk. In the case of an oidmap, it even depends on endianness, because we take the oid hash by casting sha1 bytes directly into an unsigned int. Let's sort the test-tool output from any hash iterators. In the case of t0011, this is just future-proofing. But for t0016, it actually fixes a reported failure on the big-endian s390 and nonstop ports. I didn't bother to teach the helper functions to optionally sort output. They are short enough that it's simpler to just repeat them inline for the iteration tests than it is to add a --sort option. Reported-by: Randall S. Becker <rsbecker@nexbridge.com> Signed-off-by: Jeff King <peff@peff.net> Signed-off-by: Junio C Hamano <gitster@pobox.com>
Diffstat (limited to 't/t3425-rebase-topology-merges.sh')
0 files changed, 0 insertions, 0 deletions