I know in advance the structure of a whole tsquery, it has already
been reduced and lexemes have been already computed.
I'd like to directly write it in memory without having to pass
Anyway I'm not pretty sure about what is the layout of a tsquery in
memory and I still haven't been able to find the MACRO that could
help me .
Before doing it the trial and error way can somebody just make me an
I'm not pretty sure about my interpretation of the comments of the
This is how I'd write
X:AB | YY:C | ZZZ:D
vl_len_ (total # of bytes of the whole following structure
QueryItems*size + total lexeme length)
size (# of QueryItems in the query)
left -> distance from QueryItem X:AB
left -> distance from QueryItem ZZZ:D
 the equivalent of POSTDATALEN, WEP_GETWEIGHT, macro to compute
the size of various parts of TSQuery etc...
I couldn't see any place in the code where TSQuery is built in "one
shot" in spite of using pushValue.
Another thing I'd like to know is: what is going to be preferred
during a scan between
'java:1A,2B '::tsvector @@ to_tsquery('java:A | java:B');
'java:1A,2B '::tsvector @@ to_tsquery('java:AB')
they look equivalent. Are they?
Ivan Sergio Borgonovo
pgsql-hackers by date
|Next:||From: Alvaro Herrera||Date: 2010-02-04 18:27:44|
|Subject: Re: Largeobject Access Controls (r2460)|
|Previous:||From: Josh Berkus||Date: 2010-02-04 18:22:23|
|Subject: Re: testing cvs HEAD - HS/SR - cannot stat|