1 /*-------------------------------------------------------------------------
4 * Various operations with tsquery
6 * Portions Copyright (c) 1996-2017, PostgreSQL Global Development Group
10 * src/backend/utils/adt/tsquery_op.c
12 *-------------------------------------------------------------------------
17 #include "tsearch/ts_utils.h"
18 #include "utils/builtins.h"
21 tsquery_numnode(PG_FUNCTION_ARGS)
23 TSQuery query = PG_GETARG_TSQUERY(0);
24 int nnode = query->size;
26 PG_FREE_IF_COPY(query, 0);
27 PG_RETURN_INT32(nnode);
31 join_tsqueries(TSQuery a, TSQuery b, int8 operator, uint16 distance)
33 QTNode *res = (QTNode *) palloc0(sizeof(QTNode));
35 res->flags |= QTN_NEEDFREE;
37 res->valnode = (QueryItem *) palloc0(sizeof(QueryItem));
38 res->valnode->type = QI_OPR;
39 res->valnode->qoperator.oper = operator;
40 if (operator == OP_PHRASE)
41 res->valnode->qoperator.distance = distance;
43 res->child = (QTNode **) palloc0(sizeof(QTNode *) * 2);
44 res->child[0] = QT2QTN(GETQUERY(b), GETOPERAND(b));
45 res->child[1] = QT2QTN(GETQUERY(a), GETOPERAND(a));
52 tsquery_and(PG_FUNCTION_ARGS)
54 TSQuery a = PG_GETARG_TSQUERY_COPY(0);
55 TSQuery b = PG_GETARG_TSQUERY_COPY(1);
61 PG_FREE_IF_COPY(a, 1);
64 else if (b->size == 0)
66 PG_FREE_IF_COPY(b, 1);
70 res = join_tsqueries(a, b, OP_AND, 0);
75 PG_FREE_IF_COPY(a, 0);
76 PG_FREE_IF_COPY(b, 1);
78 PG_RETURN_TSQUERY(query);
82 tsquery_or(PG_FUNCTION_ARGS)
84 TSQuery a = PG_GETARG_TSQUERY_COPY(0);
85 TSQuery b = PG_GETARG_TSQUERY_COPY(1);
91 PG_FREE_IF_COPY(a, 1);
94 else if (b->size == 0)
96 PG_FREE_IF_COPY(b, 1);
100 res = join_tsqueries(a, b, OP_OR, 0);
105 PG_FREE_IF_COPY(a, 0);
106 PG_FREE_IF_COPY(b, 1);
108 PG_RETURN_TSQUERY(query);
112 tsquery_phrase_distance(PG_FUNCTION_ARGS)
114 TSQuery a = PG_GETARG_TSQUERY_COPY(0);
115 TSQuery b = PG_GETARG_TSQUERY_COPY(1);
118 int32 distance = PG_GETARG_INT32(2);
120 if (distance < 0 || distance > MAXENTRYPOS)
122 (errcode(ERRCODE_INVALID_PARAMETER_VALUE),
123 errmsg("distance in phrase operator should be non-negative and less than %d",
127 PG_FREE_IF_COPY(a, 1);
128 PG_RETURN_POINTER(b);
130 else if (b->size == 0)
132 PG_FREE_IF_COPY(b, 1);
133 PG_RETURN_POINTER(a);
136 res = join_tsqueries(a, b, OP_PHRASE, (uint16) distance);
141 PG_FREE_IF_COPY(a, 0);
142 PG_FREE_IF_COPY(b, 1);
144 PG_RETURN_TSQUERY(query);
148 tsquery_phrase(PG_FUNCTION_ARGS)
150 PG_RETURN_POINTER(DirectFunctionCall3(
151 tsquery_phrase_distance,
158 tsquery_not(PG_FUNCTION_ARGS)
160 TSQuery a = PG_GETARG_TSQUERY_COPY(0);
165 PG_RETURN_POINTER(a);
167 res = (QTNode *) palloc0(sizeof(QTNode));
169 res->flags |= QTN_NEEDFREE;
171 res->valnode = (QueryItem *) palloc0(sizeof(QueryItem));
172 res->valnode->type = QI_OPR;
173 res->valnode->qoperator.oper = OP_NOT;
175 res->child = (QTNode **) palloc0(sizeof(QTNode *));
176 res->child[0] = QT2QTN(GETQUERY(a), GETOPERAND(a));
182 PG_FREE_IF_COPY(a, 0);
184 PG_RETURN_POINTER(query);
188 CompareTSQ(TSQuery a, TSQuery b)
190 if (a->size != b->size)
192 return (a->size < b->size) ? -1 : 1;
194 else if (VARSIZE(a) != VARSIZE(b))
196 return (VARSIZE(a) < VARSIZE(b)) ? -1 : 1;
198 else if (a->size != 0)
200 QTNode *an = QT2QTN(GETQUERY(a), GETOPERAND(a));
201 QTNode *bn = QT2QTN(GETQUERY(b), GETOPERAND(b));
202 int res = QTNodeCompare(an, bn);
214 tsquery_cmp(PG_FUNCTION_ARGS)
216 TSQuery a = PG_GETARG_TSQUERY_COPY(0);
217 TSQuery b = PG_GETARG_TSQUERY_COPY(1);
218 int res = CompareTSQ(a, b);
220 PG_FREE_IF_COPY(a, 0);
221 PG_FREE_IF_COPY(b, 1);
223 PG_RETURN_INT32(res);
226 #define CMPFUNC( NAME, CONDITION ) \
228 NAME(PG_FUNCTION_ARGS) { \
229 TSQuery a = PG_GETARG_TSQUERY_COPY(0); \
230 TSQuery b = PG_GETARG_TSQUERY_COPY(1); \
231 int res = CompareTSQ(a,b); \
233 PG_FREE_IF_COPY(a,0); \
234 PG_FREE_IF_COPY(b,1); \
236 PG_RETURN_BOOL( CONDITION ); \
238 /* keep compiler quiet - no extra ; */ \
239 extern int no_such_variable
241 CMPFUNC(tsquery_lt, res < 0);
242 CMPFUNC(tsquery_le, res <= 0);
243 CMPFUNC(tsquery_eq, res == 0);
244 CMPFUNC(tsquery_ge, res >= 0);
245 CMPFUNC(tsquery_gt, res > 0);
246 CMPFUNC(tsquery_ne, res != 0);
249 makeTSQuerySign(TSQuery a)
252 QueryItem *ptr = GETQUERY(a);
253 TSQuerySign sign = 0;
255 for (i = 0; i < a->size; i++)
257 if (ptr->type == QI_VAL)
258 sign |= ((TSQuerySign) 1) << (((unsigned int) ptr->qoperand.valcrc) % TSQS_SIGLEN);
266 collectTSQueryValues(TSQuery a, int *nvalues_p)
268 QueryItem *ptr = GETQUERY(a);
269 char *operand = GETOPERAND(a);
274 values = (char **) palloc(sizeof(char *) * a->size);
276 for (i = 0; i < a->size; i++)
278 if (ptr->type == QI_VAL)
280 int len = ptr->qoperand.length;
283 val = palloc(len + 1);
284 memcpy(val, operand + ptr->qoperand.distance, len);
287 values[nvalues++] = val;
292 *nvalues_p = nvalues;
297 cmp_string(const void *a, const void *b)
299 const char *sa = *((const char **) a);
300 const char *sb = *((const char **) b);
302 return strcmp(sa, sb);
306 remove_duplicates(char **strings, int n)
313 char *prev = strings[0];
316 for (i = 1; i < n; i++)
318 if (strcmp(strings[i], prev) != 0)
320 strings[new_n++] = strings[i];
329 tsq_mcontains(PG_FUNCTION_ARGS)
331 TSQuery query = PG_GETARG_TSQUERY(0);
332 TSQuery ex = PG_GETARG_TSQUERY(1);
339 /* Extract the query terms into arrays */
340 query_values = collectTSQueryValues(query, &query_nvalues);
341 ex_values = collectTSQueryValues(ex, &ex_nvalues);
343 /* Sort and remove duplicates from both arrays */
344 qsort(query_values, query_nvalues, sizeof(char *), cmp_string);
345 query_nvalues = remove_duplicates(query_values, query_nvalues);
346 qsort(ex_values, ex_nvalues, sizeof(char *), cmp_string);
347 ex_nvalues = remove_duplicates(ex_values, ex_nvalues);
349 if (ex_nvalues > query_nvalues)
356 for (i = 0; i < ex_nvalues; i++)
358 for (; j < query_nvalues; j++)
360 if (strcmp(ex_values[i], query_values[j]) == 0)
363 if (j == query_nvalues)
371 PG_RETURN_BOOL(result);
375 tsq_mcontained(PG_FUNCTION_ARGS)