diff options
| author |  Jeff King <peff@peff.net> | 2017-02-08 15:53:07 -0500 |
|---|---|---|
| committer |  Junio C Hamano <gitster@pobox.com> | 2017-02-08 15:39:55 -0800 |
| commit | 29c2bd5fa8cb97eedcd463d49cfc7e753feb3145 (patch) | |
| tree | 8822280e8073c9af3dccb363d81a881382f6f879 /daemon.c | |
| parent | fetch-pack: cache results of for_each_alternate_ref (diff) | |
| download | tgif-29c2bd5fa8cb97eedcd463d49cfc7e753feb3145.tar.xz | |
add oidset API
This is similar to many of our uses of sha1-array, but it
overcomes one limitation of a sha1-array: when you are
de-duplicating a large input with relatively few unique
entries, sha1-array uses 20 bytes per non-unique entry.
Whereas this set will use memory linear in the number of
unique entries (albeit a few more than 20 bytes due to
hashmap overhead).
Signed-off-by: Jeff King <peff@peff.net>
Signed-off-by: Junio C Hamano <gitster@pobox.com>
Diffstat (limited to 'daemon.c')
0 files changed, 0 insertions, 0 deletions