home *** CD-ROM | disk | FTP | other *** search
- Newsgroups: comp.programming
- Path: sparky!uunet!cs.utexas.edu!torn!cunews!nrcnet0!bnrgate!bcrka451!bcrki65!sjm
- From: sjm@bcrki65.bnr.ca (Stuart MacMartin)
- Subject: Re: Dynamic Hashing Algorithm needed
- Message-ID: <1992Sep8.173424.3377@bcrka451.bnr.ca>
- Sender: 5E00 Corkstown News Server
- Reply-To: sjm@bcrki65.bnr.ca (Stuart MacMartin)
- Organization: Bell-Northern Research, Ottawa, Canada
- References: <1992Sep8.172711.3195@bcrka451.bnr.ca> <dwagon.715675729@nella9.cc.monash.edu.au>
- Date: Tue, 8 Sep 1992 17:34:24 GMT
- Lines: 17
-
- In article <1992Sep8.172711.3195@bcrka451.bnr.ca>, sjm@bcrki65.bnr.ca
- (Stuart MacMartin) writes:
- > Note: The hash value is unconstrained; the hash table uses only n bits of it
- > in any overflow bucket. The full hash value of each key is held with
- > the key in the overflow bucket, so you might as well use it when scanning
- > overflow buckets for an exact match. This saves on expensive comparisons,
- > e.g. strcpy
- ^^^^^^
- strcmp. Sorry. No wonder my programs don't work first time.
- Anyone have a logic analyser that will detect this error? :-}
-
- >
- > Stuart
- >
- : Stuart MacMartin email: sjm@bnr.ca :
- : Bell-Northern Research phone: (613) 763-5625 :
- : PO Box 3511, Stn C, Ottawa, K1Y-4H7, CANADA Standard disclaimers apply. :
-