On Tue, Jan 28, 2014 at 10:54 PM, Heikki Linnakangas <hlinnakan...@vmware.com> wrote: > 1. This patch introduces a new "polygon <-> point" operator. That seems > useful on its own, with or without this patch. This patch is tracked with this entry in the commit fest app and is marked as "Ready for committer". Hence I am moving this specific part to 2014-12 to keep track of it:
> 3. A binary heap would be a better data structure to buffer the rechecked > values. A Red-Black tree allows random insertions and deletions, but in this > case you need to insert arbitrary values but only remove the minimum item. > That's exactly what a binary heap excels at. We have a nice binary heap > implementation in the backend that you can use, see > src/backend/lib/binaryheap.c. Based on those comments, I am marking this entry as returned with feedback: https://commitfest.postgresql.org/action/patch_view?id=1367 Heikki has sent as well a new patch to use a binary heap method instead of the red-black tree here: http://www.postgresql.org/message-id/54886bb8.9040...@vmware.com IMO this last patch should be added in the CF app, that's not the case now. Regards, -- Michael -- Sent via pgsql-hackers mailing list (pgsql-hackers@postgresql.org) To make changes to your subscription: http://www.postgresql.org/mailpref/pgsql-hackers
