5 * This API is similar to sha1-array, in that it maintains a set of object ids
6 * in a memory-efficient way. The major differences are:
8 * 1. It uses a hash, so we can do online duplicate removal, rather than
9 * sort-and-uniq at the end. This can reduce memory footprint if you have
10 * a large list of oids with many duplicates.
12 * 2. The per-unique-oid memory footprint is slightly higher due to hash
17 * A single oidset; should be zero-initialized (or use OIDSET_INIT).
23 #define OIDSET_INIT { { NULL } }
26 * Returns true iff `set` contains `oid`.
28 int oidset_contains(const struct oidset
*set
, const struct object_id
*oid
);
31 * Insert the oid into the set; a copy is made, so "oid" does not need
32 * to persist after this function is called.
34 * Returns 1 if the oid was already in the set, 0 otherwise. This can be used
35 * to perform an efficient check-and-add.
37 int oidset_insert(struct oidset
*set
, const struct object_id
*oid
);
40 * Remove all entries from the oidset, freeing any resources associated with
43 void oidset_clear(struct oidset
*set
);