summaryrefslogtreecommitdiff
path: root/t/t4013/diff.diff_initial..side
diff options
context:
space:
mode:
authorTaylor Blau <me@ttaylorr.com>2026-05-19 11:57:45 -0400
committerJunio C Hamano <gitster@pobox.com>2026-05-20 11:31:13 +0900
commit3a5ebfac2f8910f335dc1f269e8a8cbdcacb7157 (patch)
tree3d5c9e4ed6772ff6c9ec80d1c4dab1f4ce264b07 /t/t4013/diff.diff_initial..side
parentddaa7a6fb79038a30b59341ed3f0f2097014ccbf (diff)
midx: build `keep_hashes` array in order
Instead of filling the keep_hashes array using reverse indexing (e.g., `keep_hashes[count - i - 1]`) while traversing linked lists forward, collect linked list nodes into a temporary `layers` array and then iterate it backwards to fill `keep_hashes` sequentially. This makes the filling logic easier to follow, since each segment of the array is filled with a simple forward-marching index. Moreover, this change prepares us for a subsequent commit that will switch to using a `strvec`. Signed-off-by: Taylor Blau <me@ttaylorr.com> Signed-off-by: Junio C Hamano <gitster@pobox.com>
Diffstat (limited to 't/t4013/diff.diff_initial..side')
0 files changed, 0 insertions, 0 deletions