168 if (node->
left == NULL && node->
right == NULL)
173 else if (node->
left == NULL)
178 else if (node->
right == NULL)
283 if (node->
left == NULL && node->
right == NULL)
296 *ladd = *radd = lladd + ndistance + rladd;
298 *ladd = *radd =
Max(lladd, rladd);
302 else if (node->
left == NULL)
309 *ladd = lladd + ndistance + rladd;
321 else if (node->
right == NULL)
329 *radd = lradd + ndistance + rradd;
407 (
errmsg(
"text-search query contains only stop words or doesn't contain lexemes, ignored")));
430 for (
i = 0;
i < out->
size;
i++)
438 operands[op->
length] =
'\0';
440 operands += op->
length + 1;
#define COMPUTESIZE(size)
static void PGresult * res
int errmsg(const char *fmt,...)
#define ereport(elevel,...)
Assert(fmt[strlen(fmt) - 1] !='\n')
void pfree(void *pointer)
void * repalloc(void *pointer, Size size)
void check_stack_depth(void)
#define SET_VARSIZE(PTR, len)
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)
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)