summaryrefslogtreecommitdiff
path: root/Documentation/RelNotes/1.5.4.txt
diff options
context:
space:
mode:
authorLibravatar Julian Phillips <julian@quantumfyre.co.uk>2011-09-29 23:11:42 +0100
committerLibravatar Junio C Hamano <gitster@pobox.com>2011-09-30 12:28:34 -0700
commite9c4c11165e48b8f3fe1b4fc4db513f8e57202fb (patch)
tree0e5cc781ef4481edeb066d397c98e656d7caaba4 /Documentation/RelNotes/1.5.4.txt
parentDon't sort ref_list too early (diff)
downloadtgif-e9c4c11165e48b8f3fe1b4fc4db513f8e57202fb.tar.xz
refs: Use binary search to lookup refs faster
Currently we linearly search through lists of refs when we need to find a specific ref. This can be very slow if we need to lookup a large number of refs. By changing to a binary search we can make this faster. In order to be able to use a binary search we need to change from using linked lists to arrays, which we can manage using ALLOC_GROW. We can now also use the standard library qsort function to sort the refs arrays. Signed-off-by: Julian Phillips <julian@quantumfyre.co.uk> Signed-off-by: Junio C Hamano <gitster@pobox.com>
Diffstat (limited to 'Documentation/RelNotes/1.5.4.txt')
0 files changed, 0 insertions, 0 deletions