Staging
v0.5.1
v0.5.1
Revision 7cdafcaacf677b9e0700fa988c247bda192db48d authored by Johannes Schindelin on 04 December 2019, 20:33:29 UTC, committed by Johannes Schindelin on 06 December 2019, 15:26:58 UTC
Signed-off-by: Johannes Schindelin <johannes.schindelin@gmx.de>
1 parent e904deb
oidset.h
#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 */
Computing file changes ...