Tom Lane wrote:
> The data structure I'd suggest is a simple array of pointers
> to the underlying hash table entries. Since you have a predetermined
> maximum number of lexemes to track, you can just palloc the array once
> --- you don't need the expansibility properties of a list.
The number of lexemes isn't predetermined. It's 2 * (longest tsvector
seen so far), and we don't know beforehand how long the longest tsvector is.
repalloc()ing shouldn't be a problem, though.
-- Heikki Linnakangas EnterpriseDB http://www.enterprisedb.com
