6 Commits

Author	SHA1	Message	Date
Bruce Momjian	ee94300446	Update copyright for 2016 ... Backpatch certain files through 9.1	2016-01-02 13:33:40 -05:00
Heikki Linnakangas	f92d6a540a	Use appendStringInfoString/Char et al where appropriate. ... Patch by David Rowley. Backpatch to 9.5, as some of the calls were new in 9.5, and keeping the code in sync with master makes future backpatching easier.	2015-07-02 12:36:03 +03:00
Bruce Momjian	807b9e0dff	pgindent run for 9.5	2015-05-23 21:35:49 -04:00
Heikki Linnakangas	931bf3eb9b	Fix a bug in pairing heap removal code. ... After removal, the next_sibling pointer of a node was sometimes incorrectly left to point to another node in the heap, which meant that a node was sometimes linked twice into the heap. Surprisingly that didn't cause any crashes in my testing, but it was clearly wrong and could easily segfault in other scenarios. Also always keep the prev_or_parent pointer as NULL on the root node. That was not a correctness issue AFAICS, but let's be tidy. Add a debugging function, to dump the contents of a pairing heap as a string. It's #ifdef'd out, as it's not used for anything in any normal code, but it was highly useful in debugging this. Let's keep it handy for further reference.	2015-02-17 22:55:53 +02:00
Bruce Momjian	4baaf863ec	Update copyright for 2015 ... Backpatch certain files through 9.0	2015-01-06 11:43:47 -05:00
Heikki Linnakangas	e7032610f7	Use a pairing heap for the priority queue in kNN-GiST searches. ... This performs slightly better, uses less memory, and needs slightly less code in GiST, than the Red-Black tree previously used. Reviewed by Peter Geoghegan	2014-12-22 12:05:57 +02:00