Re: Hash tables
From: Russell Shaw (rjshawN_o_at_s_pam.netspace.net.au)
Date: 03/30/05
- Next message: Måns Rullgård: "Re: Hash tables"
- Previous message: Panama Red: "Re: Multitasking Named pipes."
- In reply to: Måns Rullgård: "Re: Hash tables"
- Next in thread: Måns Rullgård: "Re: Hash tables"
- Reply: Måns Rullgård: "Re: Hash tables"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]
Date: Wed, 30 Mar 2005 13:09:13 +1000
Måns Rullgård wrote:
> Fletcher Glenn <fletcher@removethisfoglight.com> writes:
>
>
>>Russell Shaw wrote:
>>
>>>Hi, I made a hash table that usually holds less than 1000 entries,
>>>and the keys are text strings of 5-10 characters. Would a decent
>>>hash function be to just generate a 10 bit remainder by feeding the
>>>text into a 10 bit shift register which does a crc long division on
>>>it, then using that to index a 1024 entry array? (i'll use a
>>>maximal length generator polynomial)
>>
>>Have you tried looking at the man page for hcreate(3c)?
>
>
> Don't look there. Those functions are too bizarre to be used for
> anything, and are not even portable. You're much better off writing
> your own hash tables, or using somebody else's.
The man page on my debian sid says they have a hard size limit.
> Personally, I
> recommend my own (http://libtc.sf.net).
Interesting.
- Next message: Måns Rullgård: "Re: Hash tables"
- Previous message: Panama Red: "Re: Multitasking Named pipes."
- In reply to: Måns Rullgård: "Re: Hash tables"
- Next in thread: Måns Rullgård: "Re: Hash tables"
- Reply: Måns Rullgård: "Re: Hash tables"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]