| From: | Bruce Momjian <bruce(at)momjian(dot)us> |
|---|---|
| To: | Tom Lane <tgl(at)sss(dot)pgh(dot)pa(dot)us> |
| Cc: | Rae Stiening <stiening(at)stiening(dot)com>, pgsql-bugs(at)postgresql(dot)org, Neil Conway <neilc(at)samurai(dot)com> |
| Subject: | Re: BUG #2467: Documentation |
| Date: | 2006-08-22 00:49:38 |
| Message-ID: | 200608220049.k7M0ncT10394@momjian.us |
| Views: | Whole Thread | Raw Message | Download mbox | Resend email |
| Thread: | |
| Lists: | pgsql-bugs |
Tom Lane wrote:
> "Rae Stiening" <stiening(at)stiening(dot)com> writes:
> > Description of the "width_bucket(...)"
>
> > "return the bucket to which operand would be assigned in an equidepth
> > histogram with count buckets, an upper bound of b1, and a lower bound of
> > b2"
>
> > I believe that the lower bound is b1 and upper b2.
>
> I agree that this is a typo, but looking at the spec and the function
> code, the description seems misleading altogether. Apparently b1 > b2
> is allowed and the computation is effectively negated then (the buckets
> are numbered in descending rather than ascending order). So ISTM that
> just switching "lower" and "upper" in the text doesn't really get us to
> the point of adequately documenting the function. But the description
> is already too long to fit comfortably in the table, so adding another
> sentence to cover the b1 > b2 case isn't attractive.
>
> Any ideas what to do? Would "starting bound" and "ending bound" work,
> or just confuse people more?
I generalized the documentation section for this function.
--
Bruce Momjian bruce(at)momjian(dot)us
EnterpriseDB http://www.enterprisedb.com
+ If your life is a hard drive, Christ can be your backup. +
| Attachment | Content-Type | Size |
|---|---|---|
| /bjm/diff | text/x-diff | 1.2 KB |
| From | Date | Subject | |
|---|---|---|---|
| Next Message | Bruce Momjian | 2006-08-22 01:02:23 | Re: reindexdb command utlility |
| Previous Message | Jim Nasby | 2006-08-21 21:55:28 | Re: referential integrity violation - key referenced from |