| From: | Andres Freund <andres(at)2ndquadrant(dot)com> |
|---|---|
| To: | Abhijit Menon-Sen <ams(at)2ndQuadrant(dot)com> |
| Cc: | pgsql-hackers(at)postgresql(dot)org |
| Subject: | Re: [PATCH] binary heap implementation |
| Date: | 2012-11-14 13:25:55 |
| Message-ID: | 20121114132554.GA10917@awork2.anarazel.de |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
On 2012-11-14 18:41:12 +0530, Abhijit Menon-Sen wrote:
> There are two or three places in the Postgres source that implement heap
> sort (e.g. tuplesort.c, nodeMergeAppend.c), and it's also needed by the
> BDR code. It seemed reasonable to factor out the functionality.
This replaces the "simpleheap.[ch]" I had in the last submitted series.
> I've attached a patch (binaryheap.diff) that contains a straightforward
> implementation of a binary heap (originally written by Andres, with a
> few bugfixes and cleanups by me).
I want to emphasise that the only good thing about my submitted version
was that it actually compiled. So quite a bit of the work here is from
Abhijit...
Greetings,
Andres
--
Andres Freund http://www.2ndQuadrant.com/
PostgreSQL Development, 24x7 Support, Training & Services
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Tom Lane | 2012-11-14 14:25:59 | Re: S_ISLNK |
| Previous Message | Abhijit Menon-Sen | 2012-11-14 13:11:12 | [PATCH] binary heap implementation |