31 while (
i < na &&
j < nb)
35 else if (da[
i] == db[
j])
65 while (
i < na &&
j < nb)
69 else if (da[
i] == db[
j])
108 while (
i < na &&
j < nb)
115 else if (da[
i] < db[
j])
159 while (
i < na &&
j < nb)
163 else if (da[
i] == db[
j])
165 if (k == 0 || dr[k - 1] != db[
j])
206 *((
bool *)
arg) =
true;
298 for (
i = 0;
i <
len;
i += 2)
300 if (!
i ||
a[
i] !=
a[
i - 1])
314 bool duplicates_found;
345 for (
i = 0;
i <
c;
i++)
#define ARR_OVERHEAD_NONULLS(ndims)
#define ARR_DATA_OFFSET(a)
ArrayType * construct_empty_array(Oid elmtype)
#define Assert(condition)
#define HASH(sign, val, siglen)
static int pg_cmp_s32(int32 a, int32 b)
void * repalloc(void *pointer, Size size)
void pfree(void *pointer)
void * palloc0(Size size)
void qsort_arg(void *base, size_t nel, size_t elsize, qsort_arg_comparator cmp, void *arg)
static size_t qunique_arg(void *array, size_t elements, size_t width, int(*compare)(const void *, const void *, void *), void *arg)
static pg_noinline void Size size
#define SET_VARSIZE(PTR, len)