><br>> Hi list,<br>><br>> I just stumbled upon this:<br>><br>> Object new hash 3698<br>> OrderedCollection new hash 183475190<br>><br>> Hashes for collections seems to be much bigger than other hashes. Is
<br>> there a reason for that?<br>><br>> Cheers,<br>> Romain<br>><br><br>In my application this causes major problems.<br>In the case of class Character I created two arrays on the<br>class side of Character. The first array stored
<br>30 bit hash values, one or for each character.<br>The second array stores the the Xor of the first<br>k character hash values in position k. This allows<br>me to compute a hash value for a range of characters<br>quickly.
<br>Using these arrays to determine hash values for characters<br>solved my hash value problems, as least for <br>Character class objects.<br><br>Ralph<br>