Re: Making all nbtree entries unique by having heap TIDs participatein comparisons

Поиск
Список
Период
Сортировка
От Heikki Linnakangas
Тема Re: Making all nbtree entries unique by having heap TIDs participatein comparisons
Дата
Msg-id 23365711-a7a8-ed4c-892a-40effb5370ca@iki.fi
обсуждение исходный текст
Ответ на Re: Making all nbtree entries unique by having heap TIDs participatein comparisons  (Peter Geoghegan <pg@bowt.ie>)
Ответы Re: Making all nbtree entries unique by having heap TIDs participatein comparisons
Список pgsql-hackers
On 16/03/2019 19:32, Peter Geoghegan wrote:
> On Sat, Mar 16, 2019 at 9:55 AM Peter Geoghegan <pg@bowt.ie> wrote:
>> On Sat, Mar 16, 2019 at 9:17 AM Heikki Linnakangas <hlinnaka@iki.fi> wrote:
>>> Hmm. "re-find", maybe? We use that term in a few error messages already,
>>> to mean something similar.
>>
>> WFM.
> 
> Actually, how about "rootsearch", or "rootdescend"? You're supposed to
> hyphenate "re-find", and so it doesn't really work as a function
> argument name.

Works for me.

- Heikki


В списке pgsql-hackers по дате отправления:

Предыдущее
От: Tom Lane
Дата:
Сообщение: Re: pgsql: Add support for hyperbolic functions, as well as log10().
Следующее
От: Ryan Lambert
Дата:
Сообщение: Fix XML handling with DOCTYPE