Robert Haas 4da99ea423 Avoid having two copies of the HOT-chain search logic. ... It's been like this since HOT was originally introduced, but the logic is complex enough that this is a recipe for bugs, as we've already found out with SSI. So refactor heap_hot_search_buffer() so that it can satisfy the needs of index_getnext(), and make index_getnext() use that rather than duplicating the logic. This change was originally proposed by Heikki Linnakangas as part of a larger refactoring oriented towards allowing index-only scans. I extracted and adjusted this part, since it seems to have independent merit. Review by Jeff Davis.		2011-06-27 10:27:17 -04:00
..
common	Make a code-cleanup pass over the collations patch.	2011-04-22 17:43:18 -04:00
gin	Pgindent run before 9.1 beta2.	2011-06-09 14:32:50 -04:00
gist	Message style and spelling improvements	2011-06-22 00:45:34 +03:00
hash	Hash indexes had better pass the index collation to support functions, too.	2011-04-23 14:13:09 -04:00
heap	Avoid having two copies of the HOT-chain search logic.	2011-06-27 10:27:17 -04:00
index	Avoid having two copies of the HOT-chain search logic.	2011-06-27 10:27:17 -04:00
nbtree	pgindent run of recent SSI changes. Also, remove an unnecessary #include.	2011-06-16 16:17:22 +03:00
transam	Make the visibility map crash-safe.	2011-06-21 23:04:40 -04:00
Makefile	Remove cvs keywords from all files.	2010-09-20 22:08:53 +02:00