yeah, simple and correct, I like that. :-)
2007/6/9, Dann Corbit <[EMAIL PROTECTED]>:
> -Original Message-
[snip]
> Hum... I think there is a little improvement: when n is too large,(say
> n>10, 000) we can use Stirling's formula to get the estimated value of
> n!:-)
Or (rather) the
2007/6/9, Dann Corbit <[EMAIL PROTECTED]>:
#include
double log10nfactorialestimate(unsigned n)
{
unsignedi;
double estimate = 0;
for (i = 1; i < n; i++)
estimate += log10(n);
return estimate;
}
#ifdef UNIT_TEST
#include
#include
int
x27;s triangle in memory and demand load that memory
segment the first time someone asks for factorials or combinations or
permutations.
there may be too much memories to waste in that case... :-(
Regards
CUI Shijun
---(end of broadcast)---
TIP 4: Have
Thank you for your suggestions, I am thinking about "Full page writes
improvement". It seems not so complicated, just fit for a novice like
me.
I'll work on it. :-)
2007/5/17, Heikki Linnakangas <[EMAIL PROTECTED]>:
Cui Shijun wrote:
> I see...
> I checked part
"Group Commit" patch and try to review it, any suggestions?
2007/5/17, Bruce Momjian <[EMAIL PROTECTED]>:
Pavan Deolasee wrote:
> On 5/17/07, Cui Shijun <[EMAIL PROTECTED]> wrote:
> >
> > I want to help the reviewing work of "ctid chain following enhancemen
I want to help the reviewing work of "ctid chain following enhancement ".
I've been studying the souce code which related with that part recently.
:-)
2007/5/17, Dave Page <[EMAIL PROTECTED]>:
I think we just have to accept that we're gonna have a long feature
freeze period, and ask people to he
2007/4/28, Heikki Linnakangas <[EMAIL PROTECTED]>:
3. Lock that partition
6. Unlock partition
I suddenly realize that LW locks are used to manage the lock hash table.So
when a item is to be inserted into hash table, we must gain that partition
lock
first to change that table.
As the insertion
Ah... It seems that a item is calculated its hash value, get the bucket
number from it and insert into that bucket "chain". The insertion has
nothing to do with partition number(but Alvaro says "which hash is
used depends on the partition number". I haven't really understood
this: how can we get a
