Wes Peters <[EMAIL PROTECTED]> writes: > Are hash collisions handled reasonably? No, they're not handled at all. :-) Doing that would require: 1. remembering all the nodes that we have seen and the hash values given to them 2. having some backup-hash to use for the node that collides and then re-hash it (and remember that). The code is basically: vap->va_fileid = hash(fid); /assar To Unsubscribe: send mail to [EMAIL PROTECTED] with "unsubscribe freebsd-hackers" in the body of the message
- Re: Portable way to compare struct stat's? Garance A Drosihn
- Re: Portable way to compare struct stat... John Polstra
- Re: Portable way to compare struct... Daniel C. Sobral
- Re: Portable way to compare st... Wes Peters
- Re: Portable way to compare st... Daniel C. Sobral
- Re: Portable way to compare st... Daniel C. Sobral
- Re: Portable way to compare st... Wes Peters
- Re: Portable way to compare st... Robert Watson
- Re: Portable way to compare st... Assar Westerlund
- Re: Portable way to compare st... Wes Peters
- Re: Portable way to compare st... Assar Westerlund
- Re: Portable way to compare st... Garance A Drosihn
- Re: Portable way to compare st... Assar Westerlund
- Re: Portable way to compare st... Wes Peters
- Re: Portable way to compare st... Assar Westerlund
- Re: Portable way to compare struct... Garance A Drosihn
- Re: Portable way to compare struct stat's? Kelly Yancey
- Re: Portable way to compare struct stat's? Bill Studenmund
- Re: Portable way to compare struct stat's? Kelly Yancey
- Re: Portable way to compare struct stat's? Peter Wemm
- Re: Portable way to compare struct stat's? Randell Jesup