On Tue, 2 Jun 2020 at 03:13, David Rowley wrote:
>
>
> It does seem likely to me that hash tables would be a more efficient
> structure, but the gains might not be as big as you think. To perform
> a lookup in the table we need to hash the entire node to get the hash
> value, then perform at leas
Hi David,
On Fri, May 29, 2020 at 2:16 PM David Rowley wrote:
> In [1] I mentioned that I'd like to look into coding a data structure
> to allow Node types to be looked up more efficiently than what List
> allows. There are many places in the planner where we must determine
> if a given Node is
On Sat, 30 May 2020 at 01:52, Ashutosh Bapat
wrote:
>
> On Fri, May 29, 2020 at 10:47 AM David Rowley wrote:
> > In [1] I mentioned that I'd like to look into coding a data structure
> > to allow Node types to be looked up more efficiently than what List
> > allows. There are many places in the
On Fri, May 29, 2020 at 10:47 AM David Rowley wrote:
>
> Hi,
>
> In [1] I mentioned that I'd like to look into coding a data structure
> to allow Node types to be looked up more efficiently than what List
> allows. There are many places in the planner where we must determine
> if a given Node is
