[KoczkaHUN]

Quote:

Edit: I'm kicking only if the text repeats ~30 times, so the collisions don't really matter. Maybe this would do: pawn Код: stock small_hash(buf[]) {     new int,len=strlen(buf);     for(new i=0;i<len;i++) int+=buf[i];     return int; }

I tought about the same a few weeks ago, and the checks showed that strcmp is extremely powerful against this hash. (tested with 4,000,000 cells though :Đ)

Edit: if you'd use this hash, speedup:

pawn Код:

stock small_hash(buf[])
{
    new i = -1, int = 0;
    while (buf[++i] != 0) int += buf[i];
    return int;
}

as strlen loops through the whole string, which is already done by us.