mirror of
https://github.com/git/git.git
synced 2024-11-27 20:14:30 +08:00
29c2bd5fa8
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>
50 lines
1015 B
C
50 lines
1015 B
C
#include "cache.h"
|
|
#include "oidset.h"
|
|
|
|
struct oidset_entry {
|
|
struct hashmap_entry hash;
|
|
struct object_id oid;
|
|
};
|
|
|
|
static int oidset_hashcmp(const void *va, const void *vb,
|
|
const void *vkey)
|
|
{
|
|
const struct oidset_entry *a = va, *b = vb;
|
|
const struct object_id *key = vkey;
|
|
return oidcmp(&a->oid, key ? key : &b->oid);
|
|
}
|
|
|
|
int oidset_contains(const struct oidset *set, const struct object_id *oid)
|
|
{
|
|
struct hashmap_entry key;
|
|
|
|
if (!set->map.cmpfn)
|
|
return 0;
|
|
|
|
hashmap_entry_init(&key, sha1hash(oid->hash));
|
|
return !!hashmap_get(&set->map, &key, oid);
|
|
}
|
|
|
|
int oidset_insert(struct oidset *set, const struct object_id *oid)
|
|
{
|
|
struct oidset_entry *entry;
|
|
|
|
if (!set->map.cmpfn)
|
|
hashmap_init(&set->map, oidset_hashcmp, 0);
|
|
|
|
if (oidset_contains(set, oid))
|
|
return 1;
|
|
|
|
entry = xmalloc(sizeof(*entry));
|
|
hashmap_entry_init(&entry->hash, sha1hash(oid->hash));
|
|
oidcpy(&entry->oid, oid);
|
|
|
|
hashmap_add(&set->map, entry);
|
|
return 0;
|
|
}
|
|
|
|
void oidset_clear(struct oidset *set)
|
|
{
|
|
hashmap_free(&set->map, 1);
|
|
}
|