summaryrefslogtreecommitdiff
path: root/tests/diff/diff_helpers.h
diff options
context:
space:
mode:
authorVicent Marti <tanoku@gmail.com>2015-10-27 22:17:32 +0100
committerVicent Marti <tanoku@gmail.com>2015-10-27 22:44:13 +0100
commitd307a0134b97475abb03d0365458c318ba817f95 (patch)
tree526236078ce9cb2472dc4a2a4b3a735af6265797 /tests/diff/diff_helpers.h
parent2382d1bc6250ced02b0f352c87210fededf2188d (diff)
downloadlibgit2-d307a0134b97475abb03d0365458c318ba817f95.tar.gz
reuc: Be smarter when inserting new REUC entries
Inserting new REUC entries can quickly become pathological given that each insert unsorts the REUC vector, and both subsequent lookups *and* insertions will require sorting it again before being successful. To avoid this, we're switching to `git_vector_insert_sorted`: this keeps the REUC vector constantly sorted and lets us use the `on_dup` callback to skip an extra binary search on each insertion.
Diffstat (limited to 'tests/diff/diff_helpers.h')
0 files changed, 0 insertions, 0 deletions