| From: | Petr Jelinek <petr(at)2ndquadrant(dot)com> |
|---|---|
| To: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
| Cc: | Pavel Stehule <pavel(dot)stehule(at)gmail(dot)com>, Simon Riggs <simon(at)2ndquadrant(dot)com>, PostgreSQL-development <pgsql-hackers(at)postgresql(dot)org> |
| Subject: | Re: Built-in binning functions |
| Date: | 2014-09-01 19:29:41 |
| Message-ID: | 5404C925.70803@2ndquadrant.com |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
On 01/09/14 01:42, Tom Lane wrote:
>
> BTW, was there a reason for not noticing the case of exact match in
> the search loop, and falling out early? As it stands the code will
> reliably choose the leftmost match if there are multiple equal items
> in the search array, but do we care about such cases?
>
I am not sure if we care, probably not.
Anyway I attached patch that I am happy with. I am not yet sure what to
do with naming.
--
Petr Jelinek http://www.2ndQuadrant.com/
PostgreSQL Development, 24x7 Support, Training & Services
| Attachment | Content-Type | Size |
|---|---|---|
| binning-fns-v5.patch | text/x-diff | 15.0 KB |
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Joel Jacobson | 2014-09-01 19:35:59 | Re: PL/pgSQL 2 |
| Previous Message | Pavel Stehule | 2014-09-01 19:08:28 | Re: PL/pgSQL 2 |