7 Commits (2755abf386e6572bad15cb6a032e504ad32308cc)

Author	SHA1	Message	Date
Peter Eisentraut	9cfd800aab	Add some enumeration commas, for consistency	14 years ago
Tom Lane	331bf6712c	Throw error sooner for unlogged GiST indexes. ... Throwing an error only after we've built the main index fork is pretty unfriendly when the table already contains data. Per gripe from Jay Levitt.	14 years ago
Bruce Momjian	e126958c2e	Update copyright notices for year 2012.	14 years ago
Tom Lane	d22a09dc70	Support GiST index support functions that want to cache data across calls. ... pg_trgm was already doing this unofficially, but the implementation hadn't been thought through very well and leaked memory. Restructure the core GiST code so that it actually works, and document it. Ordinarily this would have required an extra memory context creation/destruction for each GiST index search, but I was able to avoid that in the normal case of a non-rescanned search by finessing the handling of the RBTree. It used to have its own context always, but now shares a context with the scan-lifespan data structures, unless there is more than one rescan call. This should make the added overhead unnoticeable in typical cases.	14 years ago
Heikki Linnakangas	8caf6132c7	In the final emptying phase of the new GiST buffering build, set the ... queuedForEmptying flag correctly on buffer when adding it to the queue. Also, don't add buffer to the queue if it's there already. These were harmless oversights; failing to set the flag just means that a buffer might get added to the queue twice if more tuples are added to it (although that can't actually happen at this point because all the upper buffers have already been emptied), and having the same buffer twice in the emptying queue is harmless. But better be tidy.	14 years ago
Tom Lane	d63de337f3	round() is not portable. Use rint().	14 years ago
Heikki Linnakangas	5edb24a898	Buffering GiST index build algorithm. ... When building a GiST index that doesn't fit in cache, buffers are attached to some internal nodes in the index. This speeds up the build by avoiding random I/O that would otherwise be needed to traverse all the way down the tree to the find right leaf page for tuple. Alexander Korotkov	14 years ago