Re: [HACKERS] Red-Black tree traversal tests

Поиск
Список
Период
Сортировка
От Tom Lane
Тема Re: [HACKERS] Red-Black tree traversal tests
Дата
Msg-id 16674.1505064742@sss.pgh.pa.us
обсуждение исходный текст
Ответ на Re: [HACKERS] Red-Black tree traversal tests  (Tom Lane <tgl@sss.pgh.pa.us>)
Список pgsql-hackers
I wrote:
> In the meantime, here's my version.  Notable changes:

I went ahead and pushed this, with the removal of the preorder/postorder
code, so we can see if the buildfarm finds out anything interesting.
Feel free to continue to submit improvements though.

One thing that occurred to me is that as-is, this is entirely black-box
testing.  It doesn't try to check that the tree actually satisfies the
RB invariants, which is something that is interesting for performance
reasons.  (That is, the code could pass these tests even though it
produces an unbalanced tree with horrible performance.)  Is it worth
adding logic for that?  Not sure.  It's not like we are actively
changing the RB code or have reason to think it is buggy.
        regards, tom lane


-- 
Sent via pgsql-hackers mailing list (pgsql-hackers@postgresql.org)
To make changes to your subscription:
http://www.postgresql.org/mailpref/pgsql-hackers

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

Предыдущее
От: Beena Emerson
Дата:
Сообщение: Re: [HACKERS] increasing the default WAL segment size
Следующее
От: Tom Lane
Дата:
Сообщение: [HACKERS] relation mapping file checksum failure