Sujet : Good hash for pointers
De : malcolm.arthur.mclean (at) *nospam* gmail.com (Malcolm McLean)
Groupes : comp.lang.cDate : 23. May 2024, 12:11:19
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <v2n88p$1nlcc$1@dont-email.me>
User-Agent : Mozilla Thunderbird
What is a good hash function for pointers to use in portable ANSI C?
The pointers are nodes of a tree, which are read only, and I want to associate read/write data with them. So potentially a lage number of pointers,and they might be consecutively ordered if they are taken from an array, or they might be returned from repeared calls to malloc() with small allocations. Obviously I have no control over pointer size or internal representation.
-- Check out Basic Algorithms and my other books:https://www.lulu.com/spotlight/bgy1mm