PostgreSQL Source Code: contrib/intarray/_int_tool.c Source File

PostgreSQL Source Code git master
_int_tool.c
Go to the documentation of this file.
1/*
2 * contrib/intarray/_int_tool.c
3 */
4#include "postgres.h"
5
6#include <limits.h>
7
8#include "_int.h"
9#include "catalog/pg_type.h"
10#include "common/int.h"
11#include "lib/qunique.h"
12
13/* arguments are assumed sorted & unique-ified */
14bool
15 inner_int_contains(ArrayType *a, ArrayType *b)
16{
17 int na,
18 nb;
19 int i,
20 j,
21 n;
22 int *da,
23 *db;
24
25 na = ARRNELEMS(a);
26 nb = ARRNELEMS(b);
27 da = ARRPTR(a);
28 db = ARRPTR(b);
29
30 i = j = n = 0;
31 while (i < na && j < nb)
32 {
33 if (da[i] < db[j])
34 i++;
35 else if (da[i] == db[j])
36 {
37 n++;
38 i++;
39 j++;
40 }
41 else
42 break; /* db[j] is not in da */
43 }
44
45 return (n == nb);
46}
47
48/* arguments are assumed sorted */
49bool
50 inner_int_overlap(ArrayType *a, ArrayType *b)
51{
52 int na,
53 nb;
54 int i,
55 j;
56 int *da,
57 *db;
58
59 na = ARRNELEMS(a);
60 nb = ARRNELEMS(b);
61 da = ARRPTR(a);
62 db = ARRPTR(b);
63
64 i = j = 0;
65 while (i < na && j < nb)
66 {
67 if (da[i] < db[j])
68 i++;
69 else if (da[i] == db[j])
70 return true;
71 else
72 j++;
73 }
74
75 return false;
76}
77
78ArrayType *
79 inner_int_union(ArrayType *a, ArrayType *b)
80{
81 ArrayType *r = NULL;
82
83 CHECKARRVALID(a);
84 CHECKARRVALID(b);
85
86 if (ARRISEMPTY(a) && ARRISEMPTY(b))
87 return new_intArrayType(0);
88 if (ARRISEMPTY(a))
89 r = copy_intArrayType(b);
90 if (ARRISEMPTY(b))
91 r = copy_intArrayType(a);
92
93 if (!r)
94 {
95 int na = ARRNELEMS(a),
96 nb = ARRNELEMS(b);
97 int *da = ARRPTR(a),
98 *db = ARRPTR(b);
99 int i,
100 j,
101 *dr;
102
103 r = new_intArrayType(na + nb);
104 dr = ARRPTR(r);
105
106 /* union */
107 i = j = 0;
108 while (i < na && j < nb)
109 {
110 if (da[i] == db[j])
111 {
112 *dr++ = da[i++];
113 j++;
114 }
115 else if (da[i] < db[j])
116 *dr++ = da[i++];
117 else
118 *dr++ = db[j++];
119 }
120
121 while (i < na)
122 *dr++ = da[i++];
123 while (j < nb)
124 *dr++ = db[j++];
125
126 r = resize_intArrayType(r, dr - ARRPTR(r));
127 }
128
129 if (ARRNELEMS(r) > 1)
130 r = _int_unique(r);
131
132 return r;
133}
134
135ArrayType *
136 inner_int_inter(ArrayType *a, ArrayType *b)
137{
138 ArrayType *r;
139 int na,
140 nb;
141 int *da,
142 *db,
143 *dr;
144 int i,
145 j,
146 k;
147
148 if (ARRISEMPTY(a) || ARRISEMPTY(b))
149 return new_intArrayType(0);
150
151 na = ARRNELEMS(a);
152 nb = ARRNELEMS(b);
153 da = ARRPTR(a);
154 db = ARRPTR(b);
155 r = new_intArrayType(Min(na, nb));
156 dr = ARRPTR(r);
157
158 i = j = k = 0;
159 while (i < na && j < nb)
160 {
161 if (da[i] < db[j])
162 i++;
163 else if (da[i] == db[j])
164 {
165 if (k == 0 || dr[k - 1] != db[j])
166 dr[k++] = db[j];
167 i++;
168 j++;
169 }
170 else
171 j++;
172 }
173
174 if (k == 0)
175 {
176 pfree(r);
177 return new_intArrayType(0);
178 }
179 else
180 return resize_intArrayType(r, k);
181}
182
183void
184 rt__int_size(ArrayType *a, float *size)
185{
186 *size = (float) ARRNELEMS(a);
187}
188
189/* comparison function for isort() and _int_unique() */
190static inline int
191 isort_cmp(const void *a, const void *b, void *arg)
192{
193 int32 aval = *((const int32 *) a);
194 int32 bval = *((const int32 *) b);
195
196 if (*((bool *) arg))
197 {
198 /* compare for ascending order */
199 if (aval < bval)
200 return -1;
201 if (aval > bval)
202 return 1;
203 }
204 else
205 {
206 if (aval > bval)
207 return -1;
208 if (aval < bval)
209 return 1;
210 }
211 return 0;
212}
213
214 #define ST_SORT isort
215 #define ST_ELEMENT_TYPE int32
216 #define ST_COMPARE(a, b, ascending) isort_cmp(a, b, ascending)
217 #define ST_COMPARE_ARG_TYPE void
218 #define ST_SCOPE
219 #define ST_DEFINE
220#include "lib/sort_template.h"
221
222/* Create a new int array with room for "num" elements */
223ArrayType *
224 new_intArrayType(int num)
225{
226 ArrayType *r;
227 int nbytes;
228
229 /* if no elements, return a zero-dimensional array */
230 if (num <= 0)
231 {
232 Assert(num == 0);
233 r = construct_empty_array(INT4OID);
234 return r;
235 }
236
237 nbytes = ARR_OVERHEAD_NONULLS(1) + sizeof(int) * num;
238
239 r = (ArrayType *) palloc0(nbytes);
240
241 SET_VARSIZE(r, nbytes);
242 ARR_NDIM(r) = 1;
243 r->dataoffset = 0; /* marker for no null bitmap */
244 ARR_ELEMTYPE(r) = INT4OID;
245 ARR_DIMS(r)[0] = num;
246 ARR_LBOUND(r)[0] = 1;
247
248 return r;
249}
250
251ArrayType *
252 resize_intArrayType(ArrayType *a, int num)
253{
254 int nbytes;
255 int i;
256
257 /* if no elements, return a zero-dimensional array */
258 if (num <= 0)
259 {
260 Assert(num == 0);
261 a = construct_empty_array(INT4OID);
262 return a;
263 }
264
265 if (num == ARRNELEMS(a))
266 return a;
267
268 nbytes = ARR_DATA_OFFSET(a) + sizeof(int) * num;
269
270 a = (ArrayType *) repalloc(a, nbytes);
271
272 SET_VARSIZE(a, nbytes);
273 /* usually the array should be 1-D already, but just in case ... */
274 for (i = 0; i < ARR_NDIM(a); i++)
275 {
276 ARR_DIMS(a)[i] = num;
277 num = 1;
278 }
279 return a;
280}
281
282ArrayType *
283 copy_intArrayType(ArrayType *a)
284{
285 ArrayType *r;
286 int n = ARRNELEMS(a);
287
288 r = new_intArrayType(n);
289 memcpy(ARRPTR(r), ARRPTR(a), n * sizeof(int32));
290 return r;
291}
292
293/* num for compressed key */
294int
295 internal_size(int *a, int len)
296{
297 int i;
298 int64 size = 0;
299
300 for (i = 0; i < len; i += 2)
301 {
302 if (!i || a[i] != a[i - 1]) /* do not count repeated range */
303 size += (int64) (a[i + 1]) - (int64) (a[i]) + 1;
304 }
305
306 if (size > (int64) INT_MAX || size < (int64) INT_MIN)
307 return -1; /* overflow */
308 return (int) size;
309}
310
311/* unique-ify elements of r in-place ... r must be sorted already */
312ArrayType *
313 _int_unique(ArrayType *r)
314{
315 int num = ARRNELEMS(r);
316 bool ascending = true;
317
318 num = qunique_arg(ARRPTR(r), num, sizeof(int), isort_cmp,
319 &ascending);
320
321 return resize_intArrayType(r, num);
322}
323
324void
325 gensign(BITVECP sign, int *a, int len, int siglen)
326{
327 int i;
328
329 /* we assume that the sign vector is previously zeroed */
330 for (i = 0; i < len; i++)
331 {
332 HASH(sign, *a, siglen);
333 a++;
334 }
335}
336
337int32
338 intarray_match_first(ArrayType *a, int32 elem)
339{
340 int32 *aa,
341 c,
342 i;
343
344 CHECKARRVALID(a);
345 c = ARRNELEMS(a);
346 aa = ARRPTR(a);
347 for (i = 0; i < c; i++)
348 if (aa[i] == elem)
349 return (i + 1);
350 return 0;
351}
352
353ArrayType *
354 intarray_add_elem(ArrayType *a, int32 elem)
355{
356 ArrayType *result;
357 int32 *r;
358 int32 c;
359
360 CHECKARRVALID(a);
361 c = ARRNELEMS(a);
362 result = new_intArrayType(c + 1);
363 r = ARRPTR(result);
364 if (c > 0)
365 memcpy(r, ARRPTR(a), c * sizeof(int32));
366 r[c] = elem;
367 return result;
368}
369
370ArrayType *
371 intarray_concat_arrays(ArrayType *a, ArrayType *b)
372{
373 ArrayType *result;
374 int32 ac = ARRNELEMS(a);
375 int32 bc = ARRNELEMS(b);
376
377 CHECKARRVALID(a);
378 CHECKARRVALID(b);
379 result = new_intArrayType(ac + bc);
380 if (ac)
381 memcpy(ARRPTR(result), ARRPTR(a), ac * sizeof(int32));
382 if (bc)
383 memcpy(ARRPTR(result) + ac, ARRPTR(b), bc * sizeof(int32));
384 return result;
385}
386
387ArrayType *
388 int_to_intset(int32 elem)
389{
390 ArrayType *result;
391 int32 *aa;
392
393 result = new_intArrayType(1);
394 aa = ARRPTR(result);
395 aa[0] = elem;
396 return result;
397}
#define CHECKARRVALID(x)
Definition: _int.h:30
#define ARRISEMPTY(x)
Definition: _int.h:38
bool inner_int_overlap(ArrayType *a, ArrayType *b)
Definition: _int_tool.c:50
ArrayType * int_to_intset(int32 elem)
Definition: _int_tool.c:388
ArrayType * intarray_concat_arrays(ArrayType *a, ArrayType *b)
Definition: _int_tool.c:371
ArrayType * new_intArrayType(int num)
Definition: _int_tool.c:224
ArrayType * inner_int_union(ArrayType *a, ArrayType *b)
Definition: _int_tool.c:79
bool inner_int_contains(ArrayType *a, ArrayType *b)
Definition: _int_tool.c:15
int32 intarray_match_first(ArrayType *a, int32 elem)
Definition: _int_tool.c:338
int internal_size(int *a, int len)
Definition: _int_tool.c:295
ArrayType * copy_intArrayType(ArrayType *a)
Definition: _int_tool.c:283
ArrayType * intarray_add_elem(ArrayType *a, int32 elem)
Definition: _int_tool.c:354
ArrayType * inner_int_inter(ArrayType *a, ArrayType *b)
Definition: _int_tool.c:136
void rt__int_size(ArrayType *a, float *size)
Definition: _int_tool.c:184
ArrayType * resize_intArrayType(ArrayType *a, int num)
Definition: _int_tool.c:252
static int isort_cmp(const void *a, const void *b, void *arg)
Definition: _int_tool.c:191
void gensign(BITVECP sign, int *a, int len, int siglen)
Definition: _int_tool.c:325
ArrayType * _int_unique(ArrayType *r)
Definition: _int_tool.c:313
#define ARR_NDIM(a)
Definition: array.h:290
#define ARR_ELEMTYPE(a)
Definition: array.h:292
#define ARR_OVERHEAD_NONULLS(ndims)
Definition: array.h:310
#define ARR_DATA_OFFSET(a)
Definition: array.h:316
#define ARR_DIMS(a)
Definition: array.h:294
#define ARR_LBOUND(a)
Definition: array.h:296
ArrayType * construct_empty_array(Oid elmtype)
Definition: arrayfuncs.c:3580
#define Min(x, y)
Definition: c.h:1003
int64_t int64
Definition: c.h:535
int32_t int32
Definition: c.h:534
#define ARRNELEMS(x)
Definition: cube.c:29
#define ARRPTR(x)
Definition: cube.c:28
Assert(PointerIsAligned(start, uint64))
char * BITVECP
Definition: hstore_gist.c:31
#define HASH(sign, val, siglen)
Definition: hstore_gist.c:46
char sign
Definition: informix.c:693
b
int b
Definition: isn.c:74
a
int a
Definition: isn.c:73
j
int j
Definition: isn.c:78
i
int i
Definition: isn.c:77
void * repalloc(void *pointer, Size size)
Definition: mcxt.c:1610
void pfree(void *pointer)
Definition: mcxt.c:1594
void * palloc0(Size size)
Definition: mcxt.c:1395
void * arg
const void size_t len
c
char * c
Definition: preproc-cursor.c:31
static size_t qunique_arg(void *array, size_t elements, size_t width, int(*compare)(const void *, const void *, void *), void *arg)
Definition: qunique.h:46
Definition: array.h:93
int32 dataoffset
Definition: array.h:96
static void SET_VARSIZE(void *PTR, Size len)
Definition: varatt.h:432

AltStyle によって変換されたページ (->オリジナル) /