30 while (i < na && j < nb)
34 else if (da[i] == db[j])
44 return (n == nb) ?
true :
false;
64 while (i < na && j < nb)
68 else if (da[i] == db[j])
107 while (i < na && j < nb)
114 else if (da[i] < db[j])
158 while (i < na && j < nb)
162 else if (da[i] == db[j])
164 if (k == 0 || dr[k - 1] != db[j])
205 *((
bool *) arg) =
true;
297 for (i = 0; i < len; i += 2)
299 if (!i || a[i] != a[i - 1])
300 size += (int64) (a[i + 1]) - (int64) (a[i]) + 1;
303 if (size > (int64) INT_MAX || size < (int64) INT_MIN)
313 bool duplicates_found;
327 for (i = 0; i < len; i++)
329 HASH(sign, *a, siglen);
344 for (i = 0; i <
c; i++)
401 return (*(
const int32 *) a > *(
const int32 *) b) ? 1 : -1;
409 return (*(
const int32 *) a < *(
const int32 *) b) ? 1 : -1;
#define ARR_OVERHEAD_NONULLS(ndims)
static size_t qunique_arg(void *array, size_t elements, size_t width, int(*compare)(const void *, const void *, void *), void *arg)
ArrayType * construct_empty_array(Oid elmtype)
#define ARR_DATA_OFFSET(a)
#define HASH(sign, val, siglen)
void pfree(void *pointer)
void qsort_arg(void *base, size_t nel, size_t elsize, qsort_arg_comparator cmp, void *arg)
void * palloc0(Size size)
#define Assert(condition)
void * repalloc(void *pointer, Size size)
#define SET_VARSIZE(PTR, len)