Re: B-Tree support function number 3 (strxfrm() optimization)
| От | Peter Geoghegan |
|---|---|
| Тема | Re: B-Tree support function number 3 (strxfrm() optimization) |
| Дата | |
| Msg-id | CAM3SWZQWLeQR9AkTJ+ndv6zxwF1p+r3KNoZ_sr1HvAJYuzC7vA@mail.gmail.com обсуждение исходный текст |
| Ответ на | Re: B-Tree support function number 3 (strxfrm() optimization) (Robert Haas <robertmhaas@gmail.com>) |
| Ответы |
Re: B-Tree support function number 3 (strxfrm() optimization)
|
| Список | pgsql-hackers |
On Mon, Sep 15, 2014 at 10:53 AM, Robert Haas <robertmhaas@gmail.com> wrote: > I think there's probably more than that to work out, but in any case > there's no harm in getting a simple optimization done first before > moving on to a complicated one. I guess we never talked about the abort logic in all that much detail. I suppose there's that, too. > I rather assume we could reuse the results of the first memcmp() > instead of doing it again. > > x = memcmp(); > if (x == 0) > return x; > y = strcoll(); > if (y == 0) > return x; > return y; Of course, but you know what I mean. (I'm sure the compiler will realize this if the programmer doesn't) -- Peter Geoghegan
В списке pgsql-hackers по дате отправления: