Re: Add red-black tree missing comparison searches - Mailing list pgsql-hackers

From Alexander Korotkov
Subject Re: Add red-black tree missing comparison searches
Date
Msg-id CAPpHfdukKZFehZX8sGJCEzPxNdvDu7GQ8SFZV1zi0hLrhT8HaA@mail.gmail.com
Whole thread Raw
In response to Re: Add red-black tree missing comparison searches  (Alexander Korotkov <aekorotkov@gmail.com>)
List pgsql-hackers
On Thu, Jul 7, 2022 at 1:43 PM Alexander Korotkov <aekorotkov@gmail.com> wrote:
> On Thu, Jul 7, 2022 at 2:16 AM Steve Chavez <steve@supabase.io> wrote:
> > Thanks Alexander!
> >
> > wrt to the new patch. I think the following comment is misleading since keyDeleted can be true or false:
> >
> > + /* switch equal_match to false so we only find greater matches now */
> > + node = (IntRBTreeNode *) rbt_find_great(tree, (RBTNode *) &searchNode,
> > + keyDeleted);
> >
> > Maybe it should be the same used for searching lesser keys:
> >
> > + /*
> > + * Find the next key.  If the current key is deleted, we can pass
> > + * equal_match == true and still find the next one.
> > + */
>
> Thank you for catching this.
> The revised version of patch is attached!

Pushed!

------
Regards,
Alexander Korotkov



pgsql-hackers by date:

Previous
From: Ibrar Ahmed
Date:
Subject: Re: Aggregate leads to superfluous projection from the scan
Next
From: Tom Lane
Date:
Subject: Re: Aggregate leads to superfluous projection from the scan