Merge branch 'po-id' of github.com:bagasme/git-po
[alt-git.git] / oid-array.c
blob73ba76e9e9a223306a03c3d04123c0c4af4aeda2
1 #include "cache.h"
2 #include "oid-array.h"
3 #include "hash-lookup.h"
5 void oid_array_append(struct oid_array *array, const struct object_id *oid)
7 ALLOC_GROW(array->oid, array->nr + 1, array->alloc);
8 oidcpy(&array->oid[array->nr++], oid);
9 array->sorted = 0;
12 static int void_hashcmp(const void *a, const void *b)
14 return oidcmp(a, b);
17 void oid_array_sort(struct oid_array *array)
19 if (array->sorted)
20 return;
21 QSORT(array->oid, array->nr, void_hashcmp);
22 array->sorted = 1;
25 static const struct object_id *oid_access(size_t index, const void *table)
27 const struct object_id *array = table;
28 return &array[index];
31 int oid_array_lookup(struct oid_array *array, const struct object_id *oid)
33 oid_array_sort(array);
34 return oid_pos(oid, array->oid, array->nr, oid_access);
37 void oid_array_clear(struct oid_array *array)
39 FREE_AND_NULL(array->oid);
40 array->nr = 0;
41 array->alloc = 0;
42 array->sorted = 0;
46 int oid_array_for_each(struct oid_array *array,
47 for_each_oid_fn fn,
48 void *data)
50 size_t i;
52 /* No oid_array_sort() here! See oid-array.h */
54 for (i = 0; i < array->nr; i++) {
55 int ret = fn(array->oid + i, data);
56 if (ret)
57 return ret;
59 return 0;
62 int oid_array_for_each_unique(struct oid_array *array,
63 for_each_oid_fn fn,
64 void *data)
66 size_t i;
68 oid_array_sort(array);
70 for (i = 0; i < array->nr; i = oid_array_next_unique(array, i)) {
71 int ret = fn(array->oid + i, data);
72 if (ret)
73 return ret;
75 return 0;
78 void oid_array_filter(struct oid_array *array,
79 for_each_oid_fn want,
80 void *cb_data)
82 size_t nr = array->nr, src, dst;
83 struct object_id *oids = array->oid;
85 for (src = dst = 0; src < nr; src++) {
86 if (want(&oids[src], cb_data)) {
87 if (src != dst)
88 oidcpy(&oids[dst], &oids[src]);
89 dst++;
92 array->nr = dst;