169 if (node->
left == NULL && node->
right == NULL)
174 else if (node->
left == NULL)
179 else if (node->
right == NULL)
284 if (node->
left == NULL && node->
right == NULL)
297 *ladd = *radd = lladd + ndistance + rladd;
299 *ladd = *radd =
Max(lladd, rladd);
303 else if (node->
left == NULL)
310 *ladd = lladd + ndistance + rladd;
322 else if (node->
right == NULL)
330 *radd = lradd + ndistance + rradd;
409 (
errmsg(
"text-search query contains only stop words or doesn't contain lexemes, ignored")));
432 for (
i = 0;
i < out->
size;
i++)
440 operands[op->
length] =
'\0';
442 operands += op->
length + 1;
#define COMPUTESIZE(size)
#define Assert(condition)
static void PGresult * res
int errmsg(const char *fmt,...)
#define ereport(elevel,...)
void pfree(void *pointer)
void * repalloc(void *pointer, Size size)
void check_stack_depth(void)
static pg_noinline void Size size
QueryItem * clean_NOT(QueryItem *ptr, int *len)
static void freetree(NODE *node)
static NODE * clean_stopword_intree(NODE *node, int *ladd, int *radd)
TSQuery cleanup_tsquery_stopwords(TSQuery in, bool noisy)
static NODE * clean_NOT_intree(NODE *node)
static void plainnode(PLAINTREE *state, NODE *node)
static NODE * maketree(QueryItem *in)
static QueryItem * plaintree(NODE *root, int *len)
static int32 calcstrlen(NODE *node)
#define SET_VARSIZE(PTR, len)