| From: | Nikita Glukhov <n(dot)gluhov(at)postgrespro(dot)ru> |
|---|---|
| To: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us>, Pgsql Hackers <pgsql-hackers(at)postgresql(dot)org> |
| Cc: | Filip Rembiałkowski <filip(dot)rembialkowski(at)gmail(dot)com>, Tomas Vondra <tomas(dot)vondra(at)2ndquadrant(dot)com>, Alexander Korotkov <a(dot)korotkov(at)postgrespro(dot)ru>, Oleg Bartunov <obartunov(at)postgrespro(dot)ru>, Thomas Munro <thomas(dot)munro(at)gmail(dot)com>, Teodor Sigaev <teodor(at)sigaev(dot)ru> |
| Subject: | Re: fix for BUG #3720: wrong results at using ltree |
| Date: | 2020-03-30 22:47:05 |
| Message-ID: | 4c00219b-7094-e568-cc2c-6a52cf621701@postgrespro.ru |
| Views: | Raw Message | Whole Thread | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-hackers |
On 31.03.2020 1:35, Tom Lane wrote:
> Nikita Glukhov <n(dot)gluhov(at)postgrespro(dot)ru> writes:
>> And we even can simply transform this tail call into a loop:
>>
>> -if (tlen > 0 && qlen > 0)
>> +while (tlen > 0 && qlen > 0)
> Yeah, the same occurred to me ... and then we can drop the other loop too.
I think now it looks as simple as the whole algorithm is.
--
Nikita Glukhov
Postgres Professional: http://www.postgrespro.com
The Russian Postgres Company
| From | Date | Subject | |
|---|---|---|---|
| Next Message | James Coleman | 2020-03-30 22:53:47 | Re: [PATCH] Incremental sort (was: PoC: Partial sort) |
| Previous Message | Tom Lane | 2020-03-30 22:35:48 | Re: fix for BUG #3720: wrong results at using ltree |