From: | Denis Perchine <dyp(at)perchine(dot)com> |
---|---|
To: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
Cc: | pgsql-patches(at)postgresql(dot)org |
Subject: | Re: Small fix for inv_getsize |
Date: | 2000-11-02 17:35:20 |
Message-ID: | 0011022335200G.31936@dyp.perchine.com |
Views: | Raw Message | Whole Thread | Download mbox | Resend email |
Thread: | |
Lists: | pgsql-patches |
> >> Now that I think about it, this code could do a two-key scan backwards
> >> and stop after finding the first (last) valid tuple, but that's more
> >> than a one-line change.
> >
> > Actual logic is to find the maximum of pageno, for specified oid.
> > I do index scan on 2-keys index, specifying only one key as constraint...
> > If I do index scan forward I will get the smallest pageno first...
> > Otherwise I get the highest pageno... And this is what I want...
>
> Hmm ... probably right, but the loop logic doesn't behave that way
> right now.
Why not... Did not I explained what happend there? obj_desc->index_r is 2 key
index... I do index scan backward. Get first valid tuple... What I miss...
Can you please give me the correct one... I am totally confused... Sorry for
asking this...
--
Sincerely Yours,
Denis Perchine
----------------------------------
E-Mail: dyp(at)perchine(dot)com
HomePage: http://www.perchine.com/dyp/
FidoNet: 2:5000/120.5
----------------------------------
From | Date | Subject | |
---|---|---|---|
Next Message | Tom Lane | 2000-11-02 17:53:23 | Re: Small fix for inv_getsize |
Previous Message | Tom Lane | 2000-11-02 17:32:38 | Re: Small fix for inv_getsize |