summaryrefslogtreecommitdiffstats
path: root/t/t4018/cpp-function-returning-pointer
diff options
context:
space:
mode:
authorPatrick Steinhardt <ps@pks.im>2024-02-12 09:32:25 +0100
committerJunio C Hamano <gitster@pobox.com>2024-02-12 09:18:04 -0800
commitadb5d2cbe9a0589540ca631fb42e1579e8ee2d60 (patch)
treebc957984242e87c8ebd1ffb3cc19256bd3f19622 /t/t4018/cpp-function-returning-pointer
parentbc7ee2e5e16f0d1e710ef8fab3db59ab11f2bbe7 (diff)
downloadgit-adb5d2cbe9a0589540ca631fb42e1579e8ee2d60.tar.gz
git-adb5d2cbe9a0589540ca631fb42e1579e8ee2d60.zip
reftable/record: introduce function to compare records by key
In some places we need to sort reftable records by their keys to determine their ordering. This is done by first formatting the keys into a `struct strbuf` and then using `strbuf_cmp()` to compare them. This logic is needlessly roundabout and can end up costing quite a bit of CPU cycles, both due to the allocation and formatting logic. Introduce a new `reftable_record_cmp()` function that knows how to compare two records with each other without requiring allocations. Signed-off-by: Patrick Steinhardt <ps@pks.im> Signed-off-by: Junio C Hamano <gitster@pobox.com>
Diffstat (limited to 't/t4018/cpp-function-returning-pointer')
0 files changed, 0 insertions, 0 deletions