color: add support for 12-bit RGB colors
[alt-git.git] / oidset.h
blob262f4256d6ac5ad39e1cef4a39e36716e817d651
1 #ifndef OIDSET_H
2 #define OIDSET_H
4 #include "khash.h"
6 /**
7 * This API is similar to oid-array, in that it maintains a set of object ids
8 * in a memory-efficient way. The major differences are:
10 * 1. It uses a hash, so we can do online duplicate removal, rather than
11 * sort-and-uniq at the end. This can reduce memory footprint if you have
12 * a large list of oids with many duplicates.
14 * 2. The per-unique-oid memory footprint is slightly higher due to hash
15 * table overhead.
18 /**
19 * A single oidset; should be zero-initialized (or use OIDSET_INIT).
21 struct oidset {
22 kh_oid_set_t set;
25 #define OIDSET_INIT { { 0 } }
28 /**
29 * Initialize the oidset structure `set`.
31 * If `initial_size` is bigger than 0 then preallocate to allow inserting
32 * the specified number of elements without further allocations.
34 void oidset_init(struct oidset *set, size_t initial_size);
36 /**
37 * Returns true iff `set` contains `oid`.
39 int oidset_contains(const struct oidset *set, const struct object_id *oid);
41 /**
42 * Insert the oid into the set; a copy is made, so "oid" does not need
43 * to persist after this function is called.
45 * Returns 1 if the oid was already in the set, 0 otherwise. This can be used
46 * to perform an efficient check-and-add.
48 int oidset_insert(struct oidset *set, const struct object_id *oid);
50 /**
51 * Insert all the oids that are in set 'src' into set 'dest'; a copy
52 * is made of each oid inserted into set 'dest'.
54 void oidset_insert_from_set(struct oidset *dest, struct oidset *src);
56 /**
57 * Remove the oid from the set.
59 * Returns 1 if the oid was present in the set, 0 otherwise.
61 int oidset_remove(struct oidset *set, const struct object_id *oid);
63 /**
64 * Returns the number of oids in the set.
66 static inline int oidset_size(const struct oidset *set)
68 return kh_size(&set->set);
71 /**
72 * Remove all entries from the oidset, freeing any resources associated with
73 * it.
75 void oidset_clear(struct oidset *set);
77 /**
78 * Add the contents of the file 'path' to an initialized oidset. Each line is
79 * an unabbreviated object name. Comments begin with '#', and trailing comments
80 * are allowed. Leading whitespace and empty or white-space only lines are
81 * ignored.
83 void oidset_parse_file(struct oidset *set, const char *path);
86 * Similar to the above, but with a callback which can (1) return non-zero to
87 * signal displeasure with the object and (2) replace object ID with something
88 * else (meant to be used to "peel").
90 typedef int (*oidset_parse_tweak_fn)(struct object_id *, void *);
91 void oidset_parse_file_carefully(struct oidset *set, const char *path,
92 oidset_parse_tweak_fn fn, void *cbdata);
94 struct oidset_iter {
95 kh_oid_set_t *set;
96 khiter_t iter;
99 static inline void oidset_iter_init(struct oidset *set,
100 struct oidset_iter *iter)
102 iter->set = &set->set;
103 iter->iter = kh_begin(iter->set);
106 static inline struct object_id *oidset_iter_next(struct oidset_iter *iter)
108 for (; iter->iter != kh_end(iter->set); iter->iter++) {
109 if (kh_exist(iter->set, iter->iter))
110 return &kh_key(iter->set, iter->iter++);
112 return NULL;
115 static inline struct object_id *oidset_iter_first(struct oidset *set,
116 struct oidset_iter *iter)
118 oidset_iter_init(set, iter);
119 return oidset_iter_next(iter);
122 #endif /* OIDSET_H */