mirror of
https://github.com/git/git.git
synced 2024-11-25 02:44:48 +08:00
9e6fabde82
This is similar to using the hashmap in hashmap.c, but with an easier-to-use API. In particular, custom entry comparisons no longer need to be written, and lookups can be done without constructing a temporary entry structure. This is implemented as a thin wrapper over the hashmap API. In particular, this means that there is an additional 4-byte overhead due to the fact that the first 4 bytes of the hash is redundantly stored. For now, I'm taking the simpler approach, but if need be, we can reimplement oidmap without affecting the callers significantly. oidset has been updated to use oidmap. Signed-off-by: Jonathan Tan <jonathantanmy@google.com> Signed-off-by: Junio C Hamano <gitster@pobox.com>
48 lines
1.2 KiB
C
48 lines
1.2 KiB
C
#ifndef OIDSET_H
|
|
#define OIDSET_H
|
|
|
|
#include "oidmap.h"
|
|
|
|
/**
|
|
* This API is similar to sha1-array, in that it maintains a set of object ids
|
|
* in a memory-efficient way. The major differences are:
|
|
*
|
|
* 1. It uses a hash, so we can do online duplicate removal, rather than
|
|
* sort-and-uniq at the end. This can reduce memory footprint if you have
|
|
* a large list of oids with many duplicates.
|
|
*
|
|
* 2. The per-unique-oid memory footprint is slightly higher due to hash
|
|
* table overhead.
|
|
*/
|
|
|
|
/**
|
|
* A single oidset; should be zero-initialized (or use OIDSET_INIT).
|
|
*/
|
|
struct oidset {
|
|
struct oidmap map;
|
|
};
|
|
|
|
#define OIDSET_INIT { OIDMAP_INIT }
|
|
|
|
/**
|
|
* Returns true iff `set` contains `oid`.
|
|
*/
|
|
int oidset_contains(const struct oidset *set, const struct object_id *oid);
|
|
|
|
/**
|
|
* Insert the oid into the set; a copy is made, so "oid" does not need
|
|
* to persist after this function is called.
|
|
*
|
|
* Returns 1 if the oid was already in the set, 0 otherwise. This can be used
|
|
* to perform an efficient check-and-add.
|
|
*/
|
|
int oidset_insert(struct oidset *set, const struct object_id *oid);
|
|
|
|
/**
|
|
* Remove all entries from the oidset, freeing any resources associated with
|
|
* it.
|
|
*/
|
|
void oidset_clear(struct oidset *set);
|
|
|
|
#endif /* OIDSET_H */
|